52 search results - page 2 / 11 » On the Automatizability of Resolution and Related Propositio... |
TAMC
2010
Springer
14 years 1 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
CIE
2010
Springer
13 years 10 months 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, ...
ICALP
2007
Springer
14 years 2 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...
JANCL
2006
13 years 8 months ago
2006
We describe a relational framework that uniformly supports formalization and automated reasoning in various propositional modal logics. The proof system we propose is a relational ...
BIRTHDAY
2006
Springer
14 years 8 days ago
2006
Springer
