Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Sheeran, G. Stålmarck (1998)
A Tutorial on Stålmarcks's Proof Procedure for Propositional Logic
O. Kullmann (2000)
An improved version of width restricted resolutionAi Magazine
Michael Alekhnovich, A. Razborov (2002)
Satisfiability, Branch-Width and Tseitin tautologiescomputational complexity, 20
O. Kullmann (2000)
Investigations on autark assignmentsDiscret. Appl. Math., 107
A. Goerdt (1993)
Regular Resolution Versus Unrestricted ResolutionSIAM J. Comput., 22
Joao Marques-Silva, K. Sakallah (1996)
GRASP-A new search algorithm for satisfiabilityProceedings of International Conference on Computer Aided Design
G. Stålmarck, M. Säflund (1990)
Modeling and Verifying Systems and Software in Propositional LogicIFAC Proceedings Volumes, 23
B. Courcelle, J. Makowsky, Udi Rotics (2000)
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-WidthTheory of Computing Systems, 33
B. Krishnamurthy, R. Moll (1981)
Examples of hard tautologies in the propositional calculus
J. Torán (1999)
Lower Bounds for Space in Resolution
Chin-Liang Chang (1970)
The Unit Proof and the Input Proof in Theorem ProvingJ. ACM, 17
T. Feder, Moshe Vardi (1999)
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group TheorySIAM J. Comput., 28
Michael Alekhnovich, S. Buss, S. Moran, T. Pitassi (1998)
Minimum propositional proof length is NP-hard to linearly approximateJournal of Symbolic Logic, 66
Chu Li, Anbulagan (1997)
Look-Ahead Versus Look-Back for Satisfiability Problems
Hantao Zhang (1997)
SATO: An Efficient Propositional Prover
D. Rose (1970)
Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 32
C.L. Chang (1970)
The unit proof and the input proof in theorem provingJournal of the Association for Computing Machinery, 17
U. Bertelè, F. Brioschi (1972)
Nonserial Dynamic Programming
M. Buro, H. Büning (1996)
On resolution with short clausesAnnals of Mathematics and Artificial Intelligence, 18
F. Harary (1969)
Graph theory
H. Bodlaender (1998)
A Partial k-Arboretum of Graphs with Bounded TreewidthTheor. Comput. Sci., 209
Z. Galil (1975)
On the validity and complexity of bounded resolutionProceedings of the seventh annual ACM symposium on Theory of computing
O. Kullmann (1999)
Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofsElectron. Colloquium Comput. Complex., TR99
Maria Bonet, T. Pitassi, R. Raz (1997)
No feasible interpolation for TC/sup 0/-Frege proofsProceedings 38th Annual Symposium on Foundations of Computer Science
D. Pretolani (1996)
Hierarchies of polynomially solvable satisfiability problemsAnnals of Mathematics and Artificial Intelligence, 17
G. Tseitin (1970)
Seminars in Mathematics, Vol. 8
O. Kullmann (1998)
Heuristics for SAT algorithms: Searching for some foundationsDiscrete Applied Mathematics
Michael Alekhnovich, A. Razborov (2001)
Resolution is not automatizable unless W[P] is tractableProceedings 2001 IEEE International Conference on Cluster Computing
Matthew Clegg, J. Edmonds, R. Impagliazzo (1996)
Using the Groebner basis algorithm to find proofs of unsatisfiability
Maria Bonet, Nicola Galesi (1999)
A study of proof search algorithms for resolution and polynomial calculus40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
G. Tseitin (1983)
On the Complexity of Derivation in Propositional Calculus
O. Kullmann (2001)
On the use of autarkies for satisfiability decisionElectron. Notes Discret. Math., 9
Eli Ben-Sasson, A. Wigderson (1999)
Short proofs are narrow-resolution made simpleProceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)
D. Mitchell (1998)
Hard Problems for CSP Algorithms
A. Baker (1995)
Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results
J. Esteban, J. Torán (1999)
Space Bounds for ResolutionInf. Comput., 171
P. Beame, T. Pitassi (1996)
Simplified and improved resolution lower boundsProceedings of 37th Conference on Foundations of Computer Science
J. Harrison (1996)
Stålmarck's Algorithm as a HOL Derived Rule
L. Lovász, M. Naor, I. Newman, A. Wigderson (1991)
Search problems in the decision tree model[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
G. Gallo, M. Scutellá (1988)
Polynomially Solvable Satisfiability ProblemsInf. Process. Lett., 29
R.A. Reckhow (1975)
On the lengths of proofs in the propositional calculus
H. Büning (1993)
On generalized Horn formulas and k-resolutionTheor. Comput. Sci., 116
N. Bourbaki (1989)
Algebra I: Chapters 1-3
M. Sheeran, G. Stålmarck (2000)
A Tutorial on Stålmarck's Proof Procedure for Propositional LogicFormal Methods in System Design, 16
S. Cook, R. Reckhow (1974)
On the lengths of proofs in the propositional calculus (Preliminary Version)
P. Liberatore (2000)
On the complexity of choosing the branching literal in DPLLArtif. Intell., 116
Martin Davis, H. Putnam (1960)
A Computing Procedure for Quantification TheoryJ. ACM, 7
Maria Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, T. Pitassi (1999)
Non-Automatizability of Bounded-Depth Frege Proofscomputational complexity, 13
S. Arnborg (1985)
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 25
K. Iwama (1997)
Complexity of Finding Short Resolution Proofs
A. Urquhart (1995)
The complexity of propositional proofsThe Bulletin of Symbolic Logic, 14
S. Yamasaki, S. Doshita (1984)
The Satisfiability Problem for a Class Consisting of Horn Sentences and Some Non-Horn Sentences in Proportional LogicInf. Control., 59
R. Dechter, I. Rish (1994)
Directional Resolution: The Davis-Putnam Procedure, Revisited
J. Groote, J. Warners (2000)
The Propositional Formula Checker HeerHugoJournal of Automated Reasoning, 24
R. Diestel (2000)
Graduate Texts in Mathematics, Vol. 173
R. Dechter, J. Pearl (1987)
Network-Based Heuristics for Constraint-Satisfaction ProblemsArtif. Intell., 34
Capturing propositional logic, constraint satisfaction problems and systems of polynomial equations, we introduce the notion of systems with finite instantiation by partial assignments, fipa-systems for short, which are independent of special representations of problem instances, but which are based on an axiomatic approach with instantiation (or substitution) by partial assignments as the fundamental notion. Fipa-systems seem to constitute the most general framework allowing for a theory of resolution with nontrivial upper and lower bounds. For every fipa-system we generalise relativised hierarchies originating from generalised Horn formulas [14,26,33,43], and obtain hierarchies of problem instances with recognition and satisfiability decision in polynomial time and linear space, quasi-automatising relativised and generalised tree resolution and utilising a general “quasi-tight” lower bound for tree resolution. And generalising width-restricted resolution from [7,14,25,33], for every fipa-system a (stronger) family of hierarchies of unsatisfiable instances with polynomial time recognition is introduced, weakly automatising relativised and generalised full resolution and utilising a general lower bound for full resolution generalising [7,17,25,33].
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 5, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.