The paper introduces an AND/OR search space perspective for graphical models that
include probabilistic networks (directed or undirected) and constraint networks. In contrast to …

We introduce in this paper two new, complete propositional languages and study their
properties in terms of (1) their support for polytime operations and (2) their ability to …

Ad-hoc constraints (also called generic constraints) are important for modelling Constraint
Satisfaction Problems (CSPs). Many representations have been proposed to define ad-hoc …

We present an incremental refinement algorithm for approximate compilation of constraint
satisfaction models into multivalued decision diagrams (MDDs). The algorithm uses a vertex …

We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that
respects a given vtree (known as structured DNNF). This representation of propositional …

The task of computing homomorphisms between two finite relational structures A and B is a
well-studied question with numerous applications. Since the set Hom (A, B) of all …

A binary constraint tree (BCT, Wang and Yap 2022) is a normalized binary CSP whose
constraint graph is a tree. A BCT constraint is a constraint represented with a BCT where …

We introduce a top-down compilation algorithm for constructing structured DNNF for any
Boolean function. With appropriate restrictions, the algorithm can produce various subsets of …

We present a CNF to Tree-of-BDDs (ToB) compiler with complexity at most exponential in
the tree width. We then present algorithms for interesting queries on ToB. Although some of …

In distributed constraint optimization problems, dynamic programming methods have been
recently proposed (eg DPOP). In dynamic programming many valuations are grouped …