{"type":"ScholarlyArticle","title":"Pseudo-Boolean Constraints from a Knowledge Representation Perspective","authors":[{"name":"Daniel Le Berre","slug":"daniel-le-berre","given":"Daniel","family":"Le Berre","affiliation":"CRIL-CNRS UMR 8188 , Lens , France; Université d'Artois"},{"name":"Pierre Marquis","slug":"pierre-marquis","given":"Pierre","family":"Marquis","affiliation":"CRIL-CNRS UMR 8188 , Lens , France; Université d'Artois; Institut Universitaire de France"},{"name":"Stefan Mengel","slug":"stefan-mengel","given":"Stefan","family":"Mengel","affiliation":"CRIL-CNRS UMR 8188 , Lens , France"},{"name":"Romain Wallon","slug":"romain-wallon","given":"Romain","family":"Wallon","affiliation":"CRIL-CNRS UMR 8188 , Lens , France; Université d'Artois"}],"abstract":"We study pseudo-Boolean constraints (PBC) and\r\ntheir special case cardinality constraints (CARD)\r\nfrom the perspective of knowledge representation.\r\nTo this end, the succinctness of PBC and CARD\r\nis compared to that of many standard propositional\r\nlanguages. Moreover, we determine which queries\r\nand transformations are feasible in polynomial time\r\nwhen knowledge is represented by PBC or CARD,\r\nand which are not (unconditionally or unless P =\r\nNP). In particular, the advantages and disadvantages\r\ncompared to CNF are discussed.","doi":"10.24963/ijcai.2018/261","url":"https://ijcai.org/proceedings/2018/261","pdf":"https://ijcai.org/proceedings/2018/0261.pdf","markdown":"https://ijcai.org/proceedings/2018/261.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/261","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":261,"pages":{"first":1891,"last":1897},"keywords":["Knowledge Representation and Reasoning: Tractable Languages and Knowledge compilation","Knowledge Representation and Reasoning: Knowledge Representation Languages","Constraints and SAT: Constraints and SAT"],"videos":[],"references":[{"position":1,"raw":"[Barth, 1995] Peter Barth. A Davis-Putnam based Enumer- ation Algorithm for Linear Pseudo-Boolean Optimization. Technical Report MPI-I-95-2, Max-Planck Institut Für In- formatik, 1995.","title":"A Davis-Putnam based Enumeration Algorithm for Linear Pseudo-Boolean Optimization","authors":"Peter Barth","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Biere et al., 2009] Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh, editors. Handbook of Satisfi- ability, volume 185 of Frontiers in Artificial Intelligence and Applications. IOS Press, 2009.","title":"Handbook of Satisfiability","authors":"Biere","year":"2009","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bova et al., 2016] Simone Bova, Florent Capelli, Stefan Mengel, and Friedrich Slivovsky. Knowledge Compilation Meets Communication Complexity. In IJCAI'16, pages 1008-1014, 2016.","title":"Knowledge Compilation Meets Communication Complexity","authors":"Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky","year":"2016","venue":"IJCAI'16","doi":null,"url":null,"internal_url":"/proceedings/2016/147"},{"position":4,"raw":"[Bryant, 1986] Randal E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput., 35(8):677-691, 1986.","title":"Graph-based algorithms for boolean function manipulation","authors":"Randal E Bryant","year":"1986","venue":"IEEE Trans. Comput","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Chai and Kuehlmann, 2003] Donald Chai and Andreas Kuehlmann. A fast pseudo-Boolean constraint solver. In DAC'03, pages 830-835, 2003.","title":"A fast pseudo-Boolean constraint solver","authors":"Donald Chai, Andreas Kuehlmann","year":"2003","venue":"DAC'03","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Cook et al., 1987] William Cook, Collette R. Coullard, and György Turán. On the Complexity of Cutting-plane Proofs. Discrete Appl. Math., 18(1):25-38, 1987.","title":"On the Complexity of Cutting-plane Proofs","authors":"William Cook, Collette R Coullard, György Turán","year":"1987","venue":"Discrete Appl. Math","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Crama and Hammer, 2011] Yves Crama and Peter L. Ham- mer. Boolean Functions: Theory, Algorithms, and Appli- cations. Cambridge University Press, 2011.","title":"Yves Crama and Peter L. Hammer. Boolean Functions: Theory, Algorithms, and Applications","authors":"Hammer Crama","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Darwiche and Marquis, 2002] Adnan Darwiche and Pierre Marquis. A Knowledge Compilation Map. Journal of Ar- tificial Intelligence Research, 17(1):229-264, 2002.","title":"A Knowledge Compilation Map","authors":"Adnan Darwiche, Pierre Marquis","year":"2002","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Darwiche, 1999] Adnan Darwiche. Compiling knowledge into decomposable negation normal form. In IJCAI'99, pages 284-289, 1999.","title":"Compiling knowledge into decomposable negation normal form","authors":"Adnan Darwiche","year":"1999","venue":"IJCAI'99","doi":null,"url":null,"internal_url":"/proceedings/1999/42"},{"position":10,"raw":"[Darwiche, 2001] Adnan Darwiche. Decomposable negation normal form. J. ACM, 48(4):608-647, 2001.","title":"Decomposable negation normal form","authors":"Adnan Darwiche","year":"2001","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[DIMACS, 1993] DIMACS. Satisfiability: Suggested For- mat. DIMACS Challenge. DIMACS, 1993.","title":"DIMACS. Satisfiability: Suggested Format","authors":"Dimacs","year":"1993","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Dixon and Ginsberg, 2002] Heidi E. Dixon and Matthew L. Ginsberg. Inference methods for a pseudo-boolean satisfi- ability solver. In AAAI'02, pages 635-640, 2002.","title":"Inference methods for a pseudo-boolean satisfiability solver","authors":"Heidi E Dixon, Matthew L Ginsberg","year":"2002","venue":"AAAI'02","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Dixon, 2004] Heidi Dixon. Automating Pseudo-Boolean In- ference Within a DPLL Framework. PhD thesis, University of Oregon, 2004.","title":"Automating Pseudo-Boolean Inference Within a DPLL Framework","authors":"Heidi Dixon","year":"2004","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Fargier and Marquis, 2008] Hélène Fargier and Pierre Mar- quis. Extending the knowledge compilation map: Closure principles. In ECAI'08, pages 50-54, 2008.","title":"Hélène Fargier and Pierre Marquis. Extending the knowledge compilation map: Closure principles","authors":"Marquis Fargier","year":"2008","venue":"ECAI'08","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gogic et al., 1995] Goran Gogic, Henry Kautz, Christos Pa- padimitriou, and Bart Selman. The comparative linguistics of knowledge representation. In IJCAI'95, pages 862-869, 1995.","title":"The comparative linguistics of knowledge representation","authors":"Goran Gogic, Henry Kautz, Christos Papadimitriou, Bart Selman","year":"1995","venue":"IJCAI'95","doi":null,"url":null,"internal_url":"/proceedings/1995/112"},{"position":16,"raw":"[Haken, 1985] Armin Haken. The intractability of resolu- tion. Theoretical Computer Science, 39:297 -308, 1985.","title":"The intractability of resolution","authors":"Armin Haken, Haken","year":"1985","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Hooker, 1988] John N. Hooker. Generalized resolution and cutting planes. Annals of Operations Research, 12(1):217- 239, 1988.","title":"Generalized resolution and cutting planes","authors":"John N Hooker","year":"1988","venue":"Annals of Operations Research","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Krishnamurthy, 1985] Balakrishnan Krishnamurthy. Short proofs for tricky formulas. Acta Informatica, 22:253-275, 1985.","title":"Short proofs for tricky formulas","authors":"Balakrishnan Krishnamurthy","year":"1985","venue":"Acta Informatica","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Le Berre and Parrain, 2010] Daniel Le Berre and Anne Par- rain. The SAT4J library, Release 2.2, System Description. Journal on Satisfiability, Boolean Modeling and Compu- tation, 7:59-64, 2010.","title":"Daniel Le Berre and Anne Parrain. The SAT4J library, Release 2.2, System Description","authors":"Le Berre, Parrain","year":"2010","venue":"Journal on Satisfiability, Boolean Modeling and Computation","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Nordström, 2015] Jakob Nordström. On the Interplay Be- tween Proof Complexity and SAT Solving. ACM SIGLOG News, 2(3):19-44, 2015.","title":"On the Interplay Between Proof Complexity and SAT Solving","authors":"Jakob Nordström","year":"2015","venue":"ACM SIGLOG News","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Plaisted and Greenbaum, 1986] David A. Plaisted and Steven Greenbaum. A structure-preserving clause form translation. Journal of Symbolic Computation, 2(3):293-304, 1986.","title":"A structure-preserving clause form translation","authors":"David A Plaisted, Steven Greenbaum","year":"1986","venue":"Journal of Symbolic Computation","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Quine, 1952] Willard V. Quine. The problem of simplify- ing truth functions. The American Mathematical Monthly, 59(8):521-531, 1952.","title":"The problem of simplifying truth functions","authors":"Willard V Quine","year":"1952","venue":"The American Mathematical Monthly","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Roussel and Manquinho, 2009] Olivier Roussel and Vasco M. Manquinho. Pseudo-Boolean and Cardinality Constraints. In Handbook of Satisfiability, pages 695-733. 2009.","title":"Pseudo-Boolean and Cardinality Constraints","authors":"Olivier Roussel, M Vasco, Manquinho","year":"2009","venue":"Handbook of Satisfiability","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[SATLIB, 1999] SATLIB. The Satisfiability Library, 1999. http://www.cs.ubc.ca/ hoos/SATLIB/index-ubc.html.","title":"SATLIB. The Satisfiability Library","authors":"Satlib","year":"1999","venue":null,"doi":null,"url":"http://www.cs.ubc.ca/hoos/SATLIB/index-ubc.html","internal_url":null},{"position":25,"raw":"[Sheini and Sakallah, 2006] Hossein M. Sheini and Karem A. Sakallah. Pueblo: A Hybrid Pseudo-Boolean SAT Solver. JSAT, 2(1-4):165-189, 2006.","title":"Pueblo: A Hybrid Pseudo-Boolean SAT Solver","authors":"M Hossein, Karem A Sheini, Sakallah","year":"2006","venue":"JSAT","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Tseitin, 1968] Gregory S. Tseitin. On the complexity of derivation in propositional calculus, chapter Structures in Constructive Mathematics and Mathematical Logic, pages 115-125. 1968.","title":"On the complexity of derivation in propositional calculus","authors":"Gregory S Tseitin","year":"1968","venue":"chapter Structures in Constructive Mathematics and Mathematical Logic","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Vollmer, 1999] Heribert Vollmer. Complexity Measures and Reductions. In Introduction to Circuit Complexity: A Uni- form Approach. Springer-Verlag New York, Inc., 1999.","title":"Complexity Measures and Reductions","authors":"Heribert Vollmer","year":"1999","venue":"Introduction to Circuit Complexity: A Uniform Approach","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}