Next: About this document ...
Up: plp A compiler for
Previous: Future gimmicks
- 1
-
F. Baader and B. Hollunder.
How to prefer more specific defaults in terminological default logic.
In Proceedings of the International Joint Conference on
Artificial Intelligence, pages 669-674, 1993.
- 2
-
G. Brewka and T. Eiter.
Preferred answer sets for extended logic programs.
Artificial Intelligence, 109(1-2):297-356, 1999.
- 3
-
J. Delgrande and T. Schaub.
Reasoning with sets of preferences in default logic.
In H.-Y. Lee and H. Motoda, editors, Pacific Rim International
Conference on Artificial Intelligence, volume 1531 of Lecture Notes in
Artificial Intelligence, pages 134-145. Springer Verlag, 1998.
- 4
-
J. Delgrande, T. Schaub, and H. Tompits.
Logic programs with compiled preferences.
In C. Baral and M. Truszczynski, editors, Proceedings of the
Eighth International Workshop on Non-Monotonic Reasoning. arXiv.org
e-Print archive, 2000.
- 5
-
M. Gelfond and V. Lifschitz.
The stable model semantics for logic programming.
In Proceedings of the International Conference on Logic
Programming, pages 1070-1080. MIT Press, 1988.
- 6
-
M. Gelfond and V. Lifschitz.
Classical negation in logic programs and deductive databases.
New Generation Computing, 9:365-385, 1991.
- 7
-
M. Gelfond and T. Son.
Reasoning with prioritized defaults.
In J. Dix, L. Pereira, and T. Przymusinski, editors, Third
International Workshop on Logic Programming and Knowledge Representation,
volume 1471 of Lecture Notes in Computer Science, pages 164-223.
Springer Verlag, 1997.
- 8
-
T. Gordon.
The pleading game: An Artificial Intelligence Model of
Procedural Justice.
Dissertation, Technische Hochschule Darmstadt, Alexanderstraße
10, D-64283 Darmstadt, Germany, 1993.
- 9
-
U. Junker.
A cumulative model semantics for dynamic preferences on assumptions.
In M. Pollack, editor, Proceedings of the International Joint
Conference on Artificial Intelligence, pages 162-167. Morgan Kaufmann
Publishers, 1997.
- 10
-
K. Wang, L. Zhou, and F. Lin.
Alternating fixpoint theory for logic programs with priority.
In Proceedings of the First International Conference on
Computational Logic. Springer Verlag, 2000.
Torsten Schaub
2000-12-05