Sacre: a constraint satisfaction problem based theorem prover

Authors:
Jean-Michel Richer;Jean-Jacques Chabrier
Affiliations:
-;-
Venue:
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Year:
1999

Citing 11
Cited 0

Depth-first iterative-deepening: an optimal admissible tree search

Artificial Intelligence
Termination of rewriting

Journal of Symbolic Computation
Non-horn clause logic programming without contrapositives

Journal of Automated Reasoning
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems

Artificial Intelligence - Special volume on constraint-based reasoning
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
The Design of the CADE-13 ATP System Competition

Journal of Automated Reasoning
CLIN-S - A Semantically Guided First-Order Theorem Prover

Journal of Automated Reasoning
Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux

TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
SATCHMO: A Theorem Prover Implemented in Prolog

Proceedings of the 9th International Conference on Automated Deduction
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)
A proof method for quantification theory: its justification and realization

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of this paper is to present a new approach for solving first-order predicate logic problems stated in conjunctive normal form. We propose to combine resolution with the Constraint Satisfaction Problem (CSP) paradigm to prove the inconsistency and find a model of a problem. The resulting method benefits from resolution and constraint satisfaction techniques and seems very efficient when confronted to some problems of the CADE-13 competition.