158 search results - page 16 / 32 » Coinductive Logic Programming with Negation |
100
click to vote
LPKR
1997
Springer
15 years 3 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...
104
click to vote
IJCAI
2007
15 years 1 months ago
2007
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
CIA
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Logic programming has often been considered less than adequate for modelling the dynamics of knowledge changing over time. In this paper we describe Evolving Logic Progra...
134
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Many functional logic languages are based on narrowing, a unification-based goal-solving mechanism which subsumes the reduction mechanism of functional languages and the resolutio...
110
click to vote
LPKR
1997
Springer
15 years 3 months ago
1997
Springer
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...