We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
The eld of theory update has seen some improvement, in what regards updating, by allowing desired updates to be speci ed by update programs. The updating of models is governed by ...
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
ract Interpretation of Logic Programs Maurice Bruynooghe and Gerda :Ianssens Department of Computer Science, Katholleke Universiteit Leuven Celestijnenlaan 200A, B-3001 Heverlee, B...