725 search results - page 12 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
120
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
102
Voted
APAL
2008
15 years 2 months ago
2008
We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It ...
157
Voted
AI
2004
Springer
15 years 2 months ago
2004
Springer
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
153
click to vote
CONCUR
2006
Springer
15 years 4 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
113
click to vote
CSR
2006
Springer
15 years 6 months ago
2006
Springer
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...