Sciweavers

4 search results - page 1 / 1
» The Complexity of Restricted Consequence Finding and Abducti...
Sort
View
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
IJCAI
2001
13 years 6 months ago
Efficient Consequence Finding
We present an extensive experimental study of consequence-finding algorithms based on kernel resolution, using both a trie-based and a novel ZBDD-based implementation, which uses ...
Laurent Simon, Alvaro del Val
AI
2008
Springer
13 years 5 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
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 5 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon