资源分类
》 资源 》论文》Pseudo-Boolean Constraints from a Knowledge Representation Perspective

Pseudo-Boolean Constraints from a Knowledge Representation Perspective

2019-11-06 | |  64 |   38 |   0
Abstract 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.

上一篇：Rethinking Diversified and Discriminative Proposal Generation for Visual Grounding

下一篇：Doubly Aligned Incomplete Multi-view Clustering Menglei Hu and Songcan Chen?

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...