700 search results - page 69 / 140 » On Termination of Constraint Logic Programs |
SARA
2009
Springer
15 years 3 months ago
2009
Springer
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
113
click to vote
ICLP
1999
Springer
15 years 3 months ago
1999
Springer
Oz is a multiparadigm language that supports logic programming as one of its major paradigms. A multiparadigm language is designed to support different programming paradigms (log...
106
click to vote
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
PLILP
1998
Springer
15 years 3 months ago
1998
Springer
: The bene ts of the object, logic or relational, functional, and constraint paradigms can be obtained from our previous combination of the object and functional paradigms in hidde...