Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,757 papers from all fields of science
Search
Sign In
Create Free Account
Propositional proof system
In propositional calculus and proof complexity a propositional proof system (pps), also called a Cook–Reckhow propositional proof system, is system…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
AC0
Cutting-plane method
DPLL algorithm
Frege system
Expand
Broader (4)
Automated theorem proving
Computational complexity theory
Logic in computer science
Propositional calculus
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Exploiting Functional Dependencies of Variables in All Solutions SAT Solvers
Takahisa Toda
,
Takeru Inoue
Journal of Information Processing
2017
Corpus ID: 207318489
All solutions SAT (AllSAT) is the problem of generating satisfying assignments to a given conjunctive normal form (CNF) and has…
Expand
2017
2017
Towards a Semantics of Unsatisfiability Proofs with Inprocessing
Tobias Philipp
,
Adrián Rebola-Pardo
Logic Programming and Automated Reasoning
2017
Corpus ID: 8476576
Delete Resolution Asymmetric Tautology (DRAT) proofs have become a de facto standard to certify unsatisfiability results from SAT…
Expand
2012
2012
MODEL-THEORETIC CHARACTERIZATION OF INTUITIONISTIC PROPOSITIONAL FORMULAS
Grigory K. Olkhovikov
The Review of Symbolic Logic
2012
Corpus ID: 10581478
Abstract Notions of k-asimulation and asimulation are introduced as asymmetric counterparts to k-bisimulation and bisimulation…
Expand
2010
2010
Graph Transformation Units Guided by a SAT Solver
H. Kreowski
,
Sabine Kuske
,
R. Wille
International Conference on Graph Transformation
2010
Corpus ID: 14966231
Graph transformation units are rule-based devices to model graph algorithms, graph processes, and the dynamics of systems the…
Expand
2009
2009
Maximum Renamable Horn and Maximum Independent Sets
Yongbin Qin
,
Daoyun Xu
WRI World Congress on Computer Science and…
2009
Corpus ID: 19151463
A clause set is renamable Horn if the result replacing part propositional variable with its complement is a set of Horn clauses…
Expand
2007
2007
Complexity of propositional proofs under a promise
N. Dershowitz
,
Iddo Tzameret
TOCL
2007
Corpus ID: 800763
We study—within the framework of propositional proof complexity—the problem of certifying unsatisfiability of CNF formulas under…
Expand
2001
2001
The Complexity of Resource-Bounded Propositional Proofs
Luisa Bonet
2001
Corpus ID: 15189315
Propositional Proof Complexity is an active area of research whose main focus is the study of the length of proofs in…
Expand
2000
2000
Algorithms for k-SAT based on covering codes
E. Dantsin
,
E. Hirsch
2000
Corpus ID: 1362149
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…
Expand
1998
1998
On the Existence of Optimal Propositional Proof Systems and Oracle-relativized Propositional Logic
Shai Ben-David
,
Anna Gringauzey
1998
Corpus ID: 1630848
We investigate suucient conditions for the existence of optimal propositional proof systems. We concentrate on conditions of the…
Expand
1997
1997
On an Optimal Quantiied Propositional Proof System and a Complete Language for Np \ Co-np
Zenon Sadowski
1997
Corpus ID: 18538031
In this paper we prove that if there exists an optimal quan-tiied propositional proof system then there exists a complete…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE