Sciweavers

2000 search results - page 98 / 400
» Program Transformation and Proof Transformation
Sort
View
EPIA
2005
Springer
15 years 9 months ago
Reducing Propositional Theories in Equilibrium Logic to Logic Programs
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
Pedro Cabalar, David Pearce, Agustín Valver...
128
Voted
PADL
2000
Springer
15 years 7 months ago
Parallel Functional Reactive Programming
In this paper, we demonstrate how Functional Reactive Programming (FRP), a framework for the description of interactive systems, can be extended to encompass parallel systems. FRP ...
John Peterson, Valery Trifonov, Andrei Serjantov
143
Voted
LPNMR
2007
Springer
15 years 9 months ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
106
Voted
CSR
2009
Springer
15 years 10 months ago
Variations on Muchnik's Conditional Complexity Theorem
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
Daniil Musatov, Andrei E. Romashchenko, Alexander ...
LCPC
1993
Springer
15 years 7 months ago
Maximizing Loop Parallelism and Improving Data Locality via Loop Fusion and Distribution
Abstract. Loop fusion is a program transformation that merges multiple loops into one. It is e ective for reducing the synchronization overhead of parallel loops and for improving ...
Ken Kennedy, Kathryn S. McKinley