Handling partially ordered defaults in TMS

  • Ulrich Junker
  • Gerd Brewka
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 548)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A.B. Baker and M.L. Ginsberg. A theorem prover for prioritized circumscription. In IJCAI-89, pages 463–467, Detroit, MI, 1989.Google Scholar
  2. [2]
    G. Brewka. Preferred subtheories: An extended logical framework for default reasoning. In IJCAI-89, pages 1043–1048, Detroit, MI, 1989.Google Scholar
  3. [3]
    C. Froidevaux and C. Grossetête. Graded default theories for uncertainty. In ECAI-90, pages 283–288, 1990.Google Scholar
  4. [4]
    H. Geffner. Conditional entailment: Closing the gap between defaults and conditionals. In Preprints of Third International Workshop on Nonmonotonic Reasoning, South Lake Tahoe, CA, 1990.Google Scholar
  5. [5]
    B. Grosof. Generalizing prioritization. In KR'91, pages 289–300, 1991.Google Scholar
  6. [6]
    U. Junker. Prioritized defaults: Implementation by TMS and application to diagnosis. In IJCAI-91, Sydney, Australia, 1991.Google Scholar
  7. [7]
    U. Junker and K. Konolige. Computing the extensions of autoepistemic and default logics with a truth maintenance system. In AAAI-90, pages 278–283, Boston, MA, 1990.Google Scholar
  8. [8]
    K. Konolige. Hierarchic autoepistemic theories for nonmonotonic reasoning. In AAAI-88, pages 439–443, Minneapolis, MN, 1988.Google Scholar
  9. [9]
    V. Lifschitz. Computing circumscription. In IJCAI-85, pages 121–127, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Ulrich Junker
    • 1
  • Gerd Brewka
    • 1
  1. 1.GMDSt. Augustin 1Fed. Rep. of Germany

Personalised recommendations