Structural resolution for logic programming

Patricia Johann, Ekaterina Komendantskaya, Vladimir Komendantskiy

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

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

Fingerprint

Logic programming

Keywords

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

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.), Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015) (CEUR workshop proceedings; Vol. 1433).
Johann, Patricia ; Komendantskaya, Ekaterina ; Komendantskiy, Vladimir. / Structural resolution for logic programming. Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015) . editor / Marina De Vos ; Thomas Eiter ; Yuliya Lierler ; Francesca Toni . 2015. (CEUR workshop proceedings).
@inproceedings{c112286eeb9847d0aefdad9b33c7d71d,
title = "Structural resolution for logic programming",
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.",
keywords = "Derivation trees, Rewriting trees, Structural resolution, Term trees",
author = "Patricia Johann and Ekaterina Komendantskaya and Vladimir Komendantskiy",
year = "2015",
language = "English",
series = "CEUR workshop proceedings",
editor = "{De Vos }, {Marina } and Eiter, {Thomas } and Lierler, {Yuliya } and {Toni }, {Francesca }",
booktitle = "Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015)",

}

Johann, P, Komendantskaya, E & Komendantskiy, V 2015, Structural resolution for logic programming. in M De Vos , T Eiter, Y Lierler & F Toni (eds), 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.

Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015) . ed. / Marina De Vos ; Thomas Eiter; Yuliya Lierler; Francesca Toni . 2015. (CEUR workshop proceedings; Vol. 1433).

Research output: Chapter in Book/Report/Conference proceedingConference 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 -

Johann P, Komendantskaya E, Komendantskiy V. Structural resolution for logic programming. In De Vos M, Eiter T, Lierler Y, Toni F, editors, Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015) . 2015. (CEUR workshop proceedings).