Add to ORKGThe present paper deals with the decision problem for the class of one-variable patterns, called the consistency problem. Although this problem is obviously in NP, its tractability is unknown. We prove the consistency problem to be decidable in P
AbstractValued constraint satisfaction provides a general framework for optimisation problems over f...
We assume that all combinatorial objects that we refer to (graphs, boolean formulas, families of set...
An extended abstract of this work appeared in Proceedings of the 35th International Symposium on The...
The present paper deals with the problem of finding a consistent one-variable pattern from incomplet...
The complexity of the consistency problem for several important classes of Boolean functions is anal...
AbstractWe settle an open problem, the inclusion problem for pattern languages. This is the first kn...
Quiescent consistency is a notion of correctness for a concurrent object that gives meaning to the o...
The concept of consistency has pervaded studies of the constraint satisfaction problem. We introduce...
The concept of consistency has pervaded studies of the con-straint satisfaction problem. We introduc...
Consistency checking is a fundamental computational problem in genetics. Given a pedigree and inform...
Constraint satisfaction problems (CSPs) provide a flexible and powerful framework for modeling and s...
Abstract. We investigate the parameterized complexity of deciding whether a constraint network is k-...
We investigate the parameterized complexity of deciding whether a constraint network is k-consistent...
We study a generalization of the constraint satisfaction problem (CSP), the periodic constraint sati...
This paper introduces a new consistency-test for a class of codes, referred to as geometric-codes, a...
AbstractValued constraint satisfaction provides a general framework for optimisation problems over f...
We assume that all combinatorial objects that we refer to (graphs, boolean formulas, families of set...
An extended abstract of this work appeared in Proceedings of the 35th International Symposium on The...
The present paper deals with the problem of finding a consistent one-variable pattern from incomplet...
The complexity of the consistency problem for several important classes of Boolean functions is anal...
AbstractWe settle an open problem, the inclusion problem for pattern languages. This is the first kn...
Quiescent consistency is a notion of correctness for a concurrent object that gives meaning to the o...
The concept of consistency has pervaded studies of the constraint satisfaction problem. We introduce...
The concept of consistency has pervaded studies of the con-straint satisfaction problem. We introduc...
Consistency checking is a fundamental computational problem in genetics. Given a pedigree and inform...
Constraint satisfaction problems (CSPs) provide a flexible and powerful framework for modeling and s...
Abstract. We investigate the parameterized complexity of deciding whether a constraint network is k-...
We investigate the parameterized complexity of deciding whether a constraint network is k-consistent...
We study a generalization of the constraint satisfaction problem (CSP), the periodic constraint sati...
This paper introduces a new consistency-test for a class of codes, referred to as geometric-codes, a...
AbstractValued constraint satisfaction provides a general framework for optimisation problems over f...
We assume that all combinatorial objects that we refer to (graphs, boolean formulas, families of set...
An extended abstract of this work appeared in Proceedings of the 35th International Symposium on The...