11 search results - page 1 / 3 » Towards Polynomial Approximations of Full Propositional Logi... |
SBIA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. The aim of this paper is to study a family of logics that approximates classical inference, in which every step in the approximation can be decided in polynomial time. Fo...
JOLLI
2006
13 years 4 months ago
2006
Abstract. In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce ...
AAAI
2006
13 years 6 months ago
2006
We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...
ICFP
2003
ACM
14 years 4 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
LPNMR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and checkâ...