Sciweavers

3566 search results - page 216 / 714
» Signed Logic Programs
Sort
View
PPDP
2007
Springer
15 years 5 months 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 4 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
14 years 6 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
POPL
2004
ACM
15 years 12 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
TASE
2009
IEEE
15 years 6 months ago
The Logical Approach to Low-Level Stack Reasoning
—Formal verification of low-level programs often requires explicit reasoning and specification of runtime stacks. Treating stacks naively as parts of ordinary heaps can lead to...
Xinyu Jiang, Yu Guo, Yiyun Chen