The purpose of this appendix is to introduce (in a compact manner) the syntax and semantics of the most prominent DLs occurring in this handbook. More information and explanations...
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Many optimization problems can be expressed us ing some form of soft constraints, where different measures of desirability arc associated with differ ent combinations of domai...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
To model combinatorial decision problems involving uncertainty and probability, we extend the stochastic constraint programming framework proposed in [Walsh, 2002] along a number ...
In this paper, we attempt to explain why rule-based syntactic analysis systems have not so far worked as well as they could. This will motivate our approach, which is based on a n...