### Abstract

We introduce a Three Tier Tree Calculus (T^{3}C) that defines in a systematic way three tiers of tree structures underlying proof search in logic programming. We use T^{3}C 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 Sep 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 | Ireland |

City | Cork |

Period | 31/08/15 → 4/09/15 |

Internet address |

### Fingerprint

### Keywords

- Derivation trees
- Rewriting trees
- Structural resolution
- Term trees

### Cite this

*Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015)*(CEUR workshop proceedings; Vol. 1433).

}

*Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015) .*CEUR workshop proceedings, vol. 1433, 31st International Conference on Logic Programming, Cork, Ireland, 31/08/15.

**Structural resolution for logic programming.** / Johann, Patricia; Komendantskaya, Ekaterina; Komendantskiy, Vladimir.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Structural resolution for logic programming

AU - Johann, Patricia

AU - Komendantskaya, Ekaterina

AU - Komendantskiy, Vladimir

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

KW - Derivation trees

KW - Rewriting trees

KW - Structural resolution

KW - Term trees

UR - http://www.scopus.com/inward/record.url?scp=84944269930&partnerID=8YFLogxK

M3 - Conference contribution

T3 - CEUR workshop proceedings

BT - Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015)

A2 - De Vos , Marina

A2 - Eiter, Thomas

A2 - Lierler, Yuliya

A2 - Toni , Francesca

ER -