The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments
From MaRDI portal
Publication:3648356
DOI10.1017/S1471068409990093zbMath1184.68161OpenAlexW2132042004WikidataQ62047999 ScholiaQ62047999MaRDI QIDQ3648356
Giacomo Terreni, Fariba Sadri, Francesca Toni, Ulle Endriss, Paolo Mancarella
Publication date: 25 November 2009
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068409990093
Related Items (5)
Reactive computing as model generation ⋮ Super-Solutions ⋮ Programming in logic without logic programming ⋮ Reactive Answer Set Programming ⋮ Answers that Have Integrity
Uses Software
Cites Work
- Unnamed Item
- A logic-based calculus of events
- A comparative study of eight constraint programming languages over the Boolean and finite domains
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting
- Cooperation and competition in ALIAS: A logic framework for agents that negotiate
- On the Relationship Between Abduction and Deduction
- Negation in logic programming
- SLDNFA: An abductive procedure for abductive logic programs
- An Efficient Unification Algorithm
- The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
- Theory and practice of constraint handling rules
- First order abduction via tableau and sequent calculi
- The well-founded semantics for general logic programs
- Logic programming and knowledge representation
- The IFF proof procedure for abductive logic programming
- ACLP: Abductive Constraint Logic Programming
- Abduction in well-founded semantics and generalized stable models via tabled dual programs
- The DLV system for knowledge representation and reasoning
- Verifiable agent interaction in abductive logic programming
- Abductive Logic Programming
- Integrating Answer Set Reasoning with Constraint Solving Techniques
This page was built for publication: The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments