Structural Resolution for Logic Programming

Patricia Johann, Ekaterina Komendantskaya, Vladimir Komendantskiy

Research output: Chapter in Book/Report/Conference proceedingChapter

15 Downloads (Pure)

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 publicationTechnical Communications of ICLP 2015
EditorsMarina De Vos, Thomas Eiter, Yuliya Lierler, Francesca Toni
PublisherCEUR-WS
Number of pages13
Publication statusPublished - 2015
Event31st International Conference on Logic Programming 2015 - Cork, Ireland
Duration: 31 Aug 20154 Sep 2015

Publication series

NameCEUR Workshop Proceedings
PublisherCEUR
Volume1433
ISSN (Print)1613-0073

Conference

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

Keywords

  • Structural resolution
  • term trees
  • rewriting trees
  • derivation trees

Fingerprint Dive into the research topics of 'Structural Resolution for Logic Programming'. Together they form a unique fingerprint.

  • Cite this

    Johann, P., Komendantskaya, E., & Komendantskiy, V. (2015). Structural Resolution for Logic Programming. In M. De Vos, T. Eiter, Y. Lierler, & F. Toni (Eds.), Technical Communications of ICLP 2015 (CEUR Workshop Proceedings; Vol. 1433). CEUR-WS. http://www.scopus.com/inward/record.url?scp=84944269930&partnerID=8YFLogxK