348 search results - page 36 / 70 » Using Case-Based Reasoning to Write Constraint Programs |
124
click to vote
ILP
2007
Springer
15 years 8 months ago
2007
Springer
The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows ...
111
click to vote
CORR
2004
Springer
15 years 2 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
133
click to vote
FLOPS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. The paper "Scrap your boilerplate" (SYB) introduces a combinator library for generic programming that offers generic traversals and queries. Classically, suppor...
109
click to vote
LPNMR
2005
Springer
15 years 8 months ago
2005
Springer
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
90
Voted
CP
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we argue that an attractive and potentially very general way of achieving generalized arc consistency (GAC) on a constraint is by using unit propagation (UP) over a C...