Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

de Nivelle, Hans
Meng, Jia

dblp
dblp

Not MPG Author(s):

Meng, Jia

Editor(s):

Furbach, Ulrich
Shankar, Natarajan

dblp
dblp

Not MPII Editor(s):

Furbach, Ulrich
Shankar, Natarajan

BibTeX cite key*:

deNivelleMeng2006a

Title, Booktitle

Title*:

Geometric Resolution: A Proof Procedure Based on Finite Model Search

Booktitle*:

Automated reasoning : Third International Joint Conference, IJCAR 2006

Event, URLs

URL of the conference:

http://www.easychair.org/FLoC-06/

URL for downloading the paper:

http://www.springerlink.com/content/w322725505663h74/fulltext.pdf

Event Address*:

Seattle, WA, USA

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

17 August 2006

Event End Date:

20 August 2006

Publisher

Name*:

Springer

URL:

http://www.springer.com/

Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Artificial Intelligence

Volume:

4130

Number:


Month:

August

Pages:

303-317

Year*:

2006

VG Wort Pages:

15

ISBN/ISSN:

978-3-540-37187-8; 3-540-37187-7; ISSN 0302-9743

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

We present a proof search procedure which is
complete for first-order logic, but which also can be
used when searching for finite models.
The procedure uses a normal form that is closely related to
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.
We will point out how the procedure can be implemented
in such a way that it is complete for finite models
without loosing completeness for unsatisfiability.
We will also discuss two refinements of the initial procedure,
namely subsumption and functional reduction, and prove
their completeness.
Finally, we will discuss how the calculus can be implemented.

URL for the Abstract:

http://dx.doi.org/10.1007/11814771_28



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Programming Logics Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, CCL bibliography, VG Wort



BibTeX Entry:

@INPROCEEDINGS{deNivelleMeng2006a,
AUTHOR = {de Nivelle, Hans and Meng, Jia},
EDITOR = {Furbach, Ulrich and Shankar, Natarajan},
TITLE = {Geometric Resolution: A Proof Procedure Based on Finite Model Search},
BOOKTITLE = {Automated reasoning : Third International Joint Conference, IJCAR 2006},
PUBLISHER = {Springer},
YEAR = {2006},
VOLUME = {4130},
PAGES = {303--317},
SERIES = {Lecture Notes in Artificial Intelligence},
ADDRESS = {Seattle, WA, USA},
MONTH = {August},
ISBN = {978-3-540-37187-8},
; ISBN = {3-540-37187-7},
; ISBN = {ISSN 0302-9743},
}


Entry last modified by Uwe Brahm, 01/28/2008
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Hans de Nivelle
Created
03/29/2006 03:36:11 PM
Revisions
6.
5.
4.
3.
2.
Editor(s)
Uwe Brahm
Christine Kiesel
Christine Kiesel
Hans de Nivelle
Hans de Nivelle
Edit Dates
2007-04-26 13:02:46
15.02.2007 09:40:48
15.02.2007 09:14:16
09/25/2006 01:46:46 PM
09/25/2006 12:07:08 PM
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section