The Constraint Logic Programming (CLP) Scheme gave a formal framework, based on constraints, for the basic operational, logical and algebraic semantics of an extended class of logic programs.Expand

We identify two classes of Boolean functions that have been used: positive and definite functions, and we systematically investigate these classes and their efficient implementation for dependency analyses.Expand

We identify two classes of Boolean functions that have been used: positive and definite functions, and we systematically investigate their efficient implementation for dependency analyses.Expand

Immersive Analytics is an emerging research thrust investigating how new interaction and display technologies can be used to support analytical reasoning and decision making.Expand

The problem of node overlap removal is to adjust the layout generated by typical graph drawing methods so that nodes of non-zero width and height do not overlap, yet are as close as possible to their original positions.Expand

We show how precise groundness information can be extracted from logic programs by using Boolean functions as approximations to groundness dependencies between variables.Expand

In the literature, unification is often treated as a simple and straightforward matter, even though it is recognized as a deep and fundamental concept.Expand