G. Wagner. Logic programming with strong negation and innexact predicates. J. of Logic and Computation, 1(6):835--861, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Model-based Diagnosis Preferences and Strategies.. - Damásio.. (1995) (Correct)
....logic programming semantics has included the introduction of an explicit form of negation, beside the older implicit (or default) negation typical of logic 12 C.V. Dam asio, W. Nejdl, L.M. Pereira, M. Schroeder programming, cf. Gelfond and Lifschitz [GL90a] Pereira and Alferes [PA92] and Wagner [Wag91]. The richer language has been shown adequate for a spate of knowledge representation and reasoning forms by Pereira, Apar icio, and Alferes [PAA93] Alferes, Dam asio, and Pereira [ADP94a, PDA93b] and Baral and Gelfond [BG94] In this section we briefly review the formal definition of extended ....
G. Wagner. Logic programming with strong negation and innexact predicates. J. of Logic and Computation, 1(6), 1991.
SLX -- A top-down derivation procedure for programs with.. - Jos'e Ulio (Correct)
.... applicable to it and, for ground programs, compares favourably with previous approaches [2] 1 Introduction The evolution of Logic Programming semantics has included the introduction of an explicit form of negation, beside the older implicit (or default) negation typical of Logic Programming, cf. [10, 13, 21]. The widespread use of such extended programs requires the definition of a correct top down querying mechanism, as for Prolog. The purpose of this paper is to present one such SLDNF like derivation procedure, SLX, for programs with explicit negation under well founded semantics (WFSX) 13] and ....
G. Wagner. Logic programming with strong negation and innexact predicates. J. of Logic and Computation, 1(6), 1991.
A Logic Programming System for Non-monotonic Reasoning - Alferes, Damásio, Pereira (1995) (27 citations) (Correct)
.... years several authors (e.g. 27, 48, 66] have stressed the importance of extending LP with a second kind of negation : for use in deductive databases, knowledge representation, and non monotonic reasoning (NMR) Different semantics for extended LPs with : negation (ELP) have appeared (e.g. [3, 27, 45, 55, 65, 66]) The particular generalization for extended programs of WFS defined in [45] WFSX, which is taken as the base semantics in this article, provides an added qualitative representational expressivity that can capture a wide variety of logical reasoning forms, and serve as an instrument for ....
G. Wagner. Logic programming with strong negation and innexact predicates. J. of Logic and Computation, 1(6):835--861, 1991.
Abduction Over 3-Valued Extended Logic Programs - Damásio, Pereira (Correct)
....of literals. This can be a serious limitation. Logic programming semantics has now been extended with a new explicit form of negation, beside the other implicit (or default) negation typical of Logic Programming. Different semantics for such extended programs with a : negation have appeared (e.g. [4, 15, 20, 24, 29, 30]) The generalization for extended programs of the WFS defined in [20] WFSX, adopted as the base semantics in this paper, provides a representational expressivity that captures a wide variety of logical reasoning forms [6, 16, 22] The two forms of negation, default and explicit, are not ....
G. Wagner. Logic programming with strong negation and innexact predicates. J. of Logic and Computation, 1(6):835--861, 1991.
A Logic Programming System for Non-monotonic Reasoning - Alferes, Damásio.. (1995) (27 citations) (Correct)
....no mechanism for explicitly declaring the falsity of literals. This can be a serious limitation. The evolution of Logic Programming semantics has included the introduction of a new explicit form of negation, beside the older implicit (or default) negation typical of Logic Programming, namely in [30, 48, 70]. The richer language has been shown adequate for a diversity of knowledge representation and reasoning forms [9, 31, 52] In fact, in recent years several authors (e.g. 30, 52, 71] have stressed the importance of extending LP with a second kind of negation : for use in deductive databases, ....
G. Wagner. Logic programming with strong negation and innexact predicates. J. of Logic and Computation, 1(6):835--861, 1991.
Abduction Over 3-Valued Extended Logic - Programs Carlos Viegas (Correct)
No context found.
G. Wagner. Logic programming with strong negation and innexact predicates. J. of Logic and Computation, 1(6):835--861, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC