-
Compiling Constraints in clp(FD)
International audience -
A Simple and Efficient Boolean Solver for Constraint Logic Programming
International audience -
Complete Solving of Linear Diophantine Equational and Inequational Systems wi...
In this report, we present an algorithm for solving {\em directly} linear Diophantine systems of both equations and inequations. Here directly means without adding... -
Modules for Prolog Revisited
Module systems are an essential feature of programming languages as they facilitate the re-use of existing code and the development of general purpose libraries.... -
Closures are Needed for Closed Module Systems
In a classical paper of D.H.D. Warren, the higher-order extensions of Prolog were questioned as they do not really provide more expressive power than meta-programming... -
A Type System for CHR
We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level... -
Goal-oriented test data generation for programs with pointer variables
Automatic test data generation leads to identify input values on which a selected path or a selected branch is executed within a program (path-oriented vs... -
Advances in Artificial Intelligence
ISBN: 978-3-540-25864-3
