Iterative Belief Revision in Extended Logic Programming

@article{You1996IterativeBR,
  title={Iterative Belief Revision in Extended Logic Programming},
  author={Jia-Huai You and Robert Cartwright and Ming Li},
  journal={Theor. Comput. Sci.},
  year={1996},
  volume={170},
  pages={383-406}
}
View via Publisher
doi.org
11 Citations
Background Citations
5
Methods Citations
1
Results Citations
1

11 Citations

TRANSACTION ON KNOWLEDGE AND DATA ENGINEERING 1 Coherence Approach to Logic Program

This work deene the skeptical and credulous coherence semantics and shows that both semantics can be characterized in terms of the xpoint semantics of a revised program using a simple program revision technique.

Regular Extension Semantics and Disjunctive Eshghi Kowalski Procedure

It is reported that a variant of the procedure speciied by Dung computes the regular extension semantics of the Eshghi-Kowalski procedure.

Logic programs with stable model semantics as a constraint programming paradigm

    I. Niemelä
    Computer Science
    Annals of Mathematics and Artificial Intelligence
  • 2004
It is shown that the novel paradigm embeds classical logical satisfiability and standard (finite domain) constraint satisfaction problems but seems to provide a more expressive framework from a knowledge representation point of view.

An abductive approach to disjunctive logic programming

Two-Literal Logic Programs and Satisfiability Representation of Stable Models: A Comparison

It is shown that a 2-literal program can be translated to a SAT instance in polynomial time without using extra variables and reported and compared experimental results on solving a number of benchmarks by a stable model generator and by a SAT solver.

An Abductive Semantics for Disjunctive Logic Programs and Its Proof Procedure

An abductive semantics for disjunctive logic programs with default negation is proposed and it is shown that Eshghi and Kowalski's abductive proof procedure for normal programs can be adopted to compute abductive solutions for dis junctive programs.

On Updates of Logic Programs: A Properties-Based Approach

This work continues the analysis about the AGM postulates with respect to operator ⊕ under the refinated view that includes knowledge and beliefs that began in a recent previous paper and that satisfies the WIS property for closed programs under tautologies.

ASSAT: computing answer sets of a logic program by SAT solvers

Knowledge Representation and Non-monotonic Reasoning

Logic programming has been deployed to support nonmonotonic reasoning since the late '80s. In this paper, we review semantics, formalisms and computational mechanisms for logic programming for…

Ìàáë Áë Èêê¹èêáaeì Çç Ìàà Èèèê Ìààì Èèèèêêê Áae º Äççáá Èêççêêååáaeaé½¹¿µ ½¼½¹½¾¾¸¾¼¼¼

31 References

An Argumentation-Theoretic Foundations for Logic Programming

Non-Monotonic Reasoning with Logic Programming

Well Founded Semantics for Logic Programs with Explicit Negation

Scenario Semantics of Extended Logic Programs

We present a coherent, exible, unifying, and intuitive framework for the study of explicit negation in logic programs, based on the notion of admissible scenaria and the "coherence principle". With…

On the Equivalence of Semantics for Normal Logic Programs

Optative Reasoning with Scenario Semantics

This work introduces into the scenario semantics paradigm a general exible notion of optative acceptance of acceptable hypotheses, and proceeds to illustrate its application to fault diagnosis, taxonomic reasoning, and declarative logic program debugging.

Paraconsistent Logic Programming

A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties

    J. Dix
    Computer Science
    Fundam. Informaticae
  • 1995
This article presents a method for classifying and characterizing the various different semantics of logic programs with negation and shows that the 3-valued version COMP 3 of Clark's completion, the stratified semantics M supp P as well as the well-founded semantics WFS and two extensions of it behave very regular.

An Assumption-Based Framework for Non-Monotonic Reasoning

The paper investigates applications of the framework to logic programming , abductive logic programming, logic programs extended with \classi-cal" negation, default logic, autoepistemic logic, and non-monotonic modal logic.

The well-founded semantics for general logic programs

It is shown that the class of programs possessing a total well-founded model properly includes previously studied classes of "stratified" and "locally stratified" programs, and is compared with other proposals in the literature.