Pseudo-Boolean Constraints from a Knowledge Representation Perspective

Authors: Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon

IJCAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical 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.
Researcher Affiliation Academia 1CRIL-CNRS UMR 8188, Lens, France 2Universit e d Artois 3 Institut Universitaire de France leberre@cril.fr, marquis@cril.fr, mengel@cril.fr, wallon@cril.fr
Pseudocode No The paper includes mathematical definitions and proofs but does not contain any pseudocode or algorithm blocks.
Open Source Code No The paper does not provide any statement about releasing source code or links to a code repository.
Open Datasets No The paper is theoretical and does not use datasets for training.
Dataset Splits No The paper is theoretical and does not involve data splitting for validation.
Hardware Specification No The paper is theoretical and does not mention any specific hardware used for computational experiments.
Software Dependencies No The paper mentions some related systems and formats (e.g., DIMACS, SAT solvers) but does not list specific software dependencies with version numbers required to replicate the paper's theoretical work or any potential computational components.
Experiment Setup No The paper is theoretical and does not describe an experimental setup with hyperparameters or training configurations.