1194 search results - page 91 / 239 » A Calculus for Predicative Programming |
169
Voted
CI
2000
15 years 2 months ago
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
200
Voted
LOPSTR
2009
Springer
15 years 9 months ago
2009
Springer
Answer Set Programming (ASP) is a powerful paradigm of logic programming for non-monotonic reasoning. However, the restriction of “grounded range-restricted function-free normal ...
116
Voted
ALT
1994
Springer
15 years 6 months ago
1994
Springer
This paper presents a method of extracting subprograms from background knowledge. Most studies on learning logic programs so far developed are mainly concerned with pure Prolog, so...
161
click to vote
ICLP
1994
Springer
15 years 6 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
123
Voted
DBPL
2007
Springer
15 years 6 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...