87 search results - page 17 / 18 » Functions and Lazy Evaluation in Prolog |
TACAS
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
LPKR
1997
Springer
13 years 10 months ago
1997
Springer
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
EACL
1993
ACL Anthology
13 years 7 months ago
1993
ACL Anthology
The strategy for natural language interpretation presented in this paper implements the dynamics of context change by translating natural language texts into a meaning representat...
POPL
1995
ACM
13 years 9 months ago
1995
ACM
We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many com...
ASPLOS
2008
ACM
13 years 8 months ago
2008
ACM
Today's system programmers go to great lengths to extend the languages in which they program. For instance, system-specific compilers find errors in Linux and other systems, ...