ModGen: theorem proving by model generation
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Problems on the Generation of Finite Models
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Direct finite first-order model generation with negative constraint propagation heuristic
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Automatic symmetry breaking method combined with SAT
Proceedings of the 2001 ACM symposium on Applied computing
Satchmo - The Compiling and Functional Variants
Journal of Automated Reasoning
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation
Journal of Automated Reasoning
Short Single Axioms for Boolean Algebra
Journal of Automated Reasoning
Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
A Deduction Method Complete for Refutation and Finite Satisfiability
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
The Non-existence of (3, 1, 2)-Conjugate Orthogonal Idempotent Latin Square of Order 10
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A Logic for Approximate First-Order Reasoning
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Employing Theory Formation to Guide Proof Planning
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
The eXtended Least Number Heuristic
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Flaw Detection in Formal Specifications
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Extracting models from clause sets saturated under semantic refinements of the resolution rule
Information and Computation
Model building with ordered resolution: extracting models from saturated clause sets
Journal of Symbolic Computation - Special issue: First order theorem proving
A calculus combining resolution and enumeration for building finite models
Journal of Symbolic Computation - Special issue: First order theorem proving
TPTP, CASC and the development of a semantically guided theorem prover
AI Communications - CASC
Retrieving and Matching RDF Graphs by Solving the Satisfiability Problem
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
Proof planning with multiple strategies
Artificial Intelligence
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
Electronic Notes in Theoretical Computer Science (ENTCS)
Logical Engineering with Instance-Based Methods
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Computer Search for Large Sets of Idempotent Quasigroups
Computer Mathematics
Automated Model Building: From Finite to Infinite Models
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Automating Algebraic Specifications of Non-freely Generated Data Types
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Finding Orthogonal Arrays Using Satisfiability Checkers and Symmetry Breaking Constraints
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Analogy and abduction in automated deduction
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
The difference all-difference makes
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Predicate-oriented isomorphism elimination in model finding
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reducing Symmetries to Generate Easier SAT Instances
Electronic Notes in Theoretical Computer Science (ENTCS)
An Isomorph-Free SEM-Like Enumeration of Models
Electronic Notes in Theoretical Computer Science (ENTCS)
Kodkod: a relational model finder
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
An incremental answer set programming based system for finite model computation
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Automated Flaw Detection in Algebraic Specifications
Journal of Automated Reasoning
Combining local search and backtracking techniques for constraint satisfaction
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
An incremental answer set programming based system for finite model computation
AI Communications - Answer Set Programming
Monotonicity Inference for Higher-Order Formulas
Journal of Automated Reasoning
Blocking and other enhancements for bottom-up model generation methods
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Geometric resolution: a proof procedure based on finite model search
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A powerful technique to eliminate isomorphism in finite model search
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Computer search for counterexamples to wilkie's identity
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Monotonicity inference for higher-order formulas
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Nitpick: a counterexample generator for higher-order logic based on a relational model finder
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Aluminum: principled scenario exploration through minimality
Proceedings of the 2013 International Conference on Software Engineering
Quantifier instantiation techniques for finite model finding in SMT
CADE'13 Proceedings of the 24th international conference on Automated Deduction
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Superposition for bounded domains
Automated Reasoning and Mathematics
MACE4 and SEM: a comparison of finite model generators
Automated Reasoning and Mathematics
| Hi-index | 0.00 |
Model generation can be regarded as a special case of the Constraint Satisfaction Problem (CSP). It has many applications in AI, computer science and mathematics. In this paper, we describe SEM, a System for Enumerating finite Models of first-order many-sorted theories. To the best of our knowledge, SEM outperforms any other finite model generation system on many test problems. The high performance of SEM relies on the following two techniques: (a) an efficient implementation of constraint propagation which requires little dynamic allocation of storage; (b) a powerful heuristic which eliminates many isomorphic partial models during the search. We will present the basic algorithm of SEM along with these two techniques. Our experimental results show that general purpose finite model generators are indeed useful in many applications.