348 search results - page 13 / 70 » Using Case-Based Reasoning to Write Constraint Programs |
CL
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
ESOP
2003
Springer
14 years 19 days ago
2003
Springer
This paper proposes the use of constraint logic programming (CLP) to perform model checking of traditional, imperative programs. We present a semantics-preserving translation from ...
ICSE
2012
IEEE-ACM
11 years 9 months ago
2012
IEEE-ACM
Abstract—Atomicity, a general correctness criterion in concurrency programs, is often violated in real-world applications. The violations are difficult for developers to fix, m...
CL
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
SAC
2002
ACM
13 years 7 months ago
2002
ACM
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...