Content deleted Content added
Fixed link to Gelfond's paper "On stratified autoepistemic theories" |
m →References: Remove blank line(s) between list items per WP:LISTGAP to fix an accessibility issue for users of screen readers. Do WP:GENFIXES and cleanup if needed. Discuss this at Wikipedia talk:WikiProject Accessibility#LISTGAP |
||
Line 350:
* N. Bidoit and C. Froidevaux [1987] ''Minimalism subsumes default logic and circumscription''. In: Proceedings of LICS-87, pages 89–97.
* T. {{Not a typo|Eiter}} and G. Gottlob [1993] ''[http://www.kr.tuwien.ac.at/staff/eiter/et-archive/ilps93.ps.gz Complexity results for disjunctive logic programming and application to nonmonotonic logics]''. In: Proceedings of ILPS-93, pages 266-278.
* M. van Emden and [[Robert Kowalski|R. Kowalski]] [1976] ''[http://www.doc.ic.ac.uk/~rak/papers/kowalski-van_emden.pdf The semantics of predicate logic as a programming language]''. Journal of ACM, Vol. 23, pages 733-742.
* F. Fages [1994] ''Consistency of Clark's completion and existence of stable models''. Journal of Methods of Logic in Computer Science, Vol. 1, pages 51–60.
* P. Ferraris [2005] ''Answer sets for propositional theories''. In: Proceedings of LPNMR-05, pages 119-131.
* P. Ferraris and V. Lifschitz [2005] ''[http://www.cs.utexas.edu/users/vl/papers/mfasp.ps Mathematical foundations of answer set programming]''. In: We Will Show Them! Essays in Honour of Dov Gabbay, King's College Publications, pages 615-664.
* M. Gelfond [1987] ''[https://www.aaai.org/Papers/AAAI/1987/AAAI87-037.pdf On stratified autoepistemic theories]''. In: Proceedings of AAAI-87, pages 207-211.
* M. Gelfond and V. Lifschitz [1988] ''[http://www.cs.utexas.edu/users/vl/papers/stable.ps The stable model semantics for logic programming]''. In: Proceedings of the Fifth International Conference on Logic Programming (ICLP), pages 1070-1080.
* M. Gelfond and V. Lifschitz [1991] ''[http://www.cs.utexas.edu/users/vl/papers/clnegdd.ps Classical negation in logic programs and disjunctive databases]''. New Generation Computing, Vol. 9, pages 365-385.
* S. Hanks and [[Drew McDermott|D. McDermott]] [1987] ''Nonmonotonic logic and temporal projection''. Artificial Intelligence, Vol. 33, pages 379-412.
* F. Lin and Y. Zhao [2004] ''[http://www.cs.ust.hk/faculty/flin/papers/assat-aij-revised.pdf ASSAT: Computing answer sets of a logic program by SAT solvers]''. Artificial Intelligence, Vol. 157, pages 115-137.
* V. Marek and V.S. Subrahmanian [1989] ''The relationship between logic program semantics and non-monotonic reasoning''. In: Proceedings of ICLP-89, pages 600-617.
* D. Pearce [1997] ''A new logical characterization of stable models and answer sets''. In: Non-Monotonic Extensions of Logic Programming (Lecture Notes in Artificial Intelligence 1216), pages 57–70.
* [[Raymond Reiter|R. Reiter]] [1980] ''A logic for default reasoning''. Artificial Intelligence, Vol. 13, pages 81–132.
| |||