Sciweavers

557 search results - page 30 / 112
» Useful Transformations in Answer set programming
Sort
View
EMSOFT
2003
Springer
14 years 1 months ago
Generating Heap-Bounded Programs in a Functional Setting
Abstract. High-level programming languages offer significant expressivity but provide little or no guarantees about resource utilization. Resource-bounded languages provide stron...
Walid Taha, Stephan Ellner, Hongwei Xi
AMAI
2006
Springer
13 years 8 months ago
Strong order equivalence
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
Wolfgang Faber, Kathrin Konczak
WORDS
2003
IEEE
14 years 1 months ago
Weaving Aspects into Real-Time Operating System Design Using Object-Oriented Model Transformation
Despite of the proliferation of object-oriented and component technology, their application to real-time operating systems (RTOS) has been limited since most design concerns in RT...
Jiyong Park, Saehwa Kim, Seongsoo Hong
ADBIS
1995
Springer
130views Database» more  ADBIS 1995»
13 years 11 months ago
Magic Sets vs. SLD-Resolution
It is by now folklore that the bottom-up evaluation of a program after the “magic set” transformation is “as efficient as” top-down evaluation. There are a number of forma...
Stefan Brass
FPCA
1995
13 years 11 months ago
The Functional Side of Logic Programming
In this paper we study the relationships between logic programming and functional programming, trying to answer the following basic question: to what extent is logic programming j...
Massimo Marchiori