Sciweavers

241 search results - page 19 / 49
» Bounded Nondeterminism of Logic Programs
Sort
View
PPDP
2001
Springer
14 years 2 days ago
Polymorphic Directional Types for Logic Programming
In this paper we present a new type system for logic programs. Our system combines ideas of the classical polymorphic, but not very precise, system due to Mycroft and O'Keefe...
Pawel Rychlikowski, Tomasz Truderung
PODS
1991
ACM
131views Database» more  PODS 1991»
13 years 11 months ago
Termination Detection in Logic Programs using Argument Sizes
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...
Kirack Sohn, Allen Van Gelder
SEFM
2005
IEEE
14 years 1 months ago
Precise Analysis of Memory Consumption using Program Logics
Memory consumption policies provide a means to control resource usage on constrained devices, and play an important role in ensuring the overall quality of software systems, and i...
Gilles Barthe, Mariela Pavlova, Gerardo Schneider
ICLP
1997
Springer
13 years 11 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
QEST
2010
IEEE
13 years 5 months ago
Reasoning about MDPs as Transformers of Probability Distributions
We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as ex...
Vijay Anand Korthikanti, Mahesh Viswanathan, Gul A...