Academic
Publications
On Logic Program Semantics with Two Kinds of Negation

On Logic Program Semantics with Two Kinds of Negation,José Júlio Alferes,Luís Moniz Pereira

On Logic Program Semantics with Two Kinds of Negation   (Citations: 54)
BibTex | RIS | RefWorks Download
Recently several authors have stressed and showed the importance of havinga second kind of negation in logic programs for use in deductive databases,knowledge representation, and nonmonotonic reasoning [6, 7, 8, 9, 13, 14,15, 24].Different semantics for logic programs extended with :-negation (extendedlogic programs) have appeared [1, 4, 6, 9, 11, 12, 17, 19, 24] but,contrary to what happens with semantics for normal logic programs, thereis no general comparison among them, specially in ...
Cumulative Annual
    • ...(Alferes & Pereira 1992; Arieli 2002; Gelfond & Lifschitz 1991)); (ii) it covers many-valued logic programming with non-monotone negation (e.g...

    Umberto Straccia. Query Answering under the Any-World Assumption for Normal Logic Progra...

    • ...In view of these facts, Alferes and Pereira [25,14] presented a new version of the well founded model semantics, called WFSX, such that the coherence principle (see section 2) is enforced...

    Pablo R. Fillottraniet al. Representing Defaults and Negative Information Without Negation-as-Fai...

    • ...[2]), are extremal, though important, assumptions over a large variety of possible assumptions on the truth of the atoms, whenever the truth is taken from an arbitrary truth space...
    • ...[2,3,21]). In ELP one can distinguish between...
    • ...For instance, we may state a closed world assumption on an atom A by means of H(A) = f and, thus,¬A may behave like not(A), while state an open world assumption on an atom A, simulating explicit negation, by means of H(A) = ?. Also, by using the method described in [21] (and used in [2] as well) to remove expressions of the form¬A in ELPs, we may “translated” an ELP into our framework...
    • ...However, in this paper we are not going to investigate further the relationship between ELPs (with their various semantics [2,3,21]) and our framework, but rather want to show how to use the feature of the any world assumption in some of the application scenarios considered for ELPs...
    • ...10 We may also additionally relate ¯ A to A with some axioms, as in [2]...
    • ...A ¬A} (this is called the strong negation axiom in [2]), or add {A ¬ ¯ A} (this is called the weak negation axiom or add{(A ¬ ¯ A), ( ¯...
    • ...Our work generalizes related work such as [2,26,31,32,36]...
    • ...In [2,26] some atoms are allowed to be interpreted according to the OWA, while others are allowed to be interpreted according to the CWA and, thus, roughly the choice of the default is restricted to the value unknown and/or false (additionally, [26] allows to manage default rules as well)...

    Yann Loyeret al. Any-World Assumptions in Logic Programming

    • ...Consistency is a basic property for agent’s beliefs, in the sense that it is not possible to believe simultaneously in a literal Q and its complement Q [30]...

    Marcela Capobiancoet al. Argumentation and the Dynamics of Warranted Beliefs in Changing Enviro...

    • ...Consistency is a basic property for agent’s beliefs, in the sense that it is not possible to believe simultaneously in a literal Q and its complement Q [16]...

    Marcela Capobiancoet al. An Argument-Based Framework to Model an Agent's Beliefs in a Dynamic E...

Sort by: