Giovanni Sartor
- Alexy R. 1978. Theorie der juristischen Argum~ation. Frankfurt: Suhxkamp.Google Scholar
- Allen, L.E. 1982. Towards a Normalized Language to Clarify the Structure of Legal Discourse. In Deoraic Logic, Computational Linguistics and Legal Informations Systems, edited by A.A. Martino, 349-407. Amsterdam: North Holland.Google Scholar
- Allen, L.E., and C.S. Saxon. 1989. Relationship of Expert Systems to the Operations of a Legal System, In Pre-proceeding of the III international conference on Log ica lnf ormatica D iri tto, edited by A.A. Martino, Appendix, 1-15. Fixenze: Consiglio nazionale delle ricerche.Google Scholar
- Gelfonck M., and V. Lifschitz. 1988. The stable model semantics for Logic Programm/ng. In Proceeding of the Fifth International Conference and Symposium on Logic Programming, edited by R.A. Kowalski and K.A. Bowen. Cambridge (Massachusetts): Mit Press. 1070-1080.Google Scholar
- Gelfond, M., and V. Lifschitz. 1990. Logical Programs with Classical Negation. In Proceedings of the Seventh international Logic Programming Conference. New York: Mrr Press. Google ScholarDigital Library
- Gordon, T.F. 1988. The Importance of Nonmontonicity for Legal Reasoning. In Expert Systems in Law: impacts on Legal Theory and Computer Law, edited by H. Fiedler, F. Haft, and R. Traunmaller, 111-126. Ttlbingen: Attempto.Google Scholar
- Gordon, T.F. 1987. issue Spotting in a System for Searching Interpretation Spaces. In The Second International Conference on Artificial Intelligence and Law: Proceedings of the Conference, 157-164. New York: ACM Press. Google ScholarDigital Library
- Hare R.M. 1962. Freedom and Reason. Oxford: Claredon Press.Google Scholar
- Jones, A.J., and I. P6rn, 1985, Ideality, Subideality and Deontic Logic, Synthese 275-290.Google ScholarCross Ref
- Kelsen, H. 1934. Reine Rechtslehre. Einleitung in die rechtswissenschaj~liche Problematilc. Leipzig: Franz Deuticke.Google Scholar
- Kelsen, H. 1960. Reine Rechtslehre. Wien: Franz Deuticke.Google Scholar
- Eshghi, K., and R.A. Kowalski. 1989. Abduction Compared with Negation by Failure. In Proceedings of the Sixth International Conference on Logic Programming, 234-254.Google Scholar
- Kowalski, R.A., and F. Sadri. 1990. Logic Programming with Exceptions. in Proceedings of the Seventh International Logic Programming Conference, 598-613. New York: MrI' Press. Google ScholarDigital Library
- Levesque H. 1989. All I Know: A Study in Autoepisternic Logic. KKR-TR-89-3.Google Scholar
- Moore, R.C. 1985. Semantical Considerations on Nonmonotonic Logic. Artificial Intelligence 25: 79-94. Google ScholarDigital Library
- McCaxty, L.T. 1986. Permissions and Obligations: An Informal Introduction. in Automated Analysis of Legal Texts, edited by A.A. Martino, and F. Socci Natalk 307-337. Amsterdam: North Holland.Google Scholar
- McCaxty, L.T. 1988a. Clausal Intuitionistic Logic. I. Fixed Point Semantics. Journal of Logic Programming 5(1): 1-31. Google ScholarDigital Library
- McCarty, L.T. 1988b. Clausal inmitionistic Logic. II. Tableau Proof Procedures. Journal of Logic Programming. 5(2): 93- 132. Google ScholarDigital Library
- McCaxty, L.T. 1989. A Language for Legal Discourse. I. Basic Features. In The Second International Conference on Artificial Intelligence and Law: Proceedings of the Conference, 180-189. New York: ACM Press. Google ScholarDigital Library
- McCarty, L.T., and W.W. Cohen. 1990. The Case for Explicit Exceptions. Paper presented to the Workshop on Logic Programming and Nonmonotonic Reasoning, NACLP 90, Austin ('Fexa~).Google Scholar
- Poole, D., 1988. A Logical Framework for Default Reasoning. Artificial intelligence 36: 27-47. Google ScholarDigital Library
- Reiter, R. 1980. A Logic for Default Reasoning. Artificial Intelligence 13: 81-132.Google ScholarDigital Library
- Reiter, R., and G. Criscuolo. {1981} 1987. On interacting defaults. In Readings in Nonmonotonic Reasoning, edited by M.L. Ginsberg, 94-I00. Los Altos (California): Morgan Kaufmann. Published in Proceedings of the Seventh International Joint Conference on Artificial Intelligence. IJCAI 1981, 270-276. Vancouver Google ScholarDigital Library
- Routen, T. 1989. Hierarchically Organised Formalisations. In The Second International Conference on Artificial Intelligence and Law. Proceedings of the Conference, 242-250. New York: ACM. Google ScholarDigital Library
- Sacco, R. 1957. Presunzione, natura costitutiva od impeditiva det fatto, onere della prova (aspetti diversi di un fenomeno unico o fenomem autonomi). Rivista di diritto civile 3: 399-423.Google Scholar
- Sergot, M.J. 1983. A Query-the-User Facility for Logic Programming. In Integrated Interactive Computer Systems, edited by P. Degano, and E. Sandewall, 2741. Amsterdam: North Holland.Google Scholar
- Sergot, M.J., and Y.A. Cosmadopoulos, 1991. The Logic Programming System Sidlagi: Design and Implementation, Technical Retx~ London: Imperial College.Google Scholar
- Sergot, M.J., F. Sadri, R.A. Kowalski, F. Kriwaczek, P. Hammond, and H.T. Cory. 1986. The British Nationality Act as a Logic Program. Communications of the ACM 29: 370-386. Google ScholarDigital Library
Index Terms
- The structure of norm conditions and nonmonotonic reasoning in law
Recommendations
Towards First-Order Nonmonotonic Reasoning
LPNMR '99: Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic ReasoningWe investigate the problem of reasoning in nonmonotonic extensions of first-order logic. In particular, we study reasoning in first-order MKNF, the modal logic of minimal knowledge and negation as failure introduced by Lifschitz. MKNF can be considered ...
‘Classical’ Negation in Nonmonotonic Reasoning and Logic Programming
Gelfond and Lifschitz were the first to point out the need for a symmetric negation in logic programming and they also proposed a specific semantics for such negation for logic programs with the stable semantics, which they called ‘classical’. Subsequently,...
Comments