Sciweavers

601 search results - page 2 / 121
» Quantified Equality Constraints
Sort
View
CORR
2010
Springer
129views Education» more  CORR 2010»
13 years 5 months ago
The complexity of positive first-order logic without equality
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
Florent R. Madelaine, Barnaby Martin
ACL
1997
13 years 6 months ago
A Uniform Approach to Underspecification and Parallelism
We propose a unified framework in which to treat semantic underspecification and parallelism phenomena in discourse. The framework employs a constraint language that can express e...
Joachim Niehren, Manfred Pinkal, Peter Ruhrberg
CSCLP
2006
Springer
13 years 9 months ago
Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
Marc Meister, Khalil Djelloul, Thom W. Frühwi...
ESOP
2001
Springer
13 years 9 months ago
Entailment with Conditional Equality Constraints
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend eq...
Zhendong Su, Alexander Aiken
CORR
2007
Springer
67views Education» more  CORR 2007»
13 years 5 months ago
Generalizing Consistency and other Constraint Properties to Quantified Constraints
Lucas Bordeaux, Marco Cadoli, Toni Mancini