Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,206,578 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.
2010
2010
An Effective Approach for Verifying Product Lines in Presence of Variability Models
Hamideh Sabouri
,
R. Khosravi
SPLC Workshops
2010
Corpus ID: 28513603
Software product lines are built around the central notion of variability. A variability model specifies possible variations…
Expand
2008
2008
Extending Attribute Exploration by Means of Boolean Derivatives
Gonzalo A. Aranda-Corral
2008
Corpus ID: 5645150
We present a translation of problems of Formal Context Analysis into ideals problems in F2(x) through the Boolean derivatives…
Expand
2007
2007
Propositional Calculus via Constraint Networks
C. Bessiere
2007
Corpus ID: 6264656
Propositional calculus is a well known and widely treated search area. But, studying it, we can see that using the disposition of…
Expand
2006
2006
Using Sets of Probability Measures to Represent Uncertainty
Joseph Y. Halpern
arXiv.org
2006
Corpus ID: 3258217
The material in this chapter is taken, often verbatim, from [Halpern 2003], which the reader is encouraged to consult for further…
Expand
2003
2003
Three Types of Kes-Nominalization in Korean
Min-Joo Kim
2003
Corpus ID: 42803895
In Korean, the Internally Headed Relative Clause Construction (IHRC), illustrated in (1), the Direct Perception Construction (DPC…
Expand
2001
2001
The Complexity of Resource-Bounded Propositional Proofs
Albert Atserias
,
José Luis
,
Balcázar María
,
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
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
1998
1998
Assumption-Based Reasoning with Finite Set Constraints
R. Haenni
,
Norbert Lehmann
1998
Corpus ID: 14040537
In this paper we present an extension of the traditional approach to assumption-based reasoning. Instead of propositional logic…
Expand
1996
1996
The beginnings of Western music in Meiji Era Japan : thesis submitted for the degree "doctor of philosophy" : submitted to the Senate of Tel-Aviv University
1996
Corpus ID: 68744028
This volume investigates the introduction of Western music into the educational system of Japan and reveals the existence of…
Expand
1981
1981
Examples of hard tautologies and worst-case complexity results for propositional proof systems
B. Krishnamurthy
1981
Corpus ID: 117018859
We present examples of hard tautologies in propositional calculus, i.e., tautologies for which no short proofs are known. Our…
Expand