Mathematics never saw much of a reason to deal with something called nondeterminism. It
works with values, functions, sets, and relations. In computing science, however …

An extended logic programming language is presented, that embodies the fundamental form
of set designation based on the (nesting) element insertion operator. The kind of sets to be …

We present an extended completion procedure with builtin theories defined by a collection
of associativity and commutativity axioms and additional ground equations, and reformulate …

In this paper we review the definition of {log} 1, a logic language with sets, from the
viewpoint of CLP. We show that starting with a CLP-scheme allows a more uniform treatment …

The problem is addressed of establishing the satisfiability of prenex formulas involving a
single universal quantifier, in diversified axiomatic set theories. A rather general decision …

Hereditarily finite sets and hypersets are characterized both as algorithmic data structures
and by means of a first‐order axiomatization which, despite being rather weak, suffices to …

General agreement exists about the usefulness of sets as very high-level representations of
complex data structures. Therefore it is worthwhile to introduce sets into constraint logic …

Set constraints are the main ingredient in set-based program analysis [8, 11, 5, 2, 4]. In this
approach, only monadic properties of program variables are considered; all …

Set constraints are inclusion relations between expressions denoting sets of ground terms
over a ranked alphabet. They are the main ingredient in set-based program analysis. In this …

Constructive negation has been proved to be a valid alternative to negation as failure,
especially when negation is required to have, in a sense, anactive'role. In this paper we …