3983 search results - page 245 / 797 » Conceptual logic programs |
165
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...
222
click to vote
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...
164
Voted
DASFAA
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract. Extensions of relational databases which aim at utilizing various aspects of similarity and imprecision in data processing are widespread in the literature. A need for de...
302
Voted
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...
162
click to vote
TASE
2009
IEEE
16 years 1 months 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...