Sciweavers

1381 search results - page 9 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
STACS
2005
Springer
14 years 3 months ago
The Core of a Countably Categorical Structure
ded abstract of this article is published in the proceedings of STACS’05, LNCS 3404, Springer Verlag. A relational structure is a core, if all its endomorphisms are embeddings. T...
Manuel Bodirsky
CP
2003
Springer
14 years 2 months ago
A Synthesis of Constraint Satisfaction and Constraint Solving
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
Michael J. Maher
ICDT
2010
ACM
141views Database» more  ICDT 2010»
14 years 1 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
GI
2009
Springer
14 years 2 months ago
Constraint Checking for Business Process Management
: Compliance management tackles issues related to both modelling and enforcement of business constraints in enterprises. In the context of business process management, we propose a...
Wolfgang Runte, Marwane El Kharbili