# Separating Disbeliefs from Beliefs in Autoepistemic Reasoning

@inproceedings{Janhunen1997SeparatingDF, title={Separating Disbeliefs from Beliefs in Autoepistemic Reasoning}, author={Tomi Janhunen}, booktitle={LPNMR}, year={1997} }

This paper investigates separated autoepistemic logic which is a generalization of Moore's autoepistemic logic with separate modalities for belief and disbelief. Along the separation of beliefs and disbeliefs, the relationship between autoepistemic logic and default logic becomes very intuitive. Straightforward ways of translating default theories into separated autoepistemic theories and back are presented. These translations are shown to preserve a variety of semantics of default theories…

## 5 Citations

On the Intertranslatability of Autoepistemic, Default and Priority Logics, and Parallel Circumscription

- Philosophy, Computer ScienceJELIA
- 1998

This paper concentrates on comparing the relative expressive power of five non-monotonic logics that have appeared in the literature, and adopts Gottlob's framework for the analysis, but proposes a weaker notion of faithfulness.

On the intertranslatability of non‐monotonic logics

- PhilosophyAnnals of Mathematics and Artificial Intelligence
- 2004

The classes of EPH indicate some astonishing relationships in light of earlier results on the expressive power of non‐monotonic logics presented by Gottlob as well as Bonatti and Eiter: Moore’s autoepistemic logic and prerequisite‐free default logic are of equal expressive power and less expressive than Reiter's default logic and Marek and Truszczyński's strong autoepistsic logic.

Classifying Semi-Normal Default Logic on the Basis of its Expressive Power

- PhilosophyLPNMR
- 1999

An overview of the current expressive power hierarchy (EPH) is given and seminormal default logic as well as prerequisite-free and semi-normal default logic are investigated in order to locate their exact positions in the hierarchy.

Capturing Stationary and Regular Extensions with Reiter's Extensions

- Computer ScienceJELIA
- 2000

The aim is to capture Przymusinska and Przcyusinski's stationary extensions with Reiter's extensions using the same translational idea, which leads to a polynomial, faithful and modular (PFM) translation function.

Evaluating the effect of semi-normality on the expressiveness of defaults

- MathematicsArtif. Intell.
- 2003

## References

SHOWING 1-10 OF 37 REFERENCES

Representing Autoepistemic Introspection in Terms of Default Rules

- PhilosophyECAI
- 1996

This paper shows how autoepis-temic theories can be faithfully translated into default theories and indicates together with the previous research results that au-toepistemic logic and default logic are of equal generality.

Autoepistemic Logics of Closed Beliefs and Logic Programming

- Philosophy, Computer ScienceLPNMR
- 1991

AEL circ represents a new and attractive autoepistemic logic which eliminates the drawbacks of the original Moore's AEL and is substantiated in the class of logic programs the Autoepis-temic Logic of Closed Beliefs AEL circ, in which the negative introspection operator j = circ is based on McCarthy's circumscription CIRC.

Towards Automatic Autoepistemic Reasoning

- Computer ScienceJELIA
- 1990

First-order autoepistemic logic is studied where quantifying into a modal context is not allowed and preliminary results on decidability and complexity of autoepisemic reasoning are obtained, it is shown that autoepistsemic reasoning is decidable iff the underlying monotonic consequence relation is dec formidable.

Autoepistemic logic

- Computer ScienceJACM
- 1991

It is proven that the problem of existence of stable models is NP-complete and the definition of stratified theories is extended and efficient algorithms for testing whether atheory is stratified are proposed.

Three-valued nonmonotonic formalisms and semantics of logic programs

- Computer Science
- 1992

We introduce three-rained extensions of major nonmonotonic formalisms and we prove that the recently proposed well-founded semantics of logic programs is equivalent, for arbitrary logic programs, to…

A Logic of Knowledge and Justified Assumptions

- Philosophy, Computer ScienceArtif. Intell.
- 1992

Autoepistemic Logics as a Unifying Framework for the Semantics of Logic Programs

- Computer Science, PhilosophyJ. Log. Program.
- 1995

Modal nonmonotonic logics: ranges, characterization, computation

- Philosophy, Computer ScienceJACM
- 1993

Many nonmonotonic formalism, including default logic, logic programming with stable models, and autoepistemic logic, can be represented faithfully by means of modal nonmonotonic logics in the family…

Nonmonotonic Logic II: Nonmonotonic Modal Theories

- Computer ScienceJACM
- 1982

The operator M (usually read "possible") is extended so that Mp is true whenever p is consistent with the theory, and any theorem of this form may be mvahdated if ~p ~s is added as an axiom.

Towards a Theory of Declarative Knowledge

- Computer ScienceFoundations of Deductive Databases and Logic Programming.
- 1988