Document Open Access Logo

Runtime Addition of Integrity Constraints in an Abductive Proof Procedure

Authors Marco Alberti, Marco Gavanelli, Evelina Lamma

Thumbnail PDF


  • Filesize: 0.55 MB
  • 10 pages

Document Identifiers

Author Details

Marco Alberti
Marco Gavanelli
Evelina Lamma

Cite AsGet BibTex

Marco Alberti, Marco Gavanelli, and Evelina Lamma. Runtime Addition of Integrity Constraints in an Abductive Proof Procedure. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 4-13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)


Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relationships that abductive answers are required to satisfy. Integrity constraints are usually known a priori. However, in some applications (such as interactive abductive logic programming, multi-agent interactions, contracting) it makes sense to relax this assumption, in order to let the abductive reasoning start with incomplete knowledge of integrity constraints, and to continue without restarting when new integrity constraints become known. In this paper, we propose a declarative semantics for abductive logic programming with addition of integrity constraints during the abductive reasoning process, an operational instantiation (with formal termination, soundness and completeness properties) and an implementation of such a framework based on the SCIFF language and proof procedure.
  • Abduction
  • semantics
  • interactive computation
  • proof procedure


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail