Sciweavers

14 search results - page 1 / 3
» Counting Complexity of Propositional Abduction
Sort
View
IJCAI
2007
13 years 6 months ago
Counting Complexity of Propositional Abduction
Abduction is an important method of non-monotonic reasoning with many applications in artificial intelligence and related topics. In this paper, we concentrate on propositional ab...
Miki Hermann, Reinhard Pichler
AI
2008
Springer
13 years 4 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini
CSL
2003
Springer
13 years 9 months ago
Generating All Abductive Explanations for Queries on Propositional Horn Theories
Abstract. Abduction is a fundamental mode of reasoning, which has taken on increasing importance in Artificial Intelligence (AI) and related disciplines. Computing abductive expla...
Thomas Eiter, Kazuhisa Makino
STACS
1993
Springer
13 years 8 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
AAAI
2000
13 years 6 months ago
The Complexity of Restricted Consequence Finding and Abduction
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
Alvaro del Val