Expressive temporal reasoning formalisms are essential for AI. One family of such
formalisms consists of disjunctive extensions of the simple temporal problem (STP). Such …

We introduce the problem of finding a satisfying assignment to a CNF formula that must
further belong to a prescribed input subspace. Equivalent formulations of the problem …

For several types of maximal clones on finite sets, we construct singleton weak bases
consisting of an irredundant relation without fictitious coordinates such that every variable …

The constrained satisfaction problems (CSPs) is one of the problem solving approach in
artificial intelligence (AI). It assigns values to variables from their respective domains …

Weak Bases for All Maximal Clones Page 1 Weak bases for all maximal clones Mike Behrisch
Institut für Diskrete Mathematik und Geometrie, Technische Universität Wien, Vienna, Austria …

The goal of constraint acquisition is to learn exactly a constraint network given access to an
oracle that answers truthfully certain types of queries. In this paper we focus on partial …

What are weak bases good for? tool for reductions (≤) between various types of
computational problems in complexity theory obtaining special complexity reductions where …

In this paper we are interested in the fine-grained complexity of determining whether there is
an homomorphism from an input graph G to a fixed graph H (the H-coloring problem). The …

The constraint satisfaction problem (CSP) on a finite relational structure B is to decide, given
a set of constraints on variables where the relations come from B, whether or not there is an …