![]() Liao, Beishui ![]() ![]() 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 ▲] Detailed reference viewed: 77 (18 UL)![]() ; Rodriguez Lera, Francisco Javier ![]() ![]() Scientific Conference (2017) For robot tutors, autonomy and personalizations are important factors in order to engage users as well as to personalize the content and interaction according to the needs of individuals. This paper ... [more ▼] For robot tutors, autonomy and personalizations are important factors in order to engage users as well as to personalize the content and interaction according to the needs of individuals. This paper presents the Programming Cognitive Robot (ProCRob) software architecture to target personalized social robotics in two complementary ways. ProCRob supports the development and personalization of social robot applications by teachers and therapists without computer programming background. It also supports the development of autonomous robots which can adapt according to the human-robot interaction context. ProCRob is based on our previous research on autonomous robotics and has been developed since 2015 by a multi-disciplinary team of researchers from the fields of AI, Robotics and Psychology as well as artists and designers at the University of Luxembourg. ProCRob is currently being used and further developed for therapy of children with autism, and for encouraging rehabilitation activities in patients with post-stroke. This is paper presents a summary of ProCRob and its application in autism. [less ▲] Detailed reference viewed: 143 (7 UL)![]() Liao, Beishui ![]() ![]() 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 ▲] Detailed reference viewed: 131 (7 UL)![]() ; Pigozzi, Gabriella ![]() ![]() in Journal of Logic, Language and Information (2016), 25(3), 273-297 In this paper we study AGM contraction and revision of rules using input/output logical theories. We replace propositional formulas in the AGM framework of theory change by pairs of propositional formulas ... [more ▼] In this paper we study AGM contraction and revision of rules using input/output logical theories. We replace propositional formulas in the AGM framework of theory change by pairs of propositional formulas, representing the rule based character of theories, and we replace the classical consequence operator Cn by an input/output logic. The results in this paper suggest that, in general, results from belief base dynamics can be transferred to rule base dynamics, but that a similar transfer of AGM theory change to rule change is much more problematic. First, we generalise belief base contraction to rule base contraction, and show that two representation results of Hansson still hold for rule base contraction. Second, we show that the six so-called basic postulates of AGM contraction are consistent only for some input/output logics, but not for others. In particular, we show that the notorious recovery postulate can be satisfied only by basic output, but not by simple-minded output. Third, we show how AGM rule revision can be defined in terms of AGM rule contraction using the Levi identity. We highlight various topics for further research. [less ▲] Detailed reference viewed: 166 (10 UL)![]() ; ; et al 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 ▲] Detailed reference viewed: 154 (4 UL)![]() ; ; van der Torre, Leon ![]() in Deontic Logic and Normative Systems (2016) (2016) Deontic logic sentences define what an agent ought to do when faced with a set of norms. These norms may come into conflict such that a priority ordering over them is necessary to resolve these conflicts ... [more ▼] Deontic logic sentences define what an agent ought to do when faced with a set of norms. These norms may come into conflict such that a priority ordering over them is necessary to resolve these conflicts. Dung's seminal paper raised the - so far open - challenge of how to use formal argumentation to represent non monotonic logics, highlighting argumentation's value in exchanging, communicating and resolving possibly conflicting viewpoints in distributed scenarios. In this paper, we propose a formal framework to study various properties of prioritized non monotonic reasoning in formal argumentation, in line with this idea. More precisely, we show how a version of prioritized default logic and Brewka-Eiter's construction in answer set programming can be obtained in argumentation via the weakest and last link principles. We also show how to represent Hansen's recent construction for prioritized normative reasoning by adding arguments using weak contraposition via permissive norms, and their relationship to Caminada's "hang yourself" arguments. [less ▲] Detailed reference viewed: 121 (10 UL)![]() Ambrossio, Diego Agustin ![]() ![]() ![]() 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 ▲] Detailed reference viewed: 213 (43 UL)![]() Ambrossio, Diego Agustin ![]() ![]() ![]() in Deontic Logic and Normative Systems (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 ∪ B” ... [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 ▲] Detailed reference viewed: 117 (13 UL)![]() ; ; Humphreys, Llio ![]() in Artificial Intelligence and Law (2016) Detailed reference viewed: 312 (20 UL)![]() van der Torre, Leon ![]() in Proceedings of the 1st Chinese Conference on Logic and Argumentation (CLAR 2016), Hangzhou, China, April 2-3, 2016. (2016) Detailed reference viewed: 84 (2 UL)![]() ; ; et al 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 ▲] Detailed reference viewed: 125 (5 UL)![]() van der Torre, Leon ![]() in Dagstuhl Reports (2016) This report documents the program and the outcomes of Dagstuhl Perspectives Workshop 15362 “Present and Future of Formal Argumentation”. The goal of this Dagstuhl Perspectives Workshop was to gather the ... [more ▼] This report documents the program and the outcomes of Dagstuhl Perspectives Workshop 15362 “Present and Future of Formal Argumentation”. The goal of this Dagstuhl Perspectives Workshop was to gather the world leading experts in formal argumentation in order to develop a SWOT (Strength, Weaknesses, Opportunities, Threats) analysis of the current state of the research in this field and to draw accordingly some strategic lines to ensure its successful development in the future. A critical survey of the field has been carried out through individual presentations and collective discussions. Moreover, working group activity lead to identify several open problems in argumentation. [less ▲] Detailed reference viewed: 136 (11 UL)![]() Ziafati, Pouyan ![]() in IfCoLog Journal of Logics and their Applications (2015), 2(2), 85 Detailed reference viewed: 118 (12 UL)![]() Van Zee, Marc ![]() ![]() Scientific Conference (2015) Icard et al. introduce a semantics for actions over time, provide an axiomatization for this logic, and use this logic to define coherence conditions for a belief- intention database. First, we show ... [more ▼] Icard et al. introduce a semantics for actions over time, provide an axiomatization for this logic, and use this logic to define coherence conditions for a belief- intention database. First, we show incompleteness of their axiomatization and we adapt their semantics and provide a complete axiomatization for it. Second, we show that Icard et al.’s definition of coherence is too weak, and we define a stronger notion of coherence us- ing our new logic [less ▲] Detailed reference viewed: 140 (6 UL)![]() Colombo Tosatto, Silvano ![]() ![]() ![]() 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 ▲] Detailed reference viewed: 198 (16 UL)![]() Humphreys, Llio ![]() in Proceedings of the 28th International Conference on Legal Knowledge and Information Systems (2015) Detailed reference viewed: 167 (6 UL)![]() Van Zee, Marc ![]() ![]() 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 ▲] Detailed reference viewed: 149 (9 UL)![]() Humphreys, Llio ![]() ![]() in The 15th International Conference on Artificial Intelligence & Law — San Diego, June 8-12, 2015 (2015) Detailed reference viewed: 315 (23 UL)![]() Ziafati, Pouyan ![]() ![]() ![]() 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 ▲] Detailed reference viewed: 368 (42 UL)![]() ; Humphreys, Llio ![]() ![]() in Seventh IEEE Workshop on Requirements Engineering and Law (2014) This paper reviews existing approaches to representing legal knowledge for legal requirements engineering. Legal requirement methodologies are rarely developed together with legal practitioners, with the ... [more ▼] This paper reviews existing approaches to representing legal knowledge for legal requirements engineering. Legal requirement methodologies are rarely developed together with legal practitioners, with the result that often approaches are based on a simplified view of law which prevents their acceptance by legal practitioners. In this paper, we analyse how legal practitioners build legal knowledge and possibilities for existing approaches in RELaw to mirror legal practice. [less ▲] Detailed reference viewed: 173 (4 UL) |
||