Structural Resolution for Logic Programming
- ASU Author/Contributor (non-ASU co-authors, if there are any, appear on document)
- Patricia Johann Ph.D, Professor (Creator)
- Institution
- Appalachian State University (ASU )
- Web Site: https://library.appstate.edu/
Abstract: We introduce a Three Tier Tree Calculus (T 3C) that defines in a systematic way three tiers of tree structures underlying proof search in logic programming. We use T 3C to define a new – structural –version of resolution for logic programming.
Structural Resolution for Logic Programming
PDF (Portable Document Format)
146 KB
Created on 8/8/2016
Views: 297
Additional Information
- Publication
- Structural Resolution for Logic Programming. Patricia Johann, Ekaterina Komendantskaya, and Vladimir Komendantskiy. Technical Communications of International Conference on Logic Programming (ICLP'15). Version Of Record Available From www.arxiv.org
- Language: English
- Date: 2015
- Keywords
- Structural Resolution, Term trees, Rewriting trees, Derivation trees.