Sciweavers

86 search results - page 8 / 18
» Entailment of Finite Domain Constraints
Sort
View
ACL
1990
13 years 9 months ago
Structural Disambiguation with Constraint Propagation
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
Hiroshi Maruyama
CSL
2010
Springer
13 years 9 months ago
The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
Barnaby Martin, Jos Martin
CHI
2004
ACM
14 years 8 months ago
A constraint satisfaction approach to predicting skilled interactive cognition
In this paper we report a new approach to generating predictions about skilled interactive cognition. The approach, which we call Cognitive Constraint Modeling, takes as input a d...
Alonso H. Vera, Andrew Howes, Michael McCurdy, Ric...
CAV
2009
Springer
169views Hardware» more  CAV 2009»
14 years 8 months ago
Automatic Verification of Integer Array Programs
We provide a verification technique for a class of programs working on integer arrays of finite, but not a priori bounded length. We use the logic of integer arrays SIL [13] to spe...
Filip Konecný, Marius Bozga, Peter Habermeh...
SAS
1993
Springer
104views Formal Methods» more  SAS 1993»
13 years 12 months ago
Strictness Properties of Lazy Algebraic Datatypes
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
P. N. Benton