Geometric resolution: A proof procedure based on finite model search

Hans De Nivelle*, Jia Meng

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

34 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationAutomated Reasoning - Third International Joint Conference, IJCAR 2006, Proceedings
PublisherSpringer Verlag
Pages303-317
Number of pages15
ISBN (Print)3540371877, 9783540371878
DOIs
Publication statusPublished - 2006
Externally publishedYes
EventThird International Joint Conference on Automated Reasoning, IJCAR 2006 - Seattle, WA, United States
Duration: 17 Aug 200620 Aug 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4130 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceThird International Joint Conference on Automated Reasoning, IJCAR 2006
Country/TerritoryUnited States
CitySeattle, WA
Period17/08/0620/08/06

Fingerprint

Dive into the research topics of 'Geometric resolution: A proof procedure based on finite model search'. Together they form a unique fingerprint.

Cite this