Geometric resolution: a proof procedure based on finite model search

Authors:
Hans de Nivelle;Jia Meng
Affiliations:
Max-Planck Institut für Informatik, Germany;National ICT Australia, Australia
Venue:
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Year:
2006

Citing 9
Cited 17

ModGen: theorem proving by model generation

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
A Deduction Method Complete for Refutation and Finite Satisfiability

JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
The Quest for Efficient Boolean Satisfiability Solvers

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Deciding the guarded fragments by resolution

Journal of Symbolic Computation
A Superposition Decision Procedure for the Guarded Fragment with Equality

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
SCOTT: a model-guided theorem prover

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
SEM: a system for enumerating models

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Automating coherent logic

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

The 3rd IJCAR Automated Theorem Proving Competition

AI Communications
Logical Engineering with Instance-Based Methods

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
System Description: E- KRHyper

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Deciding Effectively Propositional Logic Using DPLL and Substitution Sets

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Skolem Machines

Fundamenta Informaticae - Machines, Computations and Universality, Part I
Automated verification of refinement laws

Annals of Mathematics and Artificial Intelligence
The CADE-22 automated theorem proving system competition - CASC-22

AI Communications
Deciding Effectively Propositional Logic Using DPLL and Substitution Sets

Journal of Automated Reasoning
Skolem machines and geometric logic

ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Bounded relational analysis of free data types

TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Classical Logic with Partial Functions

Journal of Automated Reasoning
Lemma learning in the model evolution calculus

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Classical logic with partial functions

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Model Evolution with equality - Revised and implemented

Journal of Symbolic Computation
CDCL-based abstract state transition system for coherent logic

CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Skolem Machines

Fundamenta Informaticae - Machines, Computations and Universality, Part I
Superposition for bounded domains

Automated Reasoning and Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on geometric formulas. For this reason we call the procedure geometric resolution. We expect that the procedure can be used as an efficient proof search procedure for first-order logic. In addition, the procedure can be implemented in such a way that it is complete for finding finite models.