Abstract Even though the Constraint Satisfaction Problem (CSP) is NP-complete, many
tractable classes of CSP instances have been identified. After discussing different forms and …

Promise CSPs are a relaxation of constraint satisfaction problems where the goal is to find
an assignment satisfying a relaxed version of the constraints. Several well known problems …

Dependency parsing with high-order features results in a provably hard decoding problem.
A lot of work has gone into developing powerful optimization methods for solving these …

The constraint satisfaction problem (CSP) is a widely studied problem with numerous
applications in computer science and artificial intelligence. For infinite-domain CSPs, there …

This study proposed a hybrid computational model by incorporating Election Algorithm (EA)
as a heuristics search technique in a Hopfield type of artificial neural network (HNN). The …

Universal algebra has proven to be a useful tool in the study of constraint satisfaction
problems (CSP) since the complexity, up to logspace reductions, is determined by the clone …

We study logical reduction (factorization) of relations into relations of lower arity by Boolean
or relative products that come from applying conjunctions and existential quantifiers to …

Representative Selection (RS) is the problem of finding a small subset of exemplars from a
dataset that is representative of the dataset. In this paper, we study RS for attributed graphs …

Two well-studied closure operators for relations are based on existentially quantified
conjunctive formulas, primitive positive (pp) definitions, and primitive positive formulas …

We prove that testing the flat foldability of an origami crease pattern (either labeled with
mountain and valley folds, or unlabeled) is fixed-parameter tractable when parameterized by …