Sciweavers

513 search results - page 11 / 103
» Reduction Transformations in ORM
Sort
View
ASP
2001
Springer
15 years 4 months ago
Useful Transformations in Answer set programming
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
Mauricio Osorio, Juan Carlos Nieves, Chris Giannel...
ENTCS
2008
102views more  ENTCS 2008»
14 years 11 months ago
Towards a Systematic Method for Proving Termination of Graph Transformation Systems
We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite `creation chains&#...
Harrie Jan Sander Bruggink
UAI
1990
15 years 26 days ago
Problem formulation as the reduction of a decision model
In this paper, we extend the QMR-DT probabilistic model for the domain of internal medicine to include decisions about treatments. In addition, we describe how we can use the comp...
David Heckerman, Eric Horvitz
LISP
2008
72views more  LISP 2008»
14 years 11 months ago
Imperative-program transformation by instrumented-interpreter specialization
We describe how to implement strength reduction, loop-invariant code motion and loop quasi-invariant code motion by specializing instrumented interpreters. To curb code duplication...
Søren Debois
VLSID
1998
IEEE
105views VLSI» more  VLSID 1998»
15 years 4 months ago
Optimizing Logic Design Using Boolean Transforms
When a Boolean function is transformed by exclusiveOR with a suitably selected transform function, the new functzon is often synthesized wzth significantly reduced hardware. `I�...
Pramit Chavda, James Jacob, Vishwani D. Agrawal