We provide an overall description of the Ciao multiparadigm programming system
emphasizing some of the novel aspects and motivations behind its design and …

Abstract interpretation is a theory of semantics approximation that is used for the
construction of semantic-based program analysis algorithms (sometimes called “data flow …

Parallelizing logic programming has attracted much interest in the research community,
because of the intrinsic OR-and AND-parallelisms of logic programs. One research stream …

Since the early days of logic programming, researchers in the field realized the potential for
exploitation of parallelism present in the execution of logic programs. Their high-level …

T he power of logic programming (LP) comes from the synergism between the logic
(declarativeness) and the programming (procedurality [13, 37]. From the logic point of view …

Desirable mathematical background for this chapter includes o basic concepts such as
lattices, complete partial orders, homomorphisms, etc. o the elements of domain theory, eg …

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 …

This paper is a general overview of an approach to the semantics of logic programs whose
aim is to find notions of models which really capture the operational semantics, and are …

Many analysis problems can be cast in the form of evaluating minimal models of a logic
program. Although such formulations are appealing due to their simplicity and …

A practical procedure for computing a regular approximation of a logic program is given.
Regular approximations are useful in a variety of tasks in debugging, program specialisation …