Computational complexity of terminological reasoning in BACK

Artificial Intelligence 34 (3):371-383 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(88)90066-5

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,100

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On the computational complexity of assumption-based argumentation for default reasoning.Yannis Dimopoulos, Bernhard Nebel & Francesca Toni - 2002 - Artificial Intelligence 141 (1-2):57-78.
Terminological reasoning is inherently intractable.Bernhard Nebel - 1990 - Artificial Intelligence 43 (2):235-249.
Tractability and the computational mind.Rineke Verbrugge & Jakub Szymanik - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. Routledge. pp. 339-353.
On Qualitative Route Descriptions: Representation, Agent Models, and Computational Complexity.Matthias Westphal, Stefan Wölfl, Bernhard Nebel & Jochen Renz - 2015 - Journal of Philosophical Logic 44 (2):177-201.
Complexity and postmodernism: understanding complex systems.Paul Cilliers - 1998 - New York: Routledge.
Computation models for parameterized complexity.Marco Cesati & Miriam Dilanni - 1997 - Mathematical Logic Quarterly 43 (2):179-202.
Computational Dialogic Defeasible Reasoning.Robert L. Causey - 2003 - Argumentation 17 (4):421-450.
On the computational complexity of temporal projection, planning, and plan validation.Bernhard Nebel & Christer Bäckström - 1994 - Artificial Intelligence 66 (1):125-160.
The Computational Complexity of Quantified Reciprocals.Jakub Szymanik - 2009 - In Peter Bosch, David Gabelaia & Jérôme Lang (eds.), Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. Springer.
Exploring the tractability border in epistemic tasks.Cédric Dégremont, Lena Kurzen & Jakub Szymanik - 2014 - Synthese 191 (3):371-408.
A sound and complete tableau calculus for reasoning about only knowing and knowing at most.Riccardo Rosati - 2001 - Studia Logica 69 (1):171-191.
Computational model theory: an overview.M. Vardi - 1998 - Logic Journal of the IGPL 6 (4):601-624.
On Algorithmic Properties of Propositional Inconsistency-Adaptive Logics.Sergei P. Odintsov & Stanislav O. Speranski - 2012 - Logic and Logical Philosophy 21 (3):209-228.
Computational complexity and Godel's incompleteness theorem.Gregory J. Chaitin - 1970 - [Rio de Janeiro,: Centro Técnico Científico, Pontifícia Universidade Católica do Rio de Janeiro. Edited by Gregory J. Chaitin.
Logic and Computational Complexity International Workshop Lcc '94, Indianapolis, in, Usa, October 13-16, 1994 : Selected Papers'.Daniel Leivant - 1995 - Springer Verlag.

Analytics

Added to PP
2020-12-22

Downloads
5 (#1,542,736)

6 months
2 (#1,203,099)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Terminological reasoning is inherently intractable.Bernhard Nebel - 1990 - Artificial Intelligence 43 (2):235-249.

View all 9 citations / Add more citations

References found in this work

Making believers out of computers.Hector J. Levesque - 1986 - Artificial Intelligence 30 (1):81-108.

Add more references