Bounded Nondeterminism of Logic Programs (1999)
| Venue: | Proc. of the International Conference on Logic Programming |
| Citations: | 4 - 3 self |
BibTeX
@INPROCEEDINGS{Pedreschi99boundednondeterminism,
author = {Dino Pedreschi and Salvatore Ruggieri},
title = {Bounded Nondeterminism of Logic Programs},
booktitle = {Proc. of the International Conference on Logic Programming},
year = {1999},
pages = {350--364},
publisher = {The MIT Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 them via any selection rule. We o#er a declarative characterization of the class of programs and queries that have bounded nondeterminism by defining bounded programs and queries. The characterization is provided in terms of Herbrand interpretations and level mappings, in the style of existing characterizations of universal termination.
