The complexity of path-based defeasible inheritance

Artificial Intelligence 62 (2):303-339 (1993)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,296

External links

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

Through your library

Similar books and articles

Defeasible inheritance on cyclic networks.Gian Aldo Antonelli - 1997 - Artificial Intelligence 92 (1-2):1-23.
Inheritance theory and path-based reasoning: An introduction.Bob Carpenter & Richmond Thomason - 1990 - In Kyburg Henry E. , Loui Ronald P. & Carlson Greg N. (eds.), Knowledge Representation and Defeasible Reasoning. Kluwer Academic Publishers. pp. 309--343.
Assumption-based argumentation for closed and consistent defeasible reasoning.Francesca Toni - 2008 - In Takashi Washio, Ken Satoh, Hideaki Takeda & Akihiro Inokuchi (eds.), New Frontiers in Artificial Intelligence. Springer. pp. 390--402.

Analytics

Added to PP
2020-12-22

Downloads
10 (#1,222,590)

6 months
9 (#355,374)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Hard problems for simple default logics.Henry A. Kautz & Bart Selman - 1991 - Artificial Intelligence 49 (1-3):243-279.

Add more references