Sciweavers

858 search results - page 3 / 172
» A Glimpse of Constraint Satisfaction
Sort
View
INFORMS
2010
110views more  INFORMS 2010»
13 years 4 months ago
Incremental Satisfiability and Implication for UTVPI Constraints
use for constraint solving, abstract interpretation, spatial databases, and theorem proving. In this paper we develop new incremental algorithms for UTVPI constraint satisfaction a...
Andreas Schutt, Peter J. Stuckey
LICS
2012
IEEE
11 years 9 months ago
Near Unanimity Constraints Have Bounded Pathwidth Duality
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
Libor Barto, Marcin Kozik, Ross Willard
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 4 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
EMNLP
2007
13 years 8 months ago
A Constraint Satisfaction Approach to Dependency Parsing
We present an adaptation of constraint satisfaction inference (Canisius et al., 2006b) for predicting dependency trees. Three different classifiers are trained to predict weighte...
Sander Canisius, Erik Tjong Kim Sang