article

On the decidability and complexity of autoepistemic reasoning

Author:

Ilkka N. F. NiemeläAuthors Info & Claims

Fundamenta Informaticae, Volume 17, Issue 1-2

Pages 117 - 155

Published: 01 September 1992 Publication History

Abstract

No abstract available.

Cited By

View all

Vlaeminck HVennekens JBruynooghe MDenecker M(2012)Ordered epistemic logicProceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning10.5555/3031843.3031886(369-379)Online publication date: 10-Jun-2012
https://dl.acm.org/doi/10.5555/3031843.3031886
Bruijn JEiter TPolleres ATompits H(2011)Embedding nonground logic programs into autoepistemic logic for knowledge-base combinationACM Transactions on Computational Logic10.1145/1929954.192995712:3(1-39)Online publication date: 16-May-2011
https://dl.acm.org/doi/10.1145/1929954.1929957
De Bruijn JHeymans S(2007)A semantic framework for language layering in WSMLProceedings of the 1st international conference on Web reasoning and rule systems10.5555/1768725.1768734(103-117)Online publication date: 7-Jun-2007
https://dl.acm.org/doi/10.5555/1768725.1768734
Show More Cited By

Index Terms

On the decidability and complexity of autoepistemic reasoning

Recommendations

The Complexity of Reasoning for Fragments of Autoepistemic Logic

Autoepistemic logic extends propositional logic by the modal operator L. A formula φ that is preceded by an L is said to be “believed.” The logic was introduced by Moore in 1985 for modeling an ideally rational agent’s behavior and reasoning about his ...
The complexity of theorem proving in autoepistemic logic
SAT'13: Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing

Autoepistemic logic is one of the most successful formalisms for nonmonotonic reasoning. In this paper we provide a proof-theoretic analysis of sequent calculi for credulous and sceptical reasoning in propositional autoepistemic logic, introduced by ...
Programming in autoepistemic logic

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Fundamenta Informaticae Volume 17, Issue 1-2

Special issue on modal logics in knowledge representation

Sept.– Oct. 1992

165 pages

ISSN:0169-2968

Editors:
Helena Rasiowa
Univ. of Warsaw, Warsaw, Poland
,
Mirosław Truszczyński
Univ. of Kentucky, Lexington

Issue’s Table of Contents

Publisher

IOS Press

Netherlands

Publication History

Published: 01 September 1992

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Vlaeminck HVennekens JBruynooghe MDenecker M(2012)Ordered epistemic logicProceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning10.5555/3031843.3031886(369-379)Online publication date: 10-Jun-2012
https://dl.acm.org/doi/10.5555/3031843.3031886
Bruijn JEiter TPolleres ATompits H(2011)Embedding nonground logic programs into autoepistemic logic for knowledge-base combinationACM Transactions on Computational Logic10.1145/1929954.192995712:3(1-39)Online publication date: 16-May-2011
https://dl.acm.org/doi/10.1145/1929954.1929957
De Bruijn JHeymans S(2007)A semantic framework for language layering in WSMLProceedings of the 1st international conference on Web reasoning and rule systems10.5555/1768725.1768734(103-117)Online publication date: 7-Jun-2007
https://dl.acm.org/doi/10.5555/1768725.1768734
Chapdelaine PHermann MSchnoor I(2007)Complexity of default logic on generalized conjunctive queriesProceedings of the 9th international conference on Logic programming and nonmonotonic reasoning10.5555/1758481.1758490(58-70)Online publication date: 15-May-2007
https://dl.acm.org/doi/10.5555/1758481.1758490
Eiter TKlotz VTompits HWoltran S(2002)Modal Nonmonotonic Logics RevisitedProceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods10.5555/646892.709420(100-114)Online publication date: 30-Jul-2002
https://dl.acm.org/doi/10.5555/646892.709420
Donini FNardi DRosati R(2002)Description logics of minimal knowledge and negation as failureACM Transactions on Computational Logic10.1145/505372.5053733:2(177-225)Online publication date: 1-Apr-2002
https://dl.acm.org/doi/10.1145/505372.505373
Dix JFurbach UNiemelä I(2001)Nonmonotonic reasoningHandbook of automated reasoning10.5555/778522.778528(1241-1354)Online publication date: 1-Jan-2001
https://dl.acm.org/doi/10.5555/778522.778528
Egly UTompits H(2001)Proof-complexity results for nonmonotonic reasoningACM Transactions on Computational Logic10.1145/377978.3779872:3(340-387)Online publication date: 1-Jul-2001
https://dl.acm.org/doi/10.1145/377978.377987

Abstract

Cited By

Index Terms

Recommendations

The Complexity of Reasoning for Fragments of Autoepistemic Logic

The complexity of theorem proving in autoepistemic logic

Programming in autoepistemic logic

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations