On the relationship between defeasible logic and well-founded semantics

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

Volumn 2173 LNAI, Issue , 2001, Pages 121-132

  Brewka, Gerhard ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DEFEASIBLE LOGIC; EXTENDED LOGIC; WELL FOUNDED SEMANTICS;

LOGIC PROGRAMMING; PROGRAM TRANSLATORS;

SEMANTICS;

EID: 33750037483     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45402-0_9     Document Type: Conference Paper

References (17)

1. Antoniou, G., Billington, D., Governatori, G., Maher, M. J., A Flexible Framework for Defeasible Logics, Proc. 17th American National Conference on Artificial Intelligence, AAAI-2000, 405-410
2. Antoniou, G., Billington, D., Governatori, G., Maher, M. J., Representation Results for Defeasible Logics, ACM Transactions on Computational Logic, in print 121,
3. Antoniou, G., Billington, D., Governatori, G., Maher, M. J., Rock, A., A Family of Defeasible Reasoning Logics and its Implementation, Proc. European Conference on Artificial Intelligence ECAI-2000, 459-463
4. Baral, C., Gelfond, M., Logic Programming and Knowledge Representation, Journal of Logic Programming, 19, 20:73-148, 1994
5. Baral, C., Subrahmanian, V. S., Duality between Alternative Semantics of Logic Programs and Nonmonotonic Formalisms, Intl. Workshop on Logic Programming and Nonmonotonic Reasoning, 1991
6. Brewka, G., Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences. Journal of Artificial Intelligence Research, 4:19-36, 1996
7. Brewka, G., Eiter, T., Preferred Answer Sets for Extended Logic Programs. Artificial Intelligence 109, 297-356, 1999
8. Gelfond, M., Lifschitz, V., Logic Programs with Classical Negation, Proc. 7th Intl. Conference on Logic Programming, 1990
9. van Gelder, A., Ross, K., Schlipf, J., The Well-Founded Semantics for General Logic Programs, Journal of ACM, 221-230, 1990
10. Lifschitz, V., Foundations of Declarative Logic Programming, in: G. Brewka (ed.), Principles of Knowledge Representation, Studies in Logic, Language and Information, CSLI publications, 1996
11. McCarthy, J., Circumscription - A Form of Nonmonotonic Reasoning, Artificial Intelligence 13, 1980
12. Maher, M. J., Rock, A., Antoniou, G., Billington, D., Miller, T., Efficient Defeasible Reasoning Systems, Proc. 12th IEEE International Conference on Tools with Artificial Intelligence, ICTAI-2000, 384-392
13. Nute, D., Defeasible Reasoning, in Proc. 20th Hawaii International Conference on on Systems Science, IEEE Press, 1987, 470-477
14. Nute, D., Defeasible Logic, in D. M. Gabbay, C. J. Hogger, J. A. Robinson (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3, Oxford University Press, 1994, 353-395
15. Przymusinski, T., The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics, Fundamenta Informaticae, 1989
16. Przymusinski, T., Stable Semantics for Disjunctive Programs, New Generation Computing, 9:401-424, 1991
17. Reiter, R., A Logic for Default Reasoning, Artificial Intelligence 13 (1980) 81-132