Abstract
We introduce a Three Tier Tree Calculus (T3C) that defines in a systematic way three tiers of tree structures underlying proof search in logic programming. We use T3C to define a new - structural - version of resolution for logic programming.
Original language | English |
---|---|
Title of host publication | Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015) |
Editors | Marina De Vos , Thomas Eiter, Yuliya Lierler, Francesca Toni |
Number of pages | 13 |
Publication status | Published - 2015 |
Event | 31st International Conference on Logic Programming - University College Cork, Western Gateway Building, Cork, Ireland Duration: 31 Aug 2015 → 4 Sept 2015 http://booleconferences.ucc.ie/iclp2015 |
Publication series
Name | CEUR workshop proceedings |
---|---|
Volume | 1433 |
ISSN (Electronic) | 1613-0073 |
Conference
Conference | 31st International Conference on Logic Programming |
---|---|
Abbreviated title | ICLP 2015 |
Country/Territory | Ireland |
City | Cork |
Period | 31/08/15 → 4/09/15 |
Internet address |
Keywords
- Derivation trees
- Rewriting trees
- Structural resolution
- Term trees
ASJC Scopus subject areas
- General Computer Science