notes-computer-ai-reasoning-inheritanceNetworks

Difference between revision 2 and current revision

No diff available.

defeasible inheritance networks are for reasoning about concept hierarchies (taxonomies) that give typical or default properties of concepts that may be overridden in exceptional cases. E.g. typically, birds can fly but ostriches are birds and they cannot fly.

see also [1].

Links

these are more of to-reads than things i've read, although i've read the Levesque and Brachman textbook (and i should re-read it sometime). This started because i liked the concept of inheritance networks in the Levesque and Brachman textbook, and the book referenced Lynn Stein's treatment of them, so i looked up one of her publications and then also looked up things that cited it in Google Scholar.

the one i actually looked up was one of the less cited ones, though; i looked up Computing skeptical inheritance, and Skeptical inheritance: Computing the intersection of credulous extensions, and A preference-based approach to inheritance. But one of the most cited ones is Resolving ambiguity in nonmonotonic inheritance hierarchies. todo, look that up:

Volume 55, Issues 2–3, June 1992, Pages 259–310 Cover image Resolving ambiguity in nonmonotonic inheritance hierarchies

    Lynn Andrea SteinCorresponding author contact information, E-mail the corresponding author
    Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA 02139, USA

See also

See also non-monotonic logic, defeasible reasoning, preferential reasoning, paraconsistent logic, belief revision.

related links: