700 search results - page 72 / 140 » On Termination of Constraint Logic Programs |
ICFP
2004
ACM
15 years 11 months ago
2004
ACM
Recent functional logic languages such as Curry and Toy combine lazy functional programming with logic programming features including logic variables, non-determinism, unification...
ICLP
2010
Springer
15 years 3 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
101
Voted
ILP
2004
Springer
15 years 4 months ago
2004
Springer
For the last ten years a lot of work has been devoted to propositionalization techniques in relational learning. These techniques change the representation of relational problems t...
APPT
2003
Springer
15 years 4 months ago
2003
Springer
This paper focuses on the problem of scheduling outages to computer systems in complex distributed environments. The interconnected nature of these systems makes scheduling global ...
100
click to vote
ICFP
2008
ACM
15 years 11 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...