3513 search results - page 513 / 703 » Super Logic Programs |
76
Voted
ILP
1998
Springer
15 years 5 months ago
1998
Springer
In this paper we argue that the use of a language with a type system, together with higher-order facilities and functions, provides a suitable basis for knowledge representation in...
116
Voted
AGP
1994
IEEE
15 years 4 months ago
1994
IEEE
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
129
click to vote
POPL
1993
ACM
15 years 4 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
78
Voted
ICLP
1990
Springer
15 years 4 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
98
Voted
FLOPS
2004
Springer
15 years 4 months ago
2004
Springer
This paper presents a self-applicable partial evaluator for a considerable subset of full Prolog. The partial evaluator is shown to achieve non-trivial specialisation and be effect...