Sciweavers

557 search results - page 36 / 112
» Useful Transformations in Answer set programming
Sort
View
PLILP
1993
Springer
14 years 13 hour ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
VMCAI
2007
Springer
14 years 2 months ago
Constructing Specialized Shape Analyses for Uniform Change
Abstract. This paper is concerned with one of the basic problems in abstract interpretation, namely, for a given abstraction and a given set of concrete transformers (that express ...
Tal Lev-Ami, Mooly Sagiv, Neil Immerman, Thomas W....
VLDB
1994
ACM
149views Database» more  VLDB 1994»
14 years 3 hour ago
Qualified Answers That Reflect User Needs and Preferences
This paper introduces a formalism to describe the needs and preferences of database users. Because of the precise formulation of these concepts, we have found an automatic and ver...
Terry Gaasterland, Jorge Lobo
PLILP
1992
Springer
13 years 12 months ago
Unfold/fold Transformations Preserving Termination Properties
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
Torben Amtoft
ICLP
2003
Springer
14 years 1 months ago
Uniform Equivalence of Logic Programs under the Stable Model Semantics
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
Thomas Eiter, Michael Fink