Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Compiling a default reasoning system into Prolog
New Generation Computing
A Prolog technology theorem prover: a new exposition and implementation in Prolog
Theoretical Computer Science - Selected papers on theoretical issues of design and implementation of symbolic computation systems
A strategy for the computation of conditional answers
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Linear resolution for consequence finding
Artificial Intelligence
Computing answers with model elimination
Artificial Intelligence
Minimal Answer Computation and SOL
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Mode-directed inverse entailment for full clausal theories
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Inference of gene relations from microarray data by abduction
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Evaluating abductive hypotheses using an EM algorithm on BDDs
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
SOLAR: An automated deduction system for consequence finding
AI Communications - Practical Aspects of Automated Reasoning
Mode-directed inverse entailment for full clausal theories
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Discovering rules by meta-level abduction
ILP'09 Proceedings of the 19th international conference on Inductive logic programming
Hypothesizing about causal networks with positive and negative effects by meta-level abduction
ILP'10 Proceedings of the 20th international conference on Inductive logic programming
Completing causal networks by meta-level abduction
Machine Learning
| Hi-index | 0.00 |
Abductive inference has long been associated with the logic of scientific discovery and automated abduction is now being used in real scientific tasks. But few methods can exploit the full potential of clausal logic and abduce non-ground explanations with indefinite answers. This paper shows how the consequence finding method of Skip Ordered Linear (SOL) resolution can overcome the limitations of existing systems by proposing a method that is sound and complete for finding minimal abductive solutions under a variety of pruning mechanisms. Its utility is shown with an example based on metabolic network modelling.