158 search results - page 8 / 32 » Coinductive Logic Programming with Negation |
LPNMR
1990
Springer
14 years 2 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
LPNMR
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at s...
AGP
1999
IEEE
14 years 3 months ago
1999
IEEE
In this paper we present a novel extension to the constraint logic programming on Finite Domains (clp(FD)) which combines the usual clp(FD) primitive constraint X in range with a ...
LPNMR
1993
Springer
14 years 3 months ago
1993
Springer
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
CL
2000
Springer
14 years 3 months ago
2000
Springer
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...