The Complexity of Path-Based Defeasible Inheritance. Selman, B. & Levesque, H. J. Artif. Intell., 62(2):303–339, 1993.
The Complexity of Path-Based Defeasible Inheritance [link]Paper  doi  bibtex   
@article{DBLP:journals/ai/SelmanL93,
  author    = {Bart Selman and
               Hector J. Levesque},
  title     = {The Complexity of Path-Based Defeasible Inheritance},
  journal   = {Artif. Intell.},
  volume    = {62},
  number    = {2},
  pages     = {303--339},
  year      = {1993},
  url       = {https://doi.org/10.1016/0004-3702(93)90081-L},
  doi       = {10.1016/0004-3702(93)90081-L},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ai/SelmanL93},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0