Pseudo-Boolean Constraints from a Knowledge Representation Perspective - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Pseudo-Boolean Constraints from a Knowledge Representation Perspective

Résumé

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.

Dates et versions

hal-02310063 , version 1 (09-10-2019)

Identifiants

Citer

Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon. Pseudo-Boolean Constraints from a Knowledge Representation Perspective. 27th International Joint Conference on Artificial Intelligence (IJCAI'18), Jul 2018, Stockholm, Sweden. pp.1891-1897, ⟨10.24963/ijcai.2018/261⟩. ⟨hal-02310063⟩
63 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More