Belief, Provability, and Logic Programs

@article{Alferes1995BeliefPA,
  title={Belief, Provability, and Logic Programs},
  author={Jos{\'e} J{\'u}lio Alferes and Lu{\'i}s Moniz Pereira},
  journal={J. Appl. Non Class. Logics},
  year={1995},
  volume={5},
  pages={31-50}
}
The main goal of this paper is to establish a nonmonotonic epistemic logic eB with two modalities — provability and belief — capable of expressing and comparing a variety of known semantics for extended logic programs, and clarify their meaning. In particular we present here, for the first time, embeddings into epistemic logic of logic programs extended with a second kind of negation under the well-founded semantics, and contrast them to the recent embeddings into autoepistemic logics of such… 
2 Citations
Reasoning with Logic Programming
TLDR
WFSX is a new semantics for extended logic programs that combines LP semantics with two negations, and autoepistemic logics to deal with contradiction.
Default Negated Conclusions: Why Not?
TLDR
This work addresses the issue of the syntactical assymetry of logic programs: can one allow default negated literals in the heads, and explores this issue for IMEX semantics.

References

SHOWING 1-10 OF 53 REFERENCES
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
Minimal Belief and Negation as Failure
Autoepistemic Logics as a Unifying Framework for the Semantics of Logic Programs
  • P. Bonatti
  • Computer Science, Philosophy
    J. Log. Program.
  • 1995
Nonmonotonic Reasoning with Well Founded Semantics.
TLDR
The purpose is to exhibit a modular systematic method of representing nonmonotonic problems with the Well Founded semantics of logic programs and use this method to represent and solve some classical nonmonotsonic problems.
Well Founded Semantics for Logic Programs with Explicit Negation
Semantics of logic programs with explicit negation
TLDR
WFSX (Well–Founded Semantics with eXplicit negation), a new semantics for logic programs with explicit negation, which compares favourably in its properties with other extant semantics, and a generic characterization schema that facilitates comparisons among a diversity of semantics of extended logic programs, including WFSX.
On Logic Program Semantics with Two Kinds of Negation
TLDR
The goal of this paper is to contrast a variety of these semantics in what concerns their use and meaning of :-negation, and its relation to classical negation and to the default negation of normal programs, here denoted by not.
Extended Logic Programs as Autoepistemic Theories
TLDR
This paper shows that programs with classical negation can be, in fact, easily represented by autoepistemic theories, and proves that an even simpler embedding is possible if reeexive autoepstemic logic is used.
Reflexive autoepistemic logic and logic programming
In this paper we show that reflexive autoepistemic logic of Schwarz is a particularly convenient modal formalism for studying properties of answer sets for logic programs with classical negation and
Optative Reasoning with Scenario Semantics
TLDR
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.
...
...