The IFF proof procedure for abductive logic programming
From MaRDI portal
Publication:4371992
DOI10.1016/S0743-1066(97)00026-5zbMath0890.68029OpenAlexW2071787143MaRDI QIDQ4371992
Publication date: 21 January 1998
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0743-1066(97)00026-5
Related Items (17)
Abduction in logic programming: A new definition and an abductive procedure based on rewriting ⋮ Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules ⋮ Integration of Abductive Reasoning and Constraint Optimization in SCIFF ⋮ Obligation as optimal goal satisfaction ⋮ Programming in logic without logic programming ⋮ Abductive logic programming agents with destructive databases ⋮ Stabilization of Information Sharing for Queries Answering in Multiagent Systems ⋮ ${\cal B}$ -Tropos ⋮ Mapping deontic operators to abductive expectations ⋮ Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules ⋮ Answers that Have Integrity ⋮ SELECT TOPICS IN LEGAL EVIDENCE AND ASSISTANCE BY ARTIFICIAL INTELLIGENCE TECHNIQUES ⋮ The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments ⋮ Dischargeable Obligations in the 𝒮CIFF Framework ⋮ Abduction with probabilistic logic programming under the distribution semantics ⋮ A formal analysis of interest-based negotiation ⋮ Nonground Abductive Logic Programming with Probabilistic Integrity Constraints
This page was built for publication: The IFF proof procedure for abductive logic programming
