Justifications for logic programming

Carlos Viegas Damásio; Anastasia Analyti; Grigoris Antoniou

doi:10.1007/978-3-642-40564-8_53

Justifications for logic programming

Carlos Viegas Damásio, Anastasia Analyti, Grigoris Antoniou

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

29 Citations (Scopus)

Abstract

Understanding why and how a given answer to a query is generated from a deductive or relational database is fundamental to obtain justifications, assess trust, and detect dependencies on contradictions. Propagating provenance information is a major technique that evolved in the database literature to address the problem, using annotated relations with values from a semiring. The case of positive programs/relational algebra is well-understood but handling negation (or set difference in relational algebra) has not been addressed in its full generality or has deficiencies. The approach defined in this work provides full provenance information for logic programs under the least model, well-founded semantics and answer set semantics, and is related to the major existing notions of justifications for all these logic programming semantics.

Original language	English
Title of host publication	Logic Programming and Nonmonotonic Reasoning
Subtitle of host publication	12th International Conference, LPNMR 2013, Proceedings
Editors	Pedro Cabalar
Pages	530-542
Number of pages	13
ISBN (Electronic)	9783642405648
DOIs	https://doi.org/10.1007/978-3-642-40564-8_53
Publication status	Published - 22 Oct 2013
Event	12th International Conference on Logic Programming and Nonmonotonic Reasoning - Corunna, Spain Duration: 15 Sep 2013 → 19 Sep 2013 Conference number: 12 http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=27190&copyownerid=20998 (Link to Conference Information)

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8148 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	12th International Conference on Logic Programming and Nonmonotonic Reasoning
Abbreviated title	LPNMR 2013
Country/Territory	Spain
City	Corunna
Period	15/09/13 → 19/09/13
Internet address	http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=27190&copyownerid=20998 (Link to Conference Information)

Access to Document

10.1007/978-3-642-40564-8_53Licence: Unspecified

Cite this

Viegas Damásio, C., Analyti, A., & Antoniou, G. (2013). Justifications for logic programming. In P. Cabalar (Ed.), Logic Programming and Nonmonotonic Reasoning : 12th International Conference, LPNMR 2013, Proceedings (pp. 530-542). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8148 LNAI). https://doi.org/10.1007/978-3-642-40564-8_53

Viegas Damásio, Carlos ; Analyti, Anastasia ; Antoniou, Grigoris. / Justifications for logic programming. Logic Programming and Nonmonotonic Reasoning : 12th International Conference, LPNMR 2013, Proceedings. editor / Pedro Cabalar. 2013. pp. 530-542 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{f721af4296aa441cb099b1ffd223ee8b,

title = "Justifications for logic programming",

abstract = "Understanding why and how a given answer to a query is generated from a deductive or relational database is fundamental to obtain justifications, assess trust, and detect dependencies on contradictions. Propagating provenance information is a major technique that evolved in the database literature to address the problem, using annotated relations with values from a semiring. The case of positive programs/relational algebra is well-understood but handling negation (or set difference in relational algebra) has not been addressed in its full generality or has deficiencies. The approach defined in this work provides full provenance information for logic programs under the least model, well-founded semantics and answer set semantics, and is related to the major existing notions of justifications for all these logic programming semantics.",

keywords = "logic program, reltional algebra, boolean formula, conjunctive query, provenance information",

author = "{Viegas Dam{\'a}sio}, Carlos and Anastasia Analyti and Grigoris Antoniou",

year = "2013",

month = oct,

day = "22",

doi = "10.1007/978-3-642-40564-8_53",

language = "English",

isbn = "9783642405631",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "530--542",

editor = "Pedro Cabalar",

booktitle = "Logic Programming and Nonmonotonic Reasoning",

note = "12th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2013 ; Conference date: 15-09-2013 Through 19-09-2013",

url = "http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=27190&copyownerid=20998",

}

Viegas Damásio, C, Analyti, A & Antoniou, G 2013, Justifications for logic programming. in P Cabalar (ed.), Logic Programming and Nonmonotonic Reasoning : 12th International Conference, LPNMR 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8148 LNAI, pp. 530-542, 12th International Conference on Logic Programming and Nonmonotonic Reasoning, Corunna, Spain, 15/09/13. https://doi.org/10.1007/978-3-642-40564-8_53

Justifications for logic programming. / Viegas Damásio, Carlos; Analyti, Anastasia; Antoniou, Grigoris.

Logic Programming and Nonmonotonic Reasoning : 12th International Conference, LPNMR 2013, Proceedings. ed. / Pedro Cabalar. 2013. p. 530-542 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8148 LNAI).

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

TY - GEN

T1 - Justifications for logic programming

AU - Viegas Damásio, Carlos

AU - Analyti, Anastasia

AU - Antoniou, Grigoris

N1 - Conference code: 12

PY - 2013/10/22

Y1 - 2013/10/22

N2 - Understanding why and how a given answer to a query is generated from a deductive or relational database is fundamental to obtain justifications, assess trust, and detect dependencies on contradictions. Propagating provenance information is a major technique that evolved in the database literature to address the problem, using annotated relations with values from a semiring. The case of positive programs/relational algebra is well-understood but handling negation (or set difference in relational algebra) has not been addressed in its full generality or has deficiencies. The approach defined in this work provides full provenance information for logic programs under the least model, well-founded semantics and answer set semantics, and is related to the major existing notions of justifications for all these logic programming semantics.

AB - Understanding why and how a given answer to a query is generated from a deductive or relational database is fundamental to obtain justifications, assess trust, and detect dependencies on contradictions. Propagating provenance information is a major technique that evolved in the database literature to address the problem, using annotated relations with values from a semiring. The case of positive programs/relational algebra is well-understood but handling negation (or set difference in relational algebra) has not been addressed in its full generality or has deficiencies. The approach defined in this work provides full provenance information for logic programs under the least model, well-founded semantics and answer set semantics, and is related to the major existing notions of justifications for all these logic programming semantics.

KW - logic program

KW - reltional algebra

KW - boolean formula

KW - conjunctive query

KW - provenance information

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

U2 - 10.1007/978-3-642-40564-8_53

DO - 10.1007/978-3-642-40564-8_53

M3 - Conference contribution

AN - SCOPUS:84885700991

SN - 9783642405631

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 530

EP - 542

BT - Logic Programming and Nonmonotonic Reasoning

A2 - Cabalar, Pedro

T2 - 12th International Conference on Logic Programming and Nonmonotonic Reasoning

Y2 - 15 September 2013 through 19 September 2013

ER -

Viegas Damásio C, Analyti A, Antoniou G. Justifications for logic programming. In Cabalar P, editor, Logic Programming and Nonmonotonic Reasoning : 12th International Conference, LPNMR 2013, Proceedings. 2013. p. 530-542. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-40564-8_53

Justifications for logic programming

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this