Sciweavers

241 search results - page 1 / 49
» Bounded Nondeterminism of Logic Programs
Sort
View
92
Voted
ICLP
1999
Springer
15 years 3 months ago
Bounded Nondeterminism of Logic Programs
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...
Dino Pedreschi, Salvatore Ruggieri
67
Voted
PPDP
2000
Springer
15 years 2 months ago
Type-based nondeterminism checking in functional logic programs
Michael Hanus, Frank Steiner
99
Voted
COCO
2003
Springer
114views Algorithms» more  COCO 2003»
15 years 4 months ago
Bounded Nondeterminism and Alternation in Parameterized Complexity Theory
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
Yijia Chen, Jörg Flum, Martin Grohe
85
Voted
ICLP
2005
Springer
15 years 4 months ago
Nondeterminism Analysis of Functional Logic Programs
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...
Bernd Braßel, Michael Hanus
85
Voted
PODS
1990
ACM
148views Database» more  PODS 1990»
15 years 2 months ago
Stable Models and Non-Determinism in Logic Programs with Negation
Previous researchers have proposed generalizations of Horn clause logic to support negation and nondeterminism as two separate extensions. In this paper, we show that the stable m...
Domenico Saccà, Carlo Zaniolo