Add to ORKGWe implement a MACE-style method for finding finite models in unsorted classical first-order logic. Additionally to well-known modifications of the method we also describe and implement several new modifications such as: unflattening, generation of redundant clauses and encoding into Gecode constraints. Our implementation is benchmarked together with Mace4, Paradox and iProver. Finally, some suggestions for improvements and further research are given. Powered by TCPDF (www.tcpdf.org
This is a post-peer-review, pre-copyedit version of a paper presented at the International Symposium...
This paper presents the IDP system, a finite model generator for extended first-order logic theories...
. Zabel, and N. Peltier [CZ91, CZ92, CP95b] and J. Slaney [Sla92, Sla93]. An earlier approach by S. ...
We describe a new method for finding finite models of unsorted first-order logic clause sets. The me...
Abstract. Recent years have seen considerable interest in procedures for com-puting finite models of...
AbstractRecent years have seen considerable interest in procedures for computing finite models of fi...
Recent years have seen considerable interest in procedures for computing finite models of first-orde...
This work considers the MACE-style approach to finite model finding for (multi-sorted) first-order l...
Mace4 is a program that searches for finite models of first-order formulas. For a given domain size,...
This work extends the existing MACE-style finite model finding approach to multi-sorted first-order ...
Abstract. We show that finding finite Herbrand models for a restricted class of first-order clauses ...
In the present work, we study algorithms for building finite models of sets of first-order axioms wi...
Due to the semi-decidable nature of first-order logic, it can be desirable to address a wider range ...
Finite model finders represent a powerful tool for deciding problems with the finite model property,...
Abstract. The paper ivestigates nite model building for rst order logic. We consider two main catego...
This is a post-peer-review, pre-copyedit version of a paper presented at the International Symposium...
This paper presents the IDP system, a finite model generator for extended first-order logic theories...
. Zabel, and N. Peltier [CZ91, CZ92, CP95b] and J. Slaney [Sla92, Sla93]. An earlier approach by S. ...
We describe a new method for finding finite models of unsorted first-order logic clause sets. The me...
Abstract. Recent years have seen considerable interest in procedures for com-puting finite models of...
AbstractRecent years have seen considerable interest in procedures for computing finite models of fi...
Recent years have seen considerable interest in procedures for computing finite models of first-orde...
This work considers the MACE-style approach to finite model finding for (multi-sorted) first-order l...
Mace4 is a program that searches for finite models of first-order formulas. For a given domain size,...
This work extends the existing MACE-style finite model finding approach to multi-sorted first-order ...
Abstract. We show that finding finite Herbrand models for a restricted class of first-order clauses ...
In the present work, we study algorithms for building finite models of sets of first-order axioms wi...
Due to the semi-decidable nature of first-order logic, it can be desirable to address a wider range ...
Finite model finders represent a powerful tool for deciding problems with the finite model property,...
Abstract. The paper ivestigates nite model building for rst order logic. We consider two main catego...
This is a post-peer-review, pre-copyedit version of a paper presented at the International Symposium...
This paper presents the IDP system, a finite model generator for extended first-order logic theories...
. Zabel, and N. Peltier [CZ91, CZ92, CP95b] and J. Slaney [Sla92, Sla93]. An earlier approach by S. ...