The complexity of path-based defeasible inheritance

DOI10.1016/0004-3702(93)90081-LzbMath0779.68080OpenAlexW2051000181MaRDI QIDQ685542

Hector J. Levesque, Bart Selman

Publication date: 19 January 1994

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(93)90081-l

zbMATH Keywords

NP-hardInheritancenon-monotone logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (5)

On Stein's paper: Resolving ambiguity in nonmonotonic inheritance hierarchies ⋮ Dynamic reasoning with qualified syllogisms ⋮ Graded inheritance nets for knowledge representation ⋮ An argument-based approach to reasoning with specificity ⋮ Inheritance comes of age: applying nonmonotonic techniques to problems in industry

Cites Work

• Some representational issues in default reasoning
• On finding a minimum dominating set in a tournament
• Hard problems for simple default logics
• A skeptical theory of inheritance in nonmonotonic semantic networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of path-based defeasible inheritance