Relative Expressiveness of Well-Founded Defeasible Logics
An approach to formulating relative expressiveness of defeasible logics was introduced in . In this paper we address the relative expressiveness of the well-founded defeasible logics in the framework WFDL and their relationship to the defeasible logics in the framework DL. We show that, in terms of defeasible reasoning, the logics in WFDL have greater (or equal) expressiveness than those in DL, but it is not clear whether they have strictly greater expressiveness. We also show that different treatments of ambiguity lead to different expressiveness in WFDL, as it does in DL.
KeywordsLogic Program Inference Rule Logic Programming Strict Rule Superiority Relation
Unable to display preview. Download preview PDF.
- 1.Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: On the modelling and analysis of regulations. In: Proc. Australasian Conf. on Information Systems, pp. 20–29 (1999)Google Scholar
- 11.Governatori, G., Rotolo, A., Padmanabhan, V.: The cost of social agents. In: Nakashima, H., Wellman, M.P., Weiss, G., Stone, P. (eds.) AAMAS, pp. 513–520. ACM (2006)Google Scholar
- 12.Grosof, B.N.: Prioritized conflict handling for logic programs. In: ILPS, pp. 197–211 (1997)Google Scholar
- 13.Grosof, B.N., Labrou, Y., Chan, H.Y.: A declarative approach to business rules in contracts: courteous logic programs in XML. In: ACM Conference on Electronic Commerce, pp. 68–77 (1999)Google Scholar
- 15.Maher, M.J.: Relative expressiveness of defeasible logics II. TPLP 13(4-5), 579–592 (2013)Google Scholar
- 16.Maher, M.J., Governatori, G.: A semantic decomposition of defeasible logics. In: AAAI/IAAI, pp. 299–305. AAAI Press (1999)Google Scholar
- 20.Prakken, H.: Logical Tools for Modelling Legal Argument: A Study of Defeasible Reasoning in Law. Kluwer (1997)Google Scholar
- 21.Rahwan, I., Simari, G.: Argumentation in Artificial Intelligence. Springer (2009)Google Scholar