4370 search results - page 135 / 874 » Algebra of Logic Programming |
106
Voted
ISMVL
2000
IEEE
15 years 7 months ago
2000
IEEE
We present a uniform relational framework for developing proof systems for theories of manyvaluedness that may have the form of a logical system, of a class of algebra or of an in...
127
click to vote
ENTCS
2010
15 years 2 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
121
Voted
ICCS
2004
Springer
15 years 8 months ago
2004
Springer
We show in this paper how to evaluate the performance of skeleton-based high level parallel programs. Since many applications follow some commonly used algorithmic skeletons, we id...
105
click to vote
CADE
2001
Springer
16 years 2 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
137
click to vote
LPAR
1992
Springer
15 years 6 months ago
1992
Springer
We describe some of the techniques which have been used to implement METATEM, a programming language based on temporal logic, and address problems such as non-determinism and loopi...