Structural resolution for logic programming

Patricia Johann, Ekaterina Komendantskaya, Vladimir Komendantskiy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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 languageEnglish
Title of host publicationProceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015)
EditorsMarina De Vos , Thomas Eiter, Yuliya Lierler, Francesca Toni
Number of pages13
Publication statusPublished - 2015
Event31st International Conference on Logic Programming - University College Cork, Western Gateway Building, Cork, Ireland
Duration: 31 Aug 20154 Sep 2015
http://booleconferences.ucc.ie/iclp2015

Publication series

NameCEUR workshop proceedings
Volume1433
ISSN (Electronic)1613-0073

Conference

Conference31st International Conference on Logic Programming
Abbreviated titleICLP 2015
CountryIreland
CityCork
Period31/08/154/09/15
Internet address

Keywords

  • Derivation trees
  • Rewriting trees
  • Structural resolution
  • Term trees

Fingerprint Dive into the research topics of 'Structural resolution for logic programming'. Together they form a unique fingerprint.

Cite this