Sciweavers

1968 search results - page 3 / 394
» The Complexity of Valued Constraint Models
Sort
View
COLING
2008
13 years 7 months ago
Underspecified Modelling of Complex Discourse Constraints
We introduce a new type of discourse constraints for the interaction of discourse relations with the configuration of discourse segments. We examine corpus-extracted examples as s...
Markus Egg, Michaela Regneri
LICS
2009
IEEE
14 years 21 days ago
The Complexity of Global Cardinality Constraints
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
Andrei A. Bulatov, Dániel Marx
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 3 months ago
Matching Dependencies with Arbitrary Attribute Values: Semantics, Query Answering and Integrity Constraints
Matching dependencies (MDs) are used to declaratively specify the identification (or matching) of certain attribute values in pairs of database tuples when some similarity conditi...
Jaffer Gardezi, Leopoldo E. Bertossi, Iluju Kiring...
ACL
1994
13 years 7 months ago
Multiset-Valued Linear Index Grammars: Imposing Dominance Constraints on Derivations
This paper defines multiset-valued linear index grammar and unordered vector grammar with dominance links. The former models certain uses of multisetvalued feature structures in u...
Owen Rambow
AADEBUG
2000
Springer
13 years 10 months ago
Value Withdrawal Explanation in CSP
This work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, c...
Gérard Ferrand, Willy Lesaint, Alexandre Te...