Handling partially ordered defaults in TMS

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 548 LNCS, Issue , 1991, Pages 211-218

  Junker, Ulrich ^a   Brewka, Gerd ^a  

^a FRAUNHOFER INSTITUTE FOR APPLIED INFORMATION TECHNOLOGY FIT   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957408634     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54659-6_91     Document Type: Conference Paper

References (9)

1. A.B. Baker and M.L. Ginsberg. A theorem prover for prioritized circumscription. In IJCAI-89, pages 463-467, Detroit, MI, 1989.
2. G. Brewka. Preferred subtheories: An extended logical framework for default reasoning. In IJCAI-89, pages 1043-1048, Detroit, MI, 1989.
3. C. Froidevanx and C. Grossetête. Graded default theories for uncertainty. In ECAI-90, pages 283-288, 1990.
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.
5. B. Grosof. Generalizing prioritization. In KR'91, pages 289-300, 1991.
6. U. Junker. Prioritized defaults: Implementation by TMS and application to diagnosis. In IJCAI-91, Sydney, Australia, 1991.
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.
8. K. Konolige. Hierarchic autoepistemic theories for nonmonotonic reasoning. In AAAI-88, pages 439-443, Minneapolis, MN, 1988.
9. V. Lifschitz. Computing circumscription. In IJGAI-85, pages 121-127, 1985.