scientific article; zbMATH DE number 4176506

zbMATH Open0714.68094MaRDI QIDQ3200595FDOQ3200595

Authors: Hector J. Levesque, Bart Selman 

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• The complexity of path-based defeasible inheritance
• Publication:3200591
• Resolving ambiguity in nonmonotonic inheritance hierarchies
• On the semantics of inheritance networks
• A skeptical theory of inheritance in nonmonotonic semantic networks

zbMATH Keywords

NP-hardnessnon-monotonic multiple inheritance reasoning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (14)

• A theory of nonmonotonic inheritance based on annotated logic
• Locality in inheritance networks
• Title not available (Why is that?)
• Artificial nonmonotonic neural networks
• Tractable reasoning via approximation
• The complexity of path-based defeasible inheritance
• Inheritance systems with exceptions
• Resolving ambiguity in nonmonotonic inheritance hierarchies
• Netl and subsequent path-based inheritance theories
• On Stein's paper: Resolving ambiguity in nonmonotonic inheritance hierarchies
• On the equivalence of upward and downward inheritance reasoners
• Floating conclusions and zombie paths: Two deep difficulties in the ``directly skeptical approach to defeasible inheritance nets
• Model-preference default theories
• The complexity of propositional closed world reasoning and circumscription

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3200595)