Article

Relevance for SAT(ID)

Authors:

Joachim Jansen,

Gerda Janssens,

Marc DeneckerAuthors Info & Claims

IJCAI'16: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence

Pages 596 - 602

Published: 09 July 2016 Publication History

Abstract

Inductive definitions and justifications are well-studied concepts. Solvers that support inductive definitions have been developed, but several of their computationally nice properties have never been exploited to improve these solvers. In this paper, we present a new notion called relevance . We determine a class of literals that are relevant for a given definition and partial interpretation, and show that choices on irrelevant atoms can never benefit the search for a model. We propose an early stopping criterion and a modification of existing heuristics that exploit relevance. We present a first implementation in MinisatID and experimentally evaluate our approach, and study how often existing solvers make choices on irrelevant atoms.

References

[1]

Krzysztof R. Apt. Principles of Constraint Programming . Cambridge University Press, 2003.

Digital Library

[2]

Clark W. Barrett, Roberto Sebastiani, Sanjit A. Seshia, and Cesare Tinelli. Satisfiability modulo theories. In Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh, editors, Handbook of Satisfiability , volume 185 of Frontiers in Artificial Intelligence and Applications , pages 825-885. IOS Press, 2009.

[3]

Broes De Cat, Bart Bogaerts, Jo Devriendt, and Marc Denecker. Model expansion in the presence of function symbols using constraint programming. In 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, Herndon, VA, USA, November 4-6, 2013 , pages 1068-1075. IEEE Computer Society, 2013.

Digital Library

[4]

Broes De Cat, Marc Denecker, Maurice Bruynooghe, and Peter J. Stuckey. Lazy model expansion: Interleaving grounding with search. J. Artif. Intell. Res. (JAIR) , 52:235-286, 2015.

Digital Library

[5]

Broes De Cat, Bart Bogaerts, Maurice Bruynooghe, Gerda Janssens, and Marc Denecker. Predicate logic as a modelling language: The IDP system. CoRR , abs/1401.6312v2, 2016.

[6]

Marc Denecker and Danny De Schreye. Justification semantics: A unifying framework for the semantics of logic programs. In Luís Moniz Pereira and Anil Nerode, editors, LPNMR , pages 365-379. MIT Press, 1993.

Digital Library

[7]

Marc Denecker and Eugenia Ternovska. A logic of nonmonotone inductive definitions. ACM Trans. Comput. Log. , 9(2):14:1-14:52, April 2008.

Digital Library

[8]

Marc Denecker and Joost Vennekens. Well-founded semantics and the algebraic theory of non-monotone inductive definitions. In Chitta Baral, Gerhard Brewka, and John S. Schlipf, editors, LPNMR , volume 4483 of Lecture Notes in Computer Science , pages 84-96. Springer, 2007.

Digital Library

[9]

Marc Denecker and Joost Vennekens. The well-founded semantics is the principle of inductive definition, revisited. In Chitta Baral, Giuseppe De Giacomo, and Thomas Eiter, editors, KR , pages 1-10. AAAI Press, 2014.

Digital Library

[10]

Marc Denecker, Gerhard Brewka, and Hannes Strass. A formal theory of justifications. In Francesco Calimeri, Giovambattista Ianni, and Miroslaw Truszczynski, editors, Logic Programming and Nonmonotonic Reasoning - 13th International Conference, LPNMR 2015, Lexington, KY, USA, September 27-30, 2015. Proceedings , volume 9345 of Lecture Notes in Computer Science , pages 250-264. Springer, 2015.

[11]

Marc Denecker. The well-founded semantics is the principle of inductive definition. In Jürgen Dix, Luis Fariñas del Cerro, and Ulrich Furbach, editors, JELIA , volume 1489 of LNCS , pages 1-16. Springer, 1998.

Digital Library

[12]

Zhaohui Fu, Yinlei Yu, and S. Malik. Considering circuit observability don't cares in cnf satisfiability. In Design, Automation and Test in Europe , pages 1108-1113 Vol. 2, March 2005.

Digital Library

[13]

Martin Gebser, Benjamin Kaufmann, and Torsten Schaub. Conflict-driven answer set solving: From theory to practice. Artif. Intell. , 187:52-89, 2012.

Digital Library

[14]

S. C. Kleene. On notation for ordinal numbers. The Journal of Symbolic Logic , 3(4):150-155, 1938.

[15]

Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, and Francesco Scarcello. The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log. , 7(3):499-562, 2006.

Digital Library

[16]

Victor Marek and Mirosław Truszczynski. Stable models and an alternative logic programming paradigm. In Krzysztof R. Apt, Victor Marek, Mirosław Truszczynski, and David S. Warren, editors, The Logic Programming Paradigm: A 25-Year Perspective , pages 375-398. Springer-Verlag, 1999.

[17]

Maarten Mariën, Johan Wittocx, and Marc Denecker. Integrating inductive definitions in SAT. In Nachum Derschowitz and Andrei Voronkov, editors, LPAR , volume 4790 of LNCS , pages 378-392. Springer, 2007.

Digital Library

[18]

Maarten Mariën, Johan Wittocx, Marc Denecker, and Maurice Bruynooghe. SAT(ID): Satisfiability of propositional logic extended with inductive definitions. In Hans Kleine Büning and Xishun Zhao, editors, SAT , volume 4996 of LNCS , pages 211-224. Springer, 2008.

Digital Library

[19]

Maarten Mariën. Model Generation for ID-Logic . PhD thesis, Department of Computer Science, KU Leuven, Belgium, February 2009.

[20]

João P. Marques-Silva and Karem A. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers , 48(5):506-521, 1999.

Digital Library

[21]

Peter J. Stuckey. Lazy clause generation: Combining the power of SAT and CP (and MIP?) solving. In CPAIOR , pages 5-9, 2010.

Digital Library

[22]

Jannes Verstichel. The Lock Scheduling Problem (Het sluisplanningsprobleem) . PhD thesis, Science, Engineering and Technology Group, Campus Kulak Kortrijk, Faculty of Science, Campus Kulak Kortrijk, Faculty of Engineering Science, November 2013. De Causmaecker, Patrick and Vanden Berghe, Greet (supervisors).

Cited By

Bogaerts BWeinzierl A(2018)Exploiting justifications for lazy grounding of answer set programsProceedings of the 27th International Joint Conference on Artificial Intelligence10.5555/3304889.3304900(1737-1745)Online publication date: 13-Jul-2018
https://dl.acm.org/doi/10.5555/3304889.3304900

Recommendations

SAT(ID): satisfiability of propositional logic extended with inductive definitions
SAT'08: Proceedings of the 11th international conference on Theory and applications of satisfiability testing

We investigate the satisfiability problem, SAT(ID), of an extension of propositional logic with inductive definitions. We demonstrate how to extend existing SAT solvers to become SAT(ID) solvers, and provide an implementation on top of MiniSat. We also ...
Semantic Relevance
Automated Reasoning
Abstract
A clause C is syntactically relevant in some clause set N, if it occurs in every refutation of N. A clause C is syntactically semi-relevant, if it occurs in some refutation of N. While syntactic relevance coincides with satisfiability (if C is ...
Clause elimination for SAT and QSAT

The famous archetypical NP-complete problem of Boolean satisfiability (SAT) and its PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become central declarative programming paradigms through which real-world instances of ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

IJCAI'16: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence

July 2016

4277 pages

ISBN:9781577357704

Editor:
Gerhard Brewka
Leipzig University, Germany

Sponsors

Sony: Sony Corporation
Arizona State University: Arizona State University
Microsoft: Microsoft
Facebook: Facebook
AI Journal: AI Journal

Publisher

AAAI Press

Publication History

Published: 09 July 2016

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bogaerts BWeinzierl A(2018)Exploiting justifications for lazy grounding of answer set programsProceedings of the 27th International Joint Conference on Artificial Intelligence10.5555/3304889.3304900(1737-1745)Online publication date: 13-Jul-2018
https://dl.acm.org/doi/10.5555/3304889.3304900

View Options

View options

Media

Figures

Other

Tables

View Table of Contents