Justifications for logic programming

Carlos Viegas Damásio, Anastasia Analyti, Grigoris Antoniou

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

21 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 languageEnglish
Title of host publicationLogic Programming and Nonmonotonic Reasoning - 12th International Conference, LPNMR 2013, Proceedings
Pages530-542
Number of pages13
Volume8148 LNAI
DOIs
Publication statusPublished - 2013
Event12th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2013 - Corunna, Spain
Duration: 15 Sep 201319 Sep 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8148 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Conference

Conference12th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2013
CountrySpain
CityCorunna
Period15/09/1319/09/13

Fingerprint

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

Cite this