Pages that link to "Item:Q4371992"
From MaRDI portal
The following pages link to The IFF proof procedure for abductive logic programming (Q4371992):
Displaying 23 items.
- Abductive logic programming agents with destructive databases (Q656819) (← links)
- Three-valued completion for abductive logic programs (Q671511) (← links)
- Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules (Q833735) (← links)
- A formal analysis of interest-based negotiation (Q1039587) (← links)
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting (Q1614866) (← links)
- Obligation as optimal goal satisfaction (Q1670486) (← links)
- Abduction with probabilistic logic programming under the distribution semantics (Q2076968) (← links)
- Mapping deontic operators to abductive expectations (Q2509082) (← links)
- Answers that Have Integrity (Q3092322) (← links)
- SELECT TOPICS IN LEGAL EVIDENCE AND ASSISTANCE BY ARTIFICIAL INTELLIGENCE TECHNIQUES (Q3393491) (← links)
- ${\cal B}$ -Tropos (Q3602948) (← links)
- Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules (Q3616884) (← links)
- The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments (Q3648356) (← links)
- SLDNFA: An abductive procedure for abductive logic programs (Q3841101) (← links)
- Programming in logic without logic programming (Q4593027) (← links)
- Stabilization of Information Sharing for Queries Answering in Multiagent Systems (Q4649726) (← links)
- Dischargeable Obligations in the 𝒮CIFF Framework (Q4988947) (← links)
- Nonground Abductive Logic Programming with Probabilistic Integrity Constraints (Q5019597) (← links)
- Integration of Abductive Reasoning and Constraint Optimization in SCIFF (Q5325766) (← links)
- Logics in Artificial Intelligence (Q5394111) (← links)
- AI*IA 2005: Advances in Artificial Intelligence (Q5475747) (← links)
- AI*IA 2003: Advances in Artificial Intelligence (Q5897325) (← links)
- A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics (Q5958767) (← links)
