Sciweavers

378 search results - page 26 / 76
» Automating Mathematical Program Transformations
Sort
View
LPNMR
2007
Springer
15 years 5 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...
CSL
1998
Springer
15 years 3 months ago
Revision Programming = Logic Programming + Integrity Constraints
We study revision programming, a logic-based mechanism for enforcing constraints on databases. The central concept of this approach is that of a justi ed revision based on a revisi...
V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczyns...
CASES
2006
ACM
15 years 5 months ago
Memory optimization by counting points in integer transformations of parametric polytopes
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
Rachid Seghir, Vincent Loechner
CADE
2007
Springer
15 years 11 months ago
Formalization of Continuous Probability Distributions
Continuous probability distributions are widely used to mathematically describe random phenomena in engineering and physical sciences. In this paper, we present a methodology that ...
Osman Hasan, Sofiène Tahar
LOPSTR
2007
Springer
15 years 5 months ago
Denotation by Transformation
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
Bernd Braßel, Jan Christiansen