next up previous
Next: About this document Up: Well-Founded Semantics for Extended Previous: References

References

1
Baral, C., Gelfond, M., Logic Programming and Knowledge Representation, Journal of Logic Programming, 19,20:73-148, 1994

2
Baral, C., Subrahmanian, V.S., Duality between Alternative Semantics of Logic Programs and Nonmonotonic Formalisms, Intl. Workshop on Logic Programming and Nonmonotonic Reasoning, 1991

3
Brewka, Gerhard, Adding Priorities and Specificity to Default Logic, Proc. JELIA-94, York, 1994

4
Brewka, Gerhard, Reasoning About Priorities in Default Logic, Proc. AAAI-94, Seattle, 1994

5
Buccafurri, F., Leone, N., Rullo, P., Stable Models and their Computation for Logic Programming with Inheritance and True Negation, Journal of Logic Programming, to appear, 1995

6
Dowling, W., Gallier, J., Linear Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae, Journal of Logic Programming 3 (1984), 267-284

7
van Gelder, A., Ross, K., Schlipf, J., The Well-Founded Semantics for General Logic Programs, Journal of ACM, p.221-230, 1990

8
Gelfond, M., Lifschitz, V., Logic Programs with Classical Negation, Proc. 7th Intl. Conference on Logic Programming, 1990

9
Gordon, Thomas F., The Pleadings Game: An Artificial Intelligence Model of Procedural Justice, Dissertation, TU Darmstadt, 1993

10
Konolige, K., Hierarchic Autoepistemic Theories for Nonmonotonic Reasoning, Proc. AAAI, 1988

11
Kowalski, R.A., Sadri, F., Logic Programs with Exceptions, New Generation Computing, 9 (1991), 387-400

12
Lifschitz, V., Computing Circumscription, Proc. 9th Int. Joint Conference on Artificial Intelligence, 1985

13
Lifschitz, V., Foundations of Declarative Logic Programming, in: G. Brewka (ed.), Principles of Knowledge Representation, Studies in Logic, Language and Information, CSLI publishers, to appear 1996

International Conference on Principles of Knowledge Representation and Reasoning, 1991

14
Pereira, L.M., Alferes, J.J., Well Founded Semantics for Logic Programs with Explicit Negation, Proc. 10th European Conference on Artificial Intelligence, Vienna, 1992

15
Poole, David, On the Comparison of Theories: Preferring the Most Specific Explanation, Proc. IJCAI-85, Los Angeles, 1985

16
Prakken, Henry, Logical Tools for Modelling Legal Argument, dissertation, VU Amsterdam, 1993

17
Prakken, Henry, Sartor, Giovanni, On the Relation Between Legal Language and Legal Argument: Assumptions, Applicability and Dynamic Priorities, International Conference in AI and Law, Washington, 1995

18
Przymusinski, T., The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics, Fundamenta Informaticae, 1989

19
Przymusinski, T., Stable Semantics for Disjunctive Programs, New Generation Computing, 9:401-424, 1991

20
Reiter, Raymond, A Logic for Default Reasoning, Artificial Intelligence 13 (1980) 81-132.

21
Tarski, Alfred, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, 5:285-309, 1955

22
Touretzky, David S., The Mathematics of Inheritance, Pitman Research Notes in Artificial Intelligence, London, 1986

23
Touretzky, David S., Thomason, Richmond H., Horty, John F., A Skeptic's Menagerie: Conflictors, Preemptors, Reinstaters, and Zombies in Nonmonotonic Inheritance, Proc. 12th IJCAI, Sydney, 1991

24
C. Witteveen, Partial Semantics for Truth Maintenance, in: J. van Eijck (ed), Logics in AI, Springer, Heidelberg, LNAI 478, 1991, pp. 544-561



Gerd Brewka
Thu Feb 8 10:26:15 MET 1996