Embedding defeasible logic into logic programming

Theory and Practice of Logic Programming

Volumn 6, Issue 6, 2006, Pages 703-735

  Antoniou, Grigoris ^a   Billington, David ^b   Governatori, Guido ^c   Maher, Michael J ^d  

^a INSTITUTE OF COMPUTER SCIENCE   (Greece)

^b GRIFFITH UNIVERSITY   (Australia)

^c UNIVERSITY OF QUEENSLAND   (Australia)

^d CSIRO   (Australia)

Author keywords

Defeasible logic; Kunen semantics; Non monotonic logic; Stable semantics

Indexed keywords

FORMAL LOGIC; MATHEMATICAL MODELS; SEMANTICS;

DEFEASIBLE LOGIC; KUNEN SEMANTICS; NON-MONOTONIC LOGIC; STABLE SEMANTICS;

LOGIC PROGRAMMING;

EID: 33750335026     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068406002778     Document Type: Article

References (39)

1. ALFERES, J. J. AND PEREIRA, L. M. 1993a. Contradiction: When avoidance equals removal - Part I. In Proc. 4th International Workshop on Extensions of Logic Programming, R. Dyckhoff, Ed. LNCS, vol. 798. Springer, Berlin, 11-23.
2. ALFERES, J. J. AND PEREIRA, L. M. 1993b. Contradiction: When avoidance equals removal - Part II. In Proc. 4th International Workshop on Extensions of Logic Programming, R. Dyckhoff, Ed. LNCS, vol. 798. Springer, Berlin, 268-281.
3. ANTONIOU, G. 1997.Nonmonotonic Reasoning. MIT Press, Cambridge, MA.
4. ANTONIOU, G. 2002. Nonmonotonic rule system on top of ontology layer. In ISWC 2002, I. Horrocks and J. Hendler, Eds. LNCS, vol. 2432. Springer, Berlin, 394-398.
5. ANTONIOU, G., BILLINGTON, D., GOVERNATORI, G. AND MAHER, M. J. 2000. A flexible framework for defeasible logics. In Proc. American National Conference on Artificial Intelligence (AAAI-2000). AAAI/MIT Press, Menlo Park, CA, 401-405.
6. ANTONIOU, G., BILLINGTON, D., GOVERNATORI, G. AND MAHER, M. J. 2001. Representation results for defeasible logic. ACM Transactions on Computational Logic 2, 2, 255-287.
7. ANTONIOU, G., BILLINGTON, D., AND MAHER, M. J. 1999. On the analysis of regulations using defeasible rules. In Proc. 32nd Hawaii International Conference on Systems Science. IEEE Press.
8. ANTONIOU, G. AND MAHER, M. J. 2002. Embedding defeasible logic into logic programs. In Proc. International Conference on Logic Programming 2002, P. Stuckey, Ed. LNCS, vol. 2401. Springer, Berlin, 393-404.
9. ANTONIOU, G., MAHER, M. J. AND BILLINGTON, D. 2000. Defeasible logic versus logic programming without negation as failure. Journal of Logic Programming 41, 1, 45-57.
10. BASSILIADES, N., ANTONIOU, G. AND VLAHAVAS, I. 2004. DR-DEVICE: A defeasible logic system for the Semantic Web. In 2nd Workshop on Principles and Practice of Semantic Web Reasoning, H. J. Ohlbach and S. Schaffen, Eds. LNCS, vol. 3208. Springer, Berlin, 134-148.
11. BILLINGTON, D. 1993. Defeasible logic is stable. Journal of Logic and Computation 3, 370-400.
12. BILLINGTON, D., DE COSTER, K. AND NUTE, D. 1990. A modular translation from defeasible nets to defeasible logic. Journal of Experimental and Theoretical Artificial Intelligence 2, 151-177.
13. GELDER, A. V., ROSS, K. A. AND SCHLIPF, J. S. 1991. The well-founded semantics for general logic programs. Journal of the ACM 38, 3, 620-650.
14. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In Proc. 5th International Conference and Symposium on Logic Programming. MIT Press, Cambridge, MA, 1070-1080.
15. GOVERNATORI, G. 2005. Representing business contracts in RuleML. International Journal of Cooperative Information Systems 14, 2-3, 181-216.
16. GOVERNATORI, G., DUMAS, M., TER HOFSTEDE, A. H. AND OAKS, P. 2001. A formal approach to protocols and strategies for (legal) negotiation. In Proc. 8th International Conference on Artificial Intelligence and Law (ICAIL01). ACM Press, 168-177.
17. GOVERNATORI, G., MAHER, M. J., BILLINGTON, D. AND ANTONIOU, G. 2004. Argumentation semantics for defeasible logics. Journal of Logic and Computation 14, 5, 675-702.
18. GOVERNATORI, G. AND PADMANABHAN, V. 2003. A defeasible logic of policy-based intention. In AI 2003: Advances in Artificial Intelligence, T. D. Gedeon and L. C. C. Fung, Eds. LNAI, vol. 2903. Springer, Berlin, 414-426.
19. GOVERNATORI, G. AND ROTOLO, A. 2004. Defeasible logic: Agency, intention and obligation. In Deontic Logic in Computer Science, A. Lomuscio and D. Nute, Eds. LNAI, vol. 3065. Springer, Berlin, 114-128.
20. GOVERNATORI, G., ROTOLO, A. AND SADIQ, S. 2004. A model of dynamic resource allocation in workflow systems. In Database Technology 2004, K.-D. Schewe and H. E. Williams, Eds. Conference Research and Practice of Information Technology, vol. 27. Australian Computer Science Association, ACS, 197-206.
21. GOVERNATORI, G., ROTOLO, A. AND SARTOR, G. 2005. Temporalised normative positions in defeasible logic. In Proc. 10th International Conference on Artificial Intelligence and Law (ICAIL05). ACM Press, New York, 25-34.
22. GROSOF, B. N. 1997. Prioritized conflict handling for logic programs. In Proceedings International Logic Programming Symposium, J. Maluszynski, Ed. MIT Press, Cambridge, MA, 197-211.
23. GROSOF, B. N. 2004. Representing e-commerce rules via situated courteous logic programs in RuleML. Electronic Commerce Research and Applications 3, 1, 2-20.
24. GROSOF, B. N., GANDHE, M. D. AND FININ, T. W. 2002. Sweetjess : Translating damlruleml to jess. In Proc. of the International Workshop on Rule Markup Languages for Business Rules on the Semantic Web (RuleML 2002 (14 June 2002), M. Schroeder and G. Wagner, Eds. CEUR Workshop Proceedings, vol. 60. CEUR-WS.org.
25. GROSOF, B. N., LABROU, Y. AND CHAN, H. Y. 1999. A declarative approach to business rules in contracts: Courteous logic programs in XML. In Proceedings of the 1st ACM Conference on Electronic Commerce (EC99). ACM, ACM Press, New York, 68-77.
26. GROSOF, B. N. AND POON, T. C. 2003.SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions. In Proc. 12th International Conference on World Wide Web. ACM Press, New York, 340-349.
27. HORTY, J. F., THOMASON, R. H. AND TOURETZKY, D. S. 1987. A skeptical theory of inheritance in nonmonotonic semantic networks. In AAAI-87. AAAI Press, Menlo Park, CA, 358-363.
28. JOHNSTON, B. AND GOVERNATORI, G. 2003. An algorithm for the induction of defeasible logic theories from databases. In Database Technology 2003, K.-D. Schewe and X. Zhou, Eds. Conference Research and Practice of Information Technology, vol. 17. Australian Computer Science Association, ACS, 75-83.
29. KUNEN, K. 1987. Negation in logic programming. Journal of Logic Programming 4, 289-308.
30. MAHER, M. J. 2000. A denotational semantics of defeasible logic. In Computational Logic, J. W. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau, C. Palamidessi, L. M. Pereira, Y. Sagiv, and P. J. Stuckey, Eds. LNCS, vol. 1861. Springer, Berlin, 209-222.
31. MAHER, M. J. 2001. Prepositional defeasible logic has linear complexity. Theory and Practice of Logic Programming 1, 6, 691-711.
32. MAHER, M. J. 2002. A model-theoretic semantics for defeasible logic. In Proc. ICLP2002 Workshop on Paraconsistent Computational Logic, H. Decker, J. Villadsen, and T. Waragai, Eds. Datalogiske Skrifter, vol. 95. Roskilde University, Roskilde, Denmark, 67-80.
33. MAHER, M. J. AND GOVERNATORI, G. 1999. A semantic decomposition of defeasible logic. In Proc. American National Conference on Artificial Intelligence (AAAI-99). AAAI Press, Menlo Park, CA, 299-305.
34. MAHER, M. J., ROCK, A., ANTONIOU, G., BILLINGTON, D. AND MILLER, T. 2001. Efficient defeasible reasoning systems. International Journal on Artificial Intelligence Tools 10, 4, 483-501.
35. MAREK, V. AND TRUSZCZYNSKI, M. 1993. Nonmonotonic Reasoning.Springer, Berlin.
36. MORGENSTEN, L. 1998. Inheritance comes of age: Applying nonmonotonic techniques to problems in industry. Artificial Intelligence 103, 1-34.
37. NUTE, D. 1994. Defeasible logic. In Handbook of Logic in Artificial Intelligence and Logic Programming, D. Gabbay, C. Hogger, and J. Robinson, Eds. Vol. 3. Oxford University Press, Oxford, 353-395.
38. PRAKKEN, H. 1997.Logical Tools for Modelling Legal Arguments.Kluwei, Dordrecht.
39. REITER, R. 1980.A logic for default reasoning.Artificial Intelligence 13, 81-132.