Pseudo-Boolean Constraints from a Knowledge Representation Perspective

被引：0
|
作者：
Le Berre, Daniel [1 ,2 ]
Marquis, Pierre [1 ,2 ,3 ]
Mengel, Stefan [1 ]
Wallon, Romain [1 ,2 ]
机构：
[1] CRIL CNRS UMR 8188, Lens, France
[2] Univ Artois, Arras, France
[3] Inst Univ France, Paris, France
来源：
PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE | 2018年
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We study pseudo-Boolean constraints (PBC) and their special case cardinality constraints (CARD) from the perspective of knowledge representation. To this end, the succinctness of PBC and CARD is compared to that of many standard propositional languages. Moreover, we determine which queries and transformations are feasible in polynomial time when knowledge is represented by PBC or CARD, and which are not (unconditionally or unless P = NP). In particular, the advantages and disadvantages compared to CNF are discussed.
引用
收藏
页码：1891 / 1897
页数：7
相关论文
共 50 条
  • [1] PSEUDO-BOOLEAN PROGRAMMING WITH CONSTRAINTS
    INAGAKI, Y
    FUKUMURA, T
    [J]. ELECTRONICS & COMMUNICATIONS IN JAPAN, 1967, 50 (06): : 26 - &
  • [2] BDDs for Pseudo-Boolean Constraints - Revisited
    Abio, Ignasi
    Nieuwenhuis, Robert
    Oliveras, Albert
    Rodriguez-Carbonell, Enric
    [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2011, 2011, 6695 : 61 - 75
  • [3] Translating Pseudo-Boolean Constraints into CNF
    Aavani, Amir
    [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2011, 2011, 6695 : 357 - 359
  • [4] Solving Pseudo-Boolean Modularity Constraints
    Ansotegui, Carlos
    Bejar, Ramon
    Fernandez, Cesar
    Guitart, Francesc
    Mateu, Carles
    [J]. ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 867 - 872
  • [5] New Encodings of Pseudo-Boolean Constraints into CNF
    Bailleux, Olivier
    Boufkhad, Yacine
    Roussel, Olivier
    [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2009, PROCEEDINGS, 2009, 5584 : 181 - +
  • [6] Optimal Base Encodings for Pseudo-Boolean Constraints
    Codish, Michael
    Fekete, Yoav
    Fuhs, Carsten
    Schneider-Kamp, Peter
    [J]. TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, 2011, 6605 : 189 - +
  • [7] A Hybrid Encoding of Pseudo-Boolean Constraints into CNF
    Zha, Along
    Koshimura, Mivuki
    Fujna, Hiroshi
    [J]. 2017 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI), 2017, : 9 - 12
  • [8] Solution and optimization of systems of pseudo-Boolean constraints
    Aloul, Fadi A.
    Ramani, Arathi
    Sakallah, Karem A.
    Markov, Igor L.
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2007, 56 (10) : 1415 - 1424
  • [9] A New Look at BDDs for Pseudo-Boolean Constraints
    Abio, Ignasi
    Nieuwenhuis, Robert
    Oliveras, Albert
    Rodriguez-Carbonell, Enric
    Mayer-Eichberger, Valentin
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2012, 45 : 443 - 480
  • [10] Generalized Totalizer Encoding for Pseudo-Boolean Constraints
    Joshi, Saurabh
    Martins, Ruben
    Manquinho, Vasco
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2015, 2015, 9255 : 200 - 209
12345