Abstract Constraint Logic Programming (CLP) is a merger of two declarative paradigms:
constraint solving and logic programming. Although a relatively new field, CLP has …

We discuss the relationship between constraint programming and database query
languages. We show that bottom-up, efficient, declarative database programming can be …

We survey termination analysis techniques for Logic Programs. We give an extensive
introduction to the topic. We recall several motivations for the work, and point out the …

Progress on automated termination detection for logic programs is reported, The prospects
for handling a large class of programs completely automatically appear promising, in …

Constraint databases generalize relational databases by finitely representable infinite
relations. This paper surveys the state of the art in constraint databases: known results …

Many program optimizations and analyses, such as array-bounds checking, termination
analysis, etc., depend on knowing the size of a function's input and output. However, size …

The declarative programming paradigms used in constraint languages can lead to powerful
extensions of Codd's relational data model. The development of constraint database query …

Termination analysis has received considerable attention, traditionally in the context of
declarative programming, and recently also for imperative languages. In existing …

This paper describes a general framework for automatic termination analysis of logic
programs, where we understand by “termination” the finiteness of the LD-tree constructed for …

Programming with constraints as primitives extends both deductive and object-oriented data
models. This new database programming paradigm(called Constraint Query Languages or …