3693 search results - page 224 / 739 » Splitting a Logic Program |
162
click to vote
ICLP
2001
Springer
15 years 10 months ago
2001
Springer
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...
219
Voted
GEOINFORMATICA
2011
15 years 1 months ago
2011
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...
297
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
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...
161
click to vote
TASE
2009
IEEE
16 years 26 days ago
2009
IEEE
—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...
170
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
In the classical database world, information access has been based on a paradigm that involves structured, schema-aware, queries and tabular answers. In the current environment, h...