Sciweavers

3470 search results - page 519 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
ECOOP
2010
Springer
15 years 9 months ago
Verifying Generics and Delegates
Recently, object-oriented languages, such as C , have been extended with language features prevalent in most functional languages: parametric polymorphism and higher-order function...
Kasper Svendsen, Lars Birkedal, Matthew Parkinson
AADEBUG
2000
Springer
15 years 8 months ago
Value Withdrawal Explanation in CSP
This work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, c...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
AIMSA
2000
Springer
15 years 8 months ago
Least Generalization under Relative Implication
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization oper...
Svetla Boytcheva
CL
2000
Springer
15 years 8 months ago
Representing Trees with Constraints
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...
Ben Curry, Geraint A. Wiggins, Gillian Hayes
AGP
1999
IEEE
15 years 8 months ago
Extending clp(FD) by Negative Constraint Solving
In this paper we present a novel extension to the constraint logic programming on Finite Domains (clp(FD)) which combines the usual clp(FD) primitive constraint X in range with a ...
Antonio J. Fernández, Patricia M. Hill