557 search results - page 44 / 112 » Useful Transformations in Answer set programming |
ADBIS
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar part...
LOPSTR
2007
Springer
14 years 2 months ago
2007
Springer
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...
SCAM
2008
IEEE
14 years 2 months ago
2008
IEEE
Data-flow analysis is a common technique to gather program information for use in transformations such as register allocation, dead-code elimination, common subexpression elimina...
LCPC
1995
Springer
13 years 11 months ago
1995
Springer
V-cal is a calculus designed to support the compilation of data parallel languages that allows to describe program transformations and optimizations as semantics preserving rewrite...
ICLP
2003
Springer
14 years 1 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...