64 search results - page 1 / 13 » Tractable Classes for Directional Resolution |
AAAI
2000
14 years 6 days ago
2000
SIAMCOMP
2008
13 years 10 months ago
2008
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
CIE
2010
Springer
14 years 13 days ago
2010
Springer
We study classes of propositional contradictions based on the Least Number Principle (LNP) in the refutation system of Resolution and its generalisations with bounded conjunction, ...
AAAI
2000
14 years 6 days ago
2000
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
AIPS
2007
14 years 1 months ago
2007
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...