1,582 research outputs found
Resource-driven Substructural Defeasible Logic
Linear Logic and Defeasible Logic have been adopted to formalise different
features relevant to agents: consumption of resources, and reasoning with
exceptions. We propose a framework to combine sub-structural features,
corresponding to the consumption of resources, with defeasibility aspects, and
we discuss the design choices for the framework
Argumentation Semantics for Temporal Defeasible Logic
We present an extension of the argumentation semantics for defeasible logic to cover the temporalisation of defeasible logic with permanent and imminent temporal literals
An Argumentation-Theoretic Characterization of Defeasible Logic
Defeasible logic is an efficient non-monotonic logic that is defined only proof-theoretically. It has potential application in some legal domains. We present here an argumentation semantics for defeasible logic that will be useful in these applications. Our development differs at several points from existing argumentation frameworks since there are several features of defeasible logic that have not been addressed in the literature
Is Defeasible Logic Applicable?
In this paper the application of defeasible logic for automated negotiation is investigated. Defeasible logic is flexible enough to be adapted to several possible negotiation strategies, has efficient implementations, and provides a formal basis for analysis (e.g. to explain why a negotiation was not successful). Two case studies, one small and one more comprehensive, will be described and the feasibility of approaches based on defeasible logic will be discussed
Argumentation Semantics for Defeasible Logics
Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the modelling of business rules. So far defeasible logic has been defined only proof-theoretically. Argumentation-based semantics have become popular in the area of logic programming. In this paper we give an argumentation-based semantics for defeasible logic. Recently it has been shown that a family of approaches can be built around defeasible logic, in which different intuitions can be followed. In this paper we present an argumentation-based semantics for an ambiguity propagating logic, too. Further defeasible logics can be characterised in a similar way
Representation results for defeasible logic
The importance of transformations and normal forms in logic programming, and
generally in computer science, is well documented. This paper investigates
transformations and normal forms in the context of Defeasible Logic, a simple
but efficient formalism for nonmonotonic reasoning based on rules and
priorities. The transformations described in this paper have two main benefits:
on one hand they can be used as a theoretical tool that leads to a deeper
understanding of the formalism, and on the other hand they have been used in
the development of an efficient implementation of defeasible logic.Comment: 30 pages, 1 figur
Defeasible Logic for Automated Negotiation
Negotiation plays a fundamental role in e-commerce. In this paper, the application of defeasible logic for automated negotiation is investigated. Defeasible logic is flexible enough to be adapted to several possible negotiation strategies, has efficient implementations, and provides a formal basis for analysis (e.g. to explain why a negotiation was not successful). Two case studies, one small and one more comprehensive, will be described and the feasibility of approaches based on defeasible logic will be discussed
- …