MACE4 and SEM: A Comparison of Finite Model Generators

This article has three objectives: (1) Promote Mace4, a program developed by Bill McCune that searches for finite models of first-order formulas and that is the best way to remember Bill. (2) Promote the research on model generation of first-order formulas. Mace4 remains one of the best model generation programs and we need newcomers who can take over Bill's torch, because model generation is very important to automated reasoning and has many applications. (3) Compare Mace4 with SEM in detail so that the users of these tools or new model generator developers will understand the strengths and weaknesses of both systems and take advantage from this study.

[1]  Hantao Zhang,et al.  Existence of self-orthogonal diagonal Latin squares with a missing subsquare , 2003, Discret. Math..

[2]  S. Stein.  On the foundations of quasigroups , 1957 .

[3]  Frank Wolter,et al.  Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.

[4]  Andrei Voronkov,et al.  Automated Deduction—CADE-18 , 2002, Lecture Notes in Computer Science.

[5]  Gerd Wagner,et al.  Logics in AI , 1992, Lecture Notes in Computer Science.

[6]  K. Claessen,et al.  New Techniques that Improve MACE-style Finite Model Finding , 2007 .

[7]  Mark E. Stickel,et al.  Implementing the Davis–Putnam Method , 2000, Journal of Automated Reasoning.

[8]  Zhuo Huang,et al.  Improving First-order Model Searching by Propositional Reasoning and Lemma Learning , 2004, SAT.

[9]  M. Spinks.  On Middle Distributivity for Skew Lattices , 2000 .

[10]  Gilles Audemard,et al.  Predicting and Detecting Symmetries in FOL Finite Model Search , 2006, Journal of Automated Reasoning.

[11]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

[12]  Deepak Kapur,et al.  An Overview of Rewrite Rule Laboratory (RRL) , 1989, RTA.

[13]  Laurent Henocque,et al.  A Hybrid Method for Finite Model Search in Equational Theories , 1999, Fundam. Informaticae.

[14]  Douglas R Stinson,et al.  Contemporary design theory : a collection of surveys , 1992 .

[15]  Masayuki Fujita,et al.  Automatic Generation of Some Results in Finite Algebra , 1993, IJCAI.

[16]  Miyuki Koshimura,et al.  MGTP: A Parallel Theorem Prover Based on Lazy Model Generation , 1992, CADE.

[17]  Hantao Zhang,et al.  Combinatorial Designs by SAT Solvers , 2021, Handbook of Satisfiability.

[18]  Frank E. Bennett,et al.  Incomplete perfect mendelsohn designs with block size 4 and holes of size 2 and 3 , 1994 .

[19]  Lawrence J. Henschen,et al.  Experiments with semantic paramodulation , 2004, Journal of Automated Reasoning.

[20]  Hantao Zhang.  Preface to the special issue on Automated Mathematical induction , 2004, Journal of Automated Reasoning.

[21]  Xuebin Zhang.  Incomplete perfect Mendelsohn designs with block size four , 2002, Discret. Math..

[22]  Jian Zhang.  Constructing finite algebras with FALCON , 2004, Journal of Automated Reasoning.

[23]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[24]  Tanel Tammet.  Using Resolution for Deciding Solvable Classes and Building Finite Models , 1991, Baltic Computer Science.

[25]  Karen Yeats,et al.  The saga of the High School Identities , 2005 .

[26]  Gilles Audemard,et al.  Reasoning by Symmetry and Function Ordering in Finite Model Generation , 2002, CADE.

[27]  Toby Walsh,et al.  Automated Deduction—CADE-11 , 1992, Lecture Notes in Computer Science.

[28]  Kai-Uwe Kühnberger,et al.  Algorithmic Aspects of Theory Blending , 2014, AISC.

[29]  Jonathan Leech,et al.  Skew lattices in rings , 1989 .

[30]  Jaime G. Carbonell,et al.  Automated Deduction — CADE-16 , 2002, Lecture Notes in Computer Science.

[31]  Reinhard Pichler.  Algorithms on Atomic Representations of Herbrand Models , 1998, JELIA.

[32]  J. Dénes,et al.  Latin squares and their applications , 1974 .

[33]  Frank van Harmelen,et al.  Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs , 1990, CADE.

[34]  William McCune,et al.  MACE 2.0 Reference Manual and Guide , 2001, ArXiv.

[35]  William McCune,et al.  Mace4 Reference Manual and Guide , 2003, ArXiv.

[36]  K. Kunen.  The structure of conjugacy closed loops , 2000 .

[37]  Gilles Audemard,et al.  Predicting Learnt Clauses Quality in Modern SAT Solvers , 2009, IJCAI.

[38]  Antony Galton.  Note on a Lemma of Ladkin , 1996, J. Log. Comput..

[39]  Jian Zhang.  System Description: MCS: Model-based Conjecture Searching , 1999, CADE.

[40]  Hantao Zhang,et al.  SATO: An Efficient Propositional Prover , 1997, CADE.

[41]  William McCune,et al.  Experiments with discrimination-tree indexing and path indexing for term retrieval , 1992, Journal of Automated Reasoning.

[42]  Graham Steel,et al.  Deduction with XOR Constraints in Security API Modelling , 2005, CADE.

[43]  John K. Slaney,et al.  FINDER: Finite Domain Enumerator - System Description , 1994, CADE.

[44]  William McCune,et al.  Automated Deduction—CADE-14 , 1997, Lecture Notes in Computer Science.

[45]  Robert Veroff,et al.  Automated Reasoning and Its Applications: Essays in Honor of Larry Wos , 1997 .

[46]  Jian Zhang.  Problems on the Generation of Finite Models , 1994, CADE.

[47]  William McCune,et al.  OTTER 3.0 Reference Manual and Guide , 1994 .

[48]  Hantao Zhang,et al.  Constraint Propagation in Model Generation , 1995, CP.

[49]  Greg Nelson,et al.  Fast Decision Procedures Based on Congruence Closure , 1980, JACM.

[50]  Niklas Een,et al.  MiniSat v1.13 - A SAT Solver with Conflict-Clause Minimization , 2005 .

[51]  Alexander Leitsch,et al.  Automated Model Building , 2010 .

[52]  Existence of (3, 1, 2)-conjugate orthogonal diagonal latin squares , 1997 .

[53]  Jacques D. Fleuriot,et al.  IsaPlanner: A Prototype Proof Planner in Isabelle , 2003, CADE.

[54]  Jörg H. Siekmann,et al.  Opening the AC-unification race , 2004, Journal of Automated Reasoning.

[55]  Hantao Zhang,et al.  Extending Finite Model Searching with Congruence Closure Computation , 2004, AISC.

[56]  Dines Bjørner,et al.  Baltic Computer Science , 1991, Lecture Notes in Computer Science.

[57]  Alan Bundy,et al.  Automated Deduction — CADE-12 , 1994, Lecture Notes in Computer Science.

[58]  Hantao Zhang,et al.  ModGen: Theorem Proving by Model Generation , 1994, AAAI.

[59]  Ricardo Caferra,et al.  Extending Resolution for Model Construction , 1990, JELIA.

[60]  Gilles Audemard,et al.  The eXtended Least Number Heuristic , 2001, IJCAR.

[61]  Thierry Boy.  Some Techniques of Isomorph-Free Search , 2000 .

[62]  William McCune,et al.  SCOTT: Semantically Constrained Otter System Description , 1994, CADE.

[63]  Hantao Zhang,et al.  SEM: a System for Enumerating Models , 1995, IJCAI.

[64]  Francesca Rossi,et al.  Principles and Practice of Constraint Programming — CP '95 , 1995, Lecture Notes in Computer Science.

[65]  Jian Zhang.  Computer Search for Counterexamples to Wilkie's Identity , 2005, CADE.

[66]  Thierry Boy de la Tour.  Some Techniques of Isomorph-Free Search , 2000, AISC.

[67]  William McCune,et al.  Solution of the Robbins Problem , 1997, Journal of Automated Reasoning.

[68]  Peter Baumgartner,et al.  The Model Evolution Calculus , 2003, CADE.

[69]  François Bry,et al.  SATCHMO: A Theorem Prover Implemented in Prolog , 1988, CADE.

[70]  M. Stickel,et al.  Automated reasoning and exhaustive search: Quasigroup existence problems☆ , 1995 .

[71]  William McCune,et al.  OTTER 3.3 Reference Manual , 2003, ArXiv.

[72]  Peter Baumgartner,et al.  Computing finite models by reduction to function-free clause logic , 2009, J. Appl. Log..

[73]  Jian Zhang,et al.  A Powerful Technique to Eliminate Isomorphism in Finite Model Search , 2006, IJCAR.