352 search results - page 18 / 71 » Paraconsistent Declarative Semantics for Extended Logic Prog... |
111
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
110
click to vote
FLOPS
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
LOGCOM
2010
14 years 10 months ago
2010
In this paper, we propose an extension of Answer Set Programming (ASP) to support declarative reasoning on consumption and production of resources. We call the proposed extension ...
WLP
2005
Springer
15 years 5 months ago
2005
Springer
Assigning semantics to logic programs via selector generated models (Schwarz 2002/2003) extends several semantics, like the stable, the inflationary, and the stable generated sema...
109
click to vote
LOPSTR
1994
Springer
15 years 3 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...