Sciweavers

7456 search results - page 344 / 1492
» Parallelism in Logic Programming
Sort
View
ICFP
2009
ACM
16 years 7 months ago
Biorthogonality, step-indexing and compiler correctness
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
Nick Benton, Chung-Kil Hur
CONCUR
2003
Springer
15 years 12 months ago
Model Checking a Path
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
Nicolas Markey, Ph. Schnoebelen
PPDP
2007
Springer
16 years 24 days ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel
ICLP
2001
Springer
15 years 11 months ago
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smo...
GEOINFORMATICA
2011
15 years 1 months ago
Functional description of geoprocessing services as conjunctive datalog queries
Discovery of suitable web services is a crucial task in Spatial Data Infrastructures (SDI). In this work, we develop a novel approach to the discovery of geoprocessing services (WP...
Daniel Fitzner, Jörg Hoffmann, Eva Klien