4940 search results - page 244 / 988 » On the Complexity of Universal Programs |
171
click to vote
AAAI
2006
15 years 8 months ago
2006
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
149
click to vote
IASTEDSEA
2004
15 years 8 months ago
2004
Software engineering is hampered by the fact that software systems quickly become so complex that they are hard to understand, evolve and maintain. Closer integration of code and ...
183
click to vote
CASCON
1996
15 years 7 months ago
1996
For almost a decade we have been working at developing and using template-based models for coarse-grained parallel computing. Our initial system, FrameWorks, was positively receiv...
129
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Supinterpretations have shown their interest to deal with...
141
click to vote
CORR
2009
Springer
15 years 4 months ago
2009
Springer
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states re...