Note that the instance name has been abbreviated from the original, but is still identifiable by the numbers at the beginning and end of the instance name.
Instance Name EZSMT-CVC4 EZSMT-Z3 CLINGCON EZCSP EZCSP- Cumulative SAT Instances
105-is-17280-0.dimacs 5.11 0.58 22.93 Timeout 480.34
115-is-17280-0.dimacs 5.51 0.34 Timeout Timeout Timeout
135-is-17280-0.dimacs 1.12 1.61 Timeout Timeout 60.59
138-is-17280-0.dimacs 18.97 1.06 412.25 Timeout 28.12
140-is-18576-0.dimacs 99.73 1.45 12.88 Timeout Timeout
141-is-17280-0.dimacs 22.12 0.46 Timeout Timeout Timeout
153-is-17280-0.dimacs 0.35 0.53 8.25 Timeout 21.13
182-is-17280-0.dimacs 67.60 7.53 Timeout Timeout Timeout
214-is-27000-0.dimacs 957.90 17.79 Timeout Timeout Timeout
219-is-28080-0.dimacs 3.00 0.68 Timeout Timeout 56.32
UNSAT Instances
064-is-15092-0.dimacs 20.46 20.18 41.36 Timeout Timeout
090-is-15444-0.dimacs 0.21 0.09 0.38 27.42 35.45
099-is-15631-0.dimacs 0.51 0.12 0.35 707.85 28
102-is-18468-0.dimacs 0.71 0.23 0.86 Timeout 193.29
165-is-18180-0.dimacs 1.97 0.27 1.17 Timeout Timeout
170-is-18108-0.dimacs 0.38 0.12 0.87 Timeout Timeout
241-is-28320-0.dimacs 0.39 0.15 0.14 256.63 22.54
251-is-40518-0.dimacs 0.38 0.18 0.04 62.88 86.32
258-is-40698-0.dimacs 67.63 80.84 114.80 Timeout Timeout
264-is-40968-0.dimacs 0.39 0.18 0.04 125.56 176.31 298-is-40824-0.dimacs 0.40 0.18 0.04 8.06 16.72 305-is-50100-0.dimacs 0.47 0.21 0.06 9.89 19.68 329-is-50260-0.dimacs 0.45 0.20 0.05 73.04 130.58 332-is-50480-0.dimacs 0.44 0.20 0.05 32.43 63.69 379-is-78325-0.dimacs 0.70 0.30 0.08 28.36 71.69
All Timeout Instances
289-is-38880-0 Timeout Timeout Timeout Timeout Timeout
295-is-40626-0 Timeout Timeout Timeout Timeout Timeout
359-is-75000-0 Timeout Timeout Timeout Timeout Timeout
360-is-75000-0 Timeout Timeout Timeout Timeout Timeout
383-is-75000-0 Timeout Timeout Timeout Timeout Timeout
References
Marcello Balduccini and Yuliya Lierler. Practical and methodological aspects of the use of cutting-edge asp tools. pages 78–92, 2012.
Marcello Balduccini and Yuliya Lierler. Constraint answer set solver ezcsp and why integration schemas matter. Unpublished draft, 2016.
Marcello Balduccini. Representing constraint satisfaction problems in answer set pro- gramming. In Proceedings of ICLP Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP), https://www.mat.unical.it/ASPOCP09/, 2009. Marcello Balduccini. Logic Programming and Nonmonotonic Reasoning: 11th International
Conference, LPNMR 2011, Vancouver, Canada, May 16-19, 2011. Proceedings, chapter Industrial-Size Scheduling with ASP+CP, pages 284–296. Springer Berlin Heidelberg, Berlin, Heidelberg, 2011.
Clark Barrett and Cesare Tinelli. Satisfiability modulo theories. In Edmund Clarke, Tom Henzinger, and Helmut Veith, editors, Handbook of Model Checking. Springer, 2014. Clark Barrett, Christopher L. Conway, Morgan Deters, Liana Hadarean, Dejan Jovanovi´c,
Tim King, Andrew Reynolds, and Cesare Tinelli. Cvc4. In Proceedings of the 23rd International Conference on Computer Aided Verification (CAV’11), volume 6806 of LNCS. Springer, 2011.
Clark Barrett, Pascal Fontaine, and Cesare Tinelli. The SMT-LIB Standard: Version 2.5. Technical report, Department of Computer Science, The University of Iowa, 2015. Available at www.SMT-LIB.org.
Michael Bartholomew and Joohyung Lee. Logics in Artificial Intelligence: 14th European Conference, JELIA 2014, Funchal, Madeira, Portugal, September 24-26, 2014. Proceed-
ings, chapter System aspmt2smt: Computing ASPMT Theories by SMT Solvers, pages 529–542. Springer International Publishing, Cham, 2014.
Francesco Calimeri, Giovambattista Ianni, Francesco Ricca, Mario Alviano, Annamaria Bria, Gelsomina Catalano, Susanna Cozza, Wolfgang Faber, Onofrio Febbraro, Nicola Leone, Marco Manna, Alessandra Martello, Claudio Panetta, Simona Perri, Kristian Reale, Maria Carmela Santoro, Marco Sirianni, Giorgio Terracina, and Pierfrancesco Veltri. Logic Programming and Nonmonotonic Reasoning: 11th International Conference, LPNMR 2011, Vancouver, Canada, May 16-19, 2011. Proceedings, chapter The Third Answer Set Programming Competition: Preliminary Report of the System Competition Track, pages 388–403. Springer Berlin Heidelberg, Berlin, Heidelberg, 2011.
Mats Carlsson and Thom Fruehwirth. Sicstus PROLOG User’s Manual 4.3. Books On Demand - Proquest, 2014.
Keith Clark. Negation as failure. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 293–322. Plenum Press, New York, 1978.
David R. Cok and Grammatech Inc. The smt-libv2 language and tools: A tutorial. Gram- maTech, Inc., Version, 2011.
Leonardo De Moura and Nikolaj Bjørner. Z3: An efficient smt solver. In Proceedings of the Theory and Practice of Software, 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pages 337–340, 2008.
Esra Erdem and Vladimir Lifschitz. Fages’ theorem for programs with nested expressions. In Proceedings of International Conference on Logic Programming (ICLP), pages 242–254, 2001.
François Fages. Consistency of Clark’s completion and existence of stable models. Journal of Methods of Logic in Computer Science, 1:51–60, 1994.
Paolo Ferraris and Vladimir Lifschitz. Weight constraints as nested expressions. Theory and Practice of Logic Programming, 5:45–74, 2005.
M. Gebser, T. Schaub, and S. Thiele. Gringo: A new grounder for answer set program- ming. In Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning, pages 266–271, 2007.
Martin Gebser, Max Ostrowski, and Torsten Schaub. Constraint answer set solving. In Proceedings of 25th International Conference on Logic Programming (ICLP), pages 235–249. Springer, 2009.
Martin Gebser, Roland Kaminski, Arne König, and Torsten Schaub. Logic Programming and Nonmonotonic Reasoning: 11th International Conference, LPNMR 2011, Vancouver, Canada, May 16-19, 2011. Proceedings, chapter Advances in gringo Series 3, pages 345–351. Springer Berlin Heidelberg, Berlin, Heidelberg, 2011.
IBM. IBM ILOG AMPL Version 12.1 User’s Guide, 2009. http://www.ibm.com/software/ commerce/optimization/cplex-optimizer/.
Tomi Janhunen, Guohua Liu, and Ilkka Niemela. Tight integration of non-ground answer set programming and satisfiability modulo theories. In Proceedings of the 1st Workshop on Grounding and Transformations for Theories with Variables, 2011.
Tim King, Clark Barrett, and Cesare Tinelli. Leveraging linear and mixed integer program- ming for smt. In Proceedings of the 14th Conference on Formal Methods in Computer- Aided Design, FMCAD ’14, pages 24:139–24:146, Austin, TX, 2014. FMCAD Inc. Joohyung Lee and Yunsong Meng. Answer set programming modulo theories and reasoning
about continuous changes. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI-13), Beijing, China, August 3-9, 2013, 2013.
Yuliya Lierler and Benjamin Susman. Constraint answer set programming versus satisfiabil- ity modulo theories or constraints versus theories. In Proceedings of the 3rd Workshop on Grounding, Transforming, and Modularizing Theories with Variables, 2015.
Yuliya Lierler and Miroslaw Truszczynski. Transition systems for model generators — a unifying approach. Theory and Practice of Logic Programming, 27th International Conference on Logic Programming (ICLP’11) Special Issue, 11, issue 4-5, 2011.
Yuliya Lierler, Shaden Smith, Miroslaw Truszczynski, and Alex Westlund. Practical Aspects of Declarative Languages: 14th International Symposium, PADL 2012, Philadelphia, PA, USA, January 23-24, 2012. Proceedings, chapter Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving, pages 63–77. Springer Berlin Heidelberg, Berlin, Heidelberg, 2012.
Yuliya Lierler. Cmodels: SAT-based disjunctive answer set solver. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pages 447–452, 2005.
Yuliya Lierler. Relating constraint answer set programming languages and algorithms. Artificial Intelligence, 207C:1–22, 2014.
Yuliya Lierler. What is answer set programming to propositional satisfiability. Unpublished draft, 2015.
Vladimir Lifschitz, Lappoon R. Tang, and Hudson Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25:369–389, 1999.
Guohua Liu, Tomi Janhunen, and Ilkka Niemela. Answer set programming via mixed integer programming. In Knowledge Representation and Reasoning Conference, 2012. Kim Marriott and Peter J. Stuckey. Programming with Constraints: An Introduction. MIT
Veena S. Mellarkod, Michael Gelfond, and Yuanlin Zhang. Integrating answer set pro- gramming and constraint logic programming. Annals of Mathematics and Artificial Intelligence, 53(1):251–287, 2008.
Ilkka Niemelä and Patrik Simons. Extending the Smodels system with cardinality and weight constraints. In Jack Minker, editor, Logic-Based Artificial Intelligence, pages 491–521. Kluwer, 2000.
Robert Nieuwenhuis and Albert Oliveras. Dpll(t) with exhaustive theory propagation and its application to difference logic. In Proceedings of the 17th International Conference on Computer Aided Verification (CAV’05), volume 3576 of LNCS. Springer, 2005.
Robert Nieuwenhuis, Albert Oliveras, and Cesare Tinelli. Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM, 53(6):937–977, 2006.
G. S. Tseitin. On the complexity of derivations in the propositional calculus. Studies in Mathematics and Mathematical Logic, Part II:115–125, 1968.
Jan Wielemaker, Tom Schrijvers, Markus Triska, and Torbjörn Lager. SWI-Prolog. Theory and Practice of Logic Programming, 12(1-2):67–96, 2012.
Neng-fa Zhou. The language features and architecture of b-prolog. Theory and Practice of Logic Programming, 12(1-2):189–218, January 2012.