Abducing priorities to derive intended conclusions

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1999, Pages 44-49

  Inoue, Katsumi ^a   Sakama, Chiaki ^b  

^a KOBE UNIVERSITY   (Japan)

^b WAKAYAMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ABDUCTIVE LOGIC PROGRAMMING; ANSWER SET SEMANTICS; EXTENDED LOGIC; LEGAL REASONING; NON-MONOTONIC REASONING; PREFERENCE ABDUCTION; PREFERENCE INFORMATION; VIEW UPDATE;

LOGIC PROGRAMMING; SEMANTICS;

ARTIFICIAL INTELLIGENCE;

EID: 0038474558     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. F. Baader and B. Hollunder. Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic. J. Automated Reasoning, 15(1):41-68,1995.
2. G. Brewka. Reasoning about priorities in default logic. In: Proc. AAAI-94, pages 940-945.
3. G. Brewka and T. Eiter. Preferred answer sets for extended logic programs. In: Proc. KR '98, pages 86-97, 1998.
4. Y. Dimopoulos and A. C. Kakas. Logic programming without negation as failure. In: Proc. InVl Logic Programming Symp. '95, pages 369-383, 1995,
5. T. Eiter and G. Gottlob. The complexity of logic-based abduction. J. ACM, 42(I):3-42, 1995.
6. M. Geifond and V. Lifschitz. Compiling circumscriptive theories into logic programs. In: Proc. AAAI-68, pages 455-459,1988.
7. M. Gelfond and V. Lifechitz. Logic programs with classical negation. In: Proc. 7th InVI Conf. on Logic Programming, pages 579-597, 1990.
8. S. Hanks and D. McDermott. Nonmonotonic logic and temporal projection. Artificial Intelligence, 33:379-412, 1987.
9. K. Inoue. Hypothetical reasoning in logic programs. J. Logic Programming, 18(3):191-227,1994.
10. K. Inoue and H. Haneda. Learning abductive and nonmonotonic logic programs. In: P. Flach and A. Kakas, editors. Abductive and Inductive Reasoning - Essays on their Relation and Integration, pages 241-262, Kluwer Academic, 1999.
11. K. Inoue and C. Sakama. A fixpoint characterization of abductive logic programs. J. Logic Programming, 27(2):107-136, 1996. (Pubitemid 126346928)
12. A. C. Kakas and P. Mancarella. Database updates through abduction. In: Proc. 16th InVI Conf*Very Large Databases, pages 650-661, 1990.
13. R. A. Kowalski and F. Toni. Abstract argumentation. Artificial Intelligence and Law, 4:275-296, 1996. (Pubitemid 126706890)
14. V. Lifschitz. Computing circumscription. In: Proc. IJCAI-85, pages 121-127, 1985.
15. C. Sakama and K. Inoue*Representing priorities in logic programs. In: Proc. 1996 Joint InVI Conf. and Symp. on Logic Programming, pages 82-96, 1996.
16. T. Wakaki, K. Satoh, K. Nitta and S. Sakurai. Finding priorities of circumscription policy as a skeptical explanation in abduction. J. IEICE Trans. Information and Systems, E-81D(10), 1998.
17. Y. Zhang and N. Y. Foo. Updating logic programs. In: Proc. ISih European Conf. on Artificial Intelligence, pages 403-407, 1998.