de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Computing Finite Models by Reduction to Function-Free Clause Logic

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44298

de Nivelle,  Hans
Programming Logics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44088

Baumgartner,  Peter
Programming Logics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44452

Fuchs,  Alexander
Programming Logics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44088

Baumgartner,  Peter
Programming Logics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44298

de Nivelle,  Hans
Programming Logics, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

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.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-225F-8
Zusammenfassung
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.