Conditional Pure Literal Graphs

Authors:
Marco Benedetti
Affiliations:
-
Venue:
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Year:
2001

Citing 15
Cited 0

Improvements to propositional satisfiability search algorithms

Improvements to propositional satisfiability search algorithms
On semantic resolution with lemmaizing and contraction and a formal treatment of caching

New Generation Computing
Mechanical Theorem-Proving by Model Elimination

Journal of the ACM (JACM)
A Simplified Format for the Model Elimination Theorem-Proving Procedure

Journal of the ACM (JACM)
An Implementation of the Model Elimination Proof Procedure

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
A propositional theorem prover to solve planning and other problems

Annals of Mathematics and Artificial Intelligence
The Use of Lemmas in the Model Elimination Procedure

Journal of Automated Reasoning
Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy

Journal of Automated Reasoning
Caching and Lemmaizing in Model Elimination Theorem Provers

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
The Search Efficiency of Theorem Proving Strategies

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
SIMULTANEOUS CONSTRUCTION OF REFUTATIONS AND MODELS FOR PROPOSITIONAL FORMULAS

SIMULTANEOUS CONSTRUCTION OF REFUTATIONS AND MODELS FOR PROPOSITIONAL FORMULAS
Heuristics based on unit propagation for satisfiability problems

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Solving satisfiability in less than 2n steps

Discrete Applied Mathematics
Using CSP look-back techniques to solve real-world SAT instances

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conditional Pure Literal Graphs (CPLG) characterize the set of models of a propositional formula and are introduced to help understand connections among formulas, models and autarkies. They have been applied to the SAT problem within the framework of refutation-based algorithms. Experimental results and comparisons show that the use of CPLGs is a promising direction towards efficient propositional SAT solvers based upon model elimination. In addition, they open a new perspective on hybrid search/resolution schemes.