Computing Finite Models by Reduction to Function-Free Clause Logic

de Nivelle, Hans; Baumgartner, Peter; Fuchs, Alexander; Tinelli, Cesare; Ahrendt, Wolfgang; Baumgartner, Peter; de Nivelle, Hans

Local TagsRelease HistoryDetailsSummary

Computing Finite Models by Reduction to Function-Free Clause Logic

de Nivelle, H., Baumgartner, P., Fuchs, A., & Tinelli, C. (2006). Computing Finite Models by Reduction to Function-Free Clause Logic. In IJCAR'06 Workshop: Disproving'06: Non-Theorems, Non-Validity, Non-Provability (pp. 82-95). Seattle, USA: The 2006 Federated Logic Conference.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-225F-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2260-2

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
de Nivelle, Hans¹, Author
Baumgartner, Peter¹, Author
Fuchs, Alexander¹, Author
Tinelli, Cesare, Author
Ahrendt, Wolfgang, Editor
Baumgartner, Peter¹, Editor
de Nivelle, Hans¹, Editor

Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045

Content

show

hide

Free keywords: -

Abstract: We propose to reduce model search to a sequence of satisfiability problems made of function-free clause sets, and to apply efficient theorem provers capable of deciding such problems on them. The main motivation for this method is the fact that first-order clause sets grow more slowly than their propositional counterparts, thus allowing for more space-efficient reasoning. We describe the method in detail, and show how it is integrated into Darwin, which is an implementation of the model evolution calculus. Although we used Darwin, the results are general, as our approach can be used in principle with every system that decides the satisfiability of function-free first-order clause sets.

Details

show

hide

Language(s): eng - English

Dates: Modified: 2007-02-26Date issued: 2006

Publication Status: Issued

Pages: -

Publishing info: Seattle, USA : The 2006 Federated Logic Conference

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 314598
Other: Local-ID: C1256104005ECAFC-9652C39F11860EAAC12571F4003A4339-deNivelle2006b

Degree: -

Event

show

hide

Title: Untitled Event

Place of Event: Seattle, USA

Start-/End Date: 2006-08-16

Legal Case

show

Project information

show

Source 1

show

hide

Title: IJCAR'06 Workshop : Disproving'06: Non-Theorems, Non-Validity, Non-Provability

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: Seattle, USA : The 2006 Federated Logic Conference

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 82 - 95 Identifier: -