Sciweavers

CORR
2011
Springer
126views Education» more  CORR 2011»
13 years 3 months ago
New Polynomial Classes for Logic-Based Abduction
We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given pro...
Bruno Zanuttini
AI
2008
Springer
13 years 11 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
IJCAI
1993
14 years 23 days ago
The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
We consider the computational complexity of evaluating nested counterfactuals over a propositional knowledge base. Counterfactual implication models a statement "if p, then q...
Thomas Eiter, Georg Gottlob
AAAI
1998
14 years 24 days ago
Two Forms of Dependence in Propositional Logic: Controllability and Definability
We investigate two forms of dependence between variables and/or formulas within a propositional knowledge base: controllability (a set of variables X controls a formula , if there...
Jérôme Lang, Pierre Marquis