Skip to search formSkip to main contentSkip to account menu

Propositional proof system

In propositional calculus and proof complexity a propositional proof system (pps), also called a Cook–Reckhow propositional proof system, is system… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
All solutions SAT (AllSAT) is the problem of generating satisfying assignments to a given conjunctive normal form (CNF) and has… 
2017
2017
Delete Resolution Asymmetric Tautology (DRAT) proofs have become a de facto standard to certify unsatisfiability results from SAT… 
2012
2012
Abstract Notions of k-asimulation and asimulation are introduced as asymmetric counterparts to k-bisimulation and bisimulation… 
2010
2010
Graph transformation units are rule-based devices to model graph algorithms, graph processes, and the dynamics of systems the… 
2009
2009
A clause set is renamable Horn if the result replacing part propositional variable with its complement is a set of Horn clauses… 
2007
2007
We study—within the framework of propositional proof complexity—the problem of certifying unsatisfiability of CNF formulas under… 
2001
2001
Propositional Proof Complexity is an active area of research whose main focus is the study of the length of proofs in… 
2000
2000
ALGORITHMS FOR k-SAT BASED ON COVERING CODES Evgeny DANTSIN1 Edward A. HIRSCH2 Russian A ademy of S ien es Russian A ademy of S… 
1998
1998
We investigate suucient conditions for the existence of optimal propositional proof systems. We concentrate on conditions of the… 
1997
1997
In this paper we prove that if there exists an optimal quan-tiied propositional proof system then there exists a complete…