Defense semantics of argumentation: encoding reasons for accepting arguments

E-print/Working paper (2017)

In this paper we show how the defense relation among abstract arguments can be used to encode the reasons for accepting arguments. After introducing a novel notion of defenses and defense graphs, we ... [more ▼]

In this paper we show how the defense relation among abstract arguments can be used to encode the reasons for accepting arguments. After introducing a novel notion of defenses and defense graphs, we propose a defense semantics together with a new notion of defense equivalence of argument graphs, and compare defense equivalence with standard equivalence and strong equivalence, respectively. Then, based on defense semantics, we define two kinds of reasons for accepting arguments, i.e., direct reasons and root reasons, and a notion of root equivalence of argument graphs. Finally, we show how the notion of root equivalence can be used in argumentation summarization. [less ▲]

Prioritized Norms in Formal Argumentation

in Journal of Logic and Computation (2017), abs/1709.08034

To resolve conflicts among norms,various nonmonotonic formalisms can be used to perform prioritized normative reasoning. Meanwhile, formal argumentation provides a way to represent nonmonotonic logics. In ... [more ▼]

To resolve conflicts among norms,various nonmonotonic formalisms can be used to perform prioritized normative reasoning. Meanwhile, formal argumentation provides a way to represent nonmonotonic logics. In this paper, we propose a representation of prioritized normative reasoning by argumentation. Using hierarchical abstract normative systems, we define three kinds of prioritized normative reasoning approaches, called Greedy, Reduction, and Optimization. Then, after formulating an argumentation theory for a hierarchical abstract normative system, we show that for a totally ordered hierarchical abstract normative system, Greedy and Reduction can be represented in argumentation by applying the weakest link and the last link principles respectively, and Optimization can be represented by introducing additional defeats capturing implicit conflicts between arguments. [less ▲]

Modeling relevant legal information for consumer disputes

in EGOVIS 2016: Electronic Government and the Information Systems Perspective (2016, September)

Accessing relevant legal information found in text excerpts from heterogeneous sources is essential to the decision making process in consumer disputes. The Ontology of Relevant Legal Information in ... [more ▼]

Accessing relevant legal information found in text excerpts from heterogeneous sources is essential to the decision making process in consumer disputes. The Ontology of Relevant Legal Information in Consumer Disputes (ric) is the domain-independent ontology modeling this relevant legal information comprising rights, their requisites, exceptions, constraints, enforcement procedures, legal sources. Its use is exemplified with one extension thereof, the Air Transport Passenger Incidents Ontology (ric-atpi), representing both the possible incidents triggered by a complaint in the air transport passenger domain and the related legal information that might be applicable. The Ontology models the key provisions found in hard law, and those in soft law, comprising heterogeneous sources in a structured manner. An ontology-based system provides the knowledge embedded in the legal sources and their relation to the specific scenario. [less ▲]

A Representation Theorem for Abstract Cumulative Aggregation

Report (2016)

From any two conditional obligations “X if A” and “Y if B”, cumulative aggregation derives the combined obligation “X ∪ Y if A ∪ (B \ X)”, whereas simple aggregation derives the obligation “X ∪ Y if A ∪ ... [more ▼]

From any two conditional obligations “X if A” and “Y if B”, cumulative aggregation derives the combined obligation “X ∪ Y if A ∪ (B \ X)”, whereas simple aggregation derives the obligation “X ∪ Y if A ∪ B”. We propose FC systems consisting of cumulative aggregation together with factual detachment, and we give a representation result for FC systems, as well as for FA systems consisting of simple aggregation together with factual detachment. We relate FC and FA systems to each other and to input/output logics recently introduced by Parent and van der Torre. [less ▲]

Eunomos, a legal document and knowledge management system for the Web to provide relevant, reliable and up-to-date information on the Law

in Artificial Intelligence and Law (2016)

Complaint Ontology Pattern - COP

in Workshop on Ontology and Semantic Web Patterns, Kobe 18 October 2016 (2016)

In this paper we present an ontology design pattern to conceptualize complaints - an important domain still uncovered by ODPs. The proposed Complaint Ontology Pattern (COP) has been designed based on the ... [more ▼]

In this paper we present an ontology design pattern to conceptualize complaints - an important domain still uncovered by ODPs. The proposed Complaint Ontology Pattern (COP) has been designed based on the analysis of free text complaints from available complaint datasets (banking, air transport, automobile) among other knowledge sources. We present a detailed use case from consumer disputes. We evaluate the pattern by annotating the complaints from our use case and by discussing how COP aligns to existing ontologies. [less ▲]

Retalis Language for Information Engineering in Autonomous Robot Software

in IfCoLog Journal of Logics and their Applications (2015), 2(2), 85

Algorithms for tractable compliance problems

in Frontiers of Computer Science (2015), 9(1), 55-74

In general the problem of verifying whether a structured business process is compliant with a given set of regulations is NP-hard. The present paper focuses on identifying a tractable subset of this ... [more ▼]

In general the problem of verifying whether a structured business process is compliant with a given set of regulations is NP-hard. The present paper focuses on identifying a tractable subset of this problem, namely verifying whether a structured business process is compliant with a single global obligation. Global obligations are those whose validity spans for the entire execution of a business process. We identify two types of obligations: achievement and maintenance. In the present paper we firstly define an abstract framework capable to model the problem and secondly we define procedures and algorithms to deal with the compliance problem of checking the compliance of a structured business process with respect to a single global obligation. We show that the algorithms proposed in the paper run in polynomial time. [less ▲]

AGM Revision of Beliefs about Action and Time

in Proceedings of the International Joint Conference on Artificial Intelligence (2015)

The AGM theory of belief revision is based on propositional belief sets. In this paper we develop a logic for revision of temporal belief bases, contain- ing expressions about temporal propositions (to ... [more ▼]

The AGM theory of belief revision is based on propositional belief sets. In this paper we develop a logic for revision of temporal belief bases, contain- ing expressions about temporal propositions (to- morrow it will rain), possibility (it may rain tomor- row), actions (the robot enters the room) and pre- and post-conditions of these actions. We prove the Katsuno-Mendelzon and the Darwiche-Pearl repre- sentation theorems by restricting the logic to for- mulas representing beliefs up to certain time. We illustrate our belief change model through several examples [less ▲]

Reasoning on Robot Knowledge from Discrete and Asynchronous Observations

in AAAI Spring Symposium 2014: Knowledge Representation and Reasoning in Robotics, Stanford, USA, 2015 (2014, March)

Robot knowledge of the world is created from discrete and asynchronous events received from its perception components. Proper representation and maintenance of robot knowledge is crucial to enable the use ... [more ▼]

Robot knowledge of the world is created from discrete and asynchronous events received from its perception components. Proper representation and maintenance of robot knowledge is crucial to enable the use of robot knowledge for planning, user-interaction, etc. This paper identifies some of the main issues related to the representation, maintenance and querying of robot knowledge based on discrete asynchronous events such as event-history management and synchronization, and introduces a language for simplifying developers’ job at making a suitable representation of robot knowledge. [less ▲]