4940 search results - page 245 / 988 » On the Complexity of Universal Programs |
208
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
165
click to vote
OOPSLA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we describe Ginger, a new language with first class support for literate programming. Literate programming refers to a philosophy that argues computer programs shou...
173
click to vote
OOPSLA
2010
Springer
15 years 5 months ago
2010
Springer
Accurately predicting program behaviors (e.g., locality, dependency, method calling frequency) is fundamental for program optimizations and runtime adaptations. Despite decades of...
162
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
In this work we propose a methodology for document reconstruction based on dynamic programming and a modified version of the Prim’s algorithm. Firstly, we use polygonal approxi...
171
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...