2,160 research outputs found

    Argumentation Semantics for Defeasible Logics

    Get PDF
    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

    Defeasible logic programming: language definition, operational semantics, and parallelism

    Get PDF
    This thesis defines Defeasible Logic Programming and provides a concrete specification of this new language through its operational semantics. Defeasible Logic Programming, or DeLP for short, has been defined based on the Logic Programming paradigm and considering features of recent developments in the area of Defeasible Argumentation. DeLP relates and improves many aspects of the areas of Logic Programming, Defeasible Argumentation, Intelligent Agents, and Parallel Logic ProgrammingFacultad de Informátic

    Defeasible logic programming: language definition, operational semantics, and parallelism

    Get PDF
    This thesis defines Defeasible Logic Programming and provides a concrete specification of this new language through its operational semantics. Defeasible Logic Programming, or DeLP for short, has been defined based on the Logic Programming paradigm and considering features of recent developments in the area of Defeasible Argumentation. DeLP relates and improves many aspects of the areas of Logic Programming, Defeasible Argumentation, Intelligent Agents, and Parallel Logic ProgrammingFacultad de Informátic

    An Argumentation-Theoretic Characterization of Defeasible Logic

    Get PDF
    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

    Argumentation Semantics for Temporal Defeasible Logic

    Get PDF
    We present an extension of the argumentation semantics for defeasible logic to cover the temporalisation of defeasible logic with permanent and imminent temporal literals

    Argumentation Semantics for Defeasible Logics

    Get PDF
    Defeasible reasoning is a simple but efficient rule-based approach to nonmonotonic reasoning. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the modeling of business rules. This paper establishes significant links between defeasible reasoning and argumentation. In particular, Dung-like argumentation semantics is provided for two key defeasible logics, of which one is ambiguity propagating and the other ambiguity blocking. There are several reasons for the significance of this work: (a) establishing links between formal systems leads to a better understanding and cross-fertilization, in particular our work sheds light on the argumentation-theoretic features of defeasible logic; (b) we provide the first ambiguity blocking Dung-like argumentation system; (c) defeasible reasoning may provide an efficient implementation platform for systems of argumentation; and (d) argumentation-based semantics support a deeper understanding of defeasible reasoning, especially in the context of the intended applications

    Defeasible logic programming: language definition, operational semantics, and parallelism

    Get PDF
    This thesis defines Defeasible Logic Programming and provides a concrete specification of this new language through its operational semantics. Defeasible Logic Programming, or DeLP for short, has been defined based on the Logic Programming paradigm and considering features of recent developments in the area of Defeasible Argumentation. DeLP relates and improves many aspects of the areas of Logic Programming, Defeasible Argumentation, Intelligent Agents, and Parallel Logic ProgrammingFacultad de Informátic
    corecore