References of "van der Torre, Leon 50003247"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailAlgorithms for Basic Compliance Problems
Colombo Tosatto, Silvano UL; El Kharbili, Marwane UL; Governatori, Guido et al

in 2nd International Workshop on Engineering Safety and Security Systems, ESSS 2013. (2013, March)

The present paper focuses on the problems of verifying compliance for global achievement and maintenance obligations. We first introduce the elements needed to identify and study compliance to these two ... [more ▼]

The present paper focuses on the problems of verifying compliance for global achievement and maintenance obligations. We first introduce the elements needed to identify and study compliance to these two classes of obligations in processes. Additionally, we define procedures and algorithms to efficiently deal with the identified compliance problem. We finally show that both algorithms proposed in the paper belong to the complexity class P. [less ▲]

Detailed reference viewed: 193 (13 UL)
Peer Reviewed
See detailA logical theory about dynamics in abstract argumentation
Booth, Richard UL; Kaci, Souhila; Rienstra, Tjitze UL et al

Scientific Conference (2013)

Detailed reference viewed: 109 (7 UL)
Full Text
Peer Reviewed
See detailA logical theory about dynamics in abstract argumentation
Booth, Richard UL; Kaci, Souhila; Rienstra, Tjitze UL et al

in Scalable Uncertainty Management - 7th International Conference, SUM 2013 (2013)

We address dynamics in abstract argumentation using a logical theory where an agent’s belief state consists of an argumentation framework (AF, for short) and a constraint that encodes the outcome the ... [more ▼]

We address dynamics in abstract argumentation using a logical theory where an agent’s belief state consists of an argumentation framework (AF, for short) and a constraint that encodes the outcome the agent believes the AF should have. Dynamics enters in two ways: (1) the constraint is strengthened upon learning that the AF should have a certain outcome and (2) the AF is expanded upon learning about new arguments/attacks. A problem faced in this setting is that a constraint may be inconsistent with the AF’s outcome. We discuss two ways to address this problem: First, it is still possible to form consistent fallback beliefs, i.e., beliefs that are most plausible given the agent’s AF and constraint. Second, we show that it is always possible to find AF expansions to restore consistency. Our work combines various individual approaches in the literature on argumentation dynamics in a general setting. [less ▲]

Detailed reference viewed: 136 (6 UL)
Peer Reviewed
See detailA logical theory about dynamics in abstract argumentation
Booth, Richard UL; Kaci, Souhila; Rienstra, Tjitze UL et al

Scientific Conference (2013)

Detailed reference viewed: 138 (13 UL)
Full Text
Peer Reviewed
See detailMonotonic and non-monotonic inference for abstract argumentation
Booth, Richard UL; Kaci, Souhila; Rienstra, Tjitze UL et al

in Proceedings of the Twenty-Sixth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2013 (2013)

We present a new approach to reasoning about the outcome of an argumentation framework, where an agent’s reasoning with a framework and semantics is represented by an inference relation defined over a ... [more ▼]

We present a new approach to reasoning about the outcome of an argumentation framework, where an agent’s reasoning with a framework and semantics is represented by an inference relation defined over a logical labeling language. We first study a monotonic type of inference which is, in a sense, more general than an acceptance function, but equally expressive. In order to overcome the limitations of this expressiveness, we study a non-monotonic type of inference which allows counterfactual inferences. We precisely characterize the classes of frameworks distinguishable by the non-monotonic inference relation for the admissible semantics. [less ▲]

Detailed reference viewed: 71 (4 UL)
Peer Reviewed
See detailAgent Programming Languages Requirements for Programming Autonomous Robots
Ziafati, Pouyan UL; Dastani, Mehdi; Meyer, John-Jules et al

in Dastani, Mehdi; Hübner, Jomif; Logan, Brian (Eds.) Programming Multi-Agent Systems (2013)

Detailed reference viewed: 185 (5 UL)
Full Text
Peer Reviewed
See detailEvent-processing in Autonomous Robot Programming
Ziafati, Pouyan UL; Dastani, Mehdi; Meyer, John-Jules et al

in Proceedings of the 2013 International Conference on Autonomous Agents and Multi-agent Systems (2013)

When implementing the high-level control component of an autonomous robot, one needs to process events, generated by sensory components, to extract the information relevant to the control component. This ... [more ▼]

When implementing the high-level control component of an autonomous robot, one needs to process events, generated by sensory components, to extract the information relevant to the control component. This paper discusses the lack of support for event-processing when current agent programming languages (APLs) are used to implement the control component of autonomous robots. To address this issue, the use of information flow processing (IFP) systems is proposed to support the development of event-processing components (EPCs) for an autonomous robot. The necessary interaction mechanisms between a control component and EPCs are defined. These mechanisms allow run-time subscription to events of interest, asynchronous reception of events, maintaining necessary histories of events and run-time querying of the histories. Several implementation-related concerns for these interaction mechanisms are discussed. [less ▲]

Detailed reference viewed: 117 (11 UL)
Full Text
See detailHandbook of Deontic logic and Normative Systems
Gabbay, Dov; Horty, Jeff; Parent, Xavier UL et al

Book published by College Publication (2013)

Detailed reference viewed: 381 (17 UL)
Full Text
Peer Reviewed
See detailManaging legal interpretation in regulatory compliance
Boella, Guido; Janssen, Marijn; Joris, Hulstijn et al

in XIV International Conference on Artificial Intelligence and Law (2013)

Detailed reference viewed: 282 (3 UL)
Peer Reviewed
See detailNormative Reasoning and Consequence
Broersen, Jan; Cranefield, Stephen; Elrakaiby, Yehia UL et al

in Normative Multi-Agent Systems (2013)

Detailed reference viewed: 97 (15 UL)
Full Text
Peer Reviewed
See detailRewriting Rules for the Computation of Goal-Oriented Changes in an Argumentation System
Kontarinis, Dionysios; Bonzon, Elise; Maudet, Nicolas et al

in CLIMA (2013)

When several agents are engaged in an argumentation process, they are faced with the problem of deciding how to contribute to the current state of the debate in order to satisfy their own goal, ie. to ... [more ▼]

When several agents are engaged in an argumentation process, they are faced with the problem of deciding how to contribute to the current state of the debate in order to satisfy their own goal, ie. to make an argument under a given semantics accepted or not. In this paper, we study the minimal changes (or target sets) on the current state of the debate that are required to achieve such a goal, where changes are the addition and/or deletion of attacks among arguments. We study some properties of these target sets, and propose a Maude specification of rewriting rules which allow to compute all the target sets for some types of goals [less ▲]

Detailed reference viewed: 96 (1 UL)
Full Text
Peer Reviewed
See detailIntegrating Legal-URN and Eunomos: Towards a Comprehensive Compliance Management Solution
Boella, Guido; Tosatto, Silvano Colombo; Ghanavati, Sepideh et al

in AICOL (2013)

Business process compliance with regulations has been a topic of many research areas in Computer Science such as Requirements Engineering (RE), Artificial Intelligence (AI), Logic and Natural Language ... [more ▼]

Business process compliance with regulations has been a topic of many research areas in Computer Science such as Requirements Engineering (RE), Artificial Intelligence (AI), Logic and Natural Language Processing (NLP). This work aims to provide a systematic way of establishing and managing compliance to assist decision-making and reporting. Despite many notable advances, few systems deal adequately with legal interpretation and modeling norms in an expressive way that is well-integrated with business modeling practices. In this paper, we bring together two leading systems, Legal-URN and Eunomos, for a comprehensive compliance management solution. [less ▲]

Detailed reference viewed: 128 (0 UL)
Full Text
Peer Reviewed
See detailSelecting judgment aggregation rules for NAO robots: an experimental approach
Garcia Becerro, Frederic UL; Sousa, Sergio; Slavkovik, Marija UL et al

in Selecting judgment aggregation rules for NAO robots: an experimental approach (2012)

Social choice rules can be used to reach group decisions in multiagent systems. We consider judgment aggregation, the problem of aggregating answers to binary logically related questions. In general ... [more ▼]

Social choice rules can be used to reach group decisions in multiagent systems. We consider judgment aggregation, the problem of aggregating answers to binary logically related questions. In general "fairness" is usually considered to be the main concern when selecting a social choice rule, however we believe that in judgment aggregation often a more relevant property is how efficient the rule is in truth tracking, that is, how often does it return the correct answer to the binary questions. Whereas "fairness" can be studied axiomatically, truth tracking efficiency needs to be studied experimentally. We accomplish the experimental analysis by constructing a multi-robot system. [less ▲]

Detailed reference viewed: 59 (1 UL)
Full Text
Peer Reviewed
See detailNLP Challenges for Eunomos, a Tool to Build and Manage Legal Knowledge
Boella, Guido; di Caro, Luigi; Humphreys, Llio UL et al

in Language Resources and Evaluation (LREC) (2012)

In this paper, we describe how NLP can semi-automate the construction and analysis of knowledge in Eunomos, a legal knowledge management service which enables users to view legislation from various ... [more ▼]

In this paper, we describe how NLP can semi-automate the construction and analysis of knowledge in Eunomos, a legal knowledge management service which enables users to view legislation from various sources and ?nd the right de?nitions and explanations of legal concepts in a given context. NLP can semi-automate some routine tasks currently performed by knowledge engineers, such as classifying norms, or linking key terms within legislation to ontological concepts. This helps overcome the resource bottleneck problem of creating specialist knowledge management systems. While accuracy is of the utmost importance in the legal domain, and the information should be veri?ed by domain experts as a matter of course, a semi-automated approach can result in considerable ef?ciency gains. [less ▲]

Detailed reference viewed: 200 (0 UL)
Full Text
Peer Reviewed
See detailBeyond Maxi-Consistent Argumentation Operators
Vesic, Srdjan UL; van der Torre, Leon UL

in 13th European Conference on Logics in Artificial Intelligence, JELIA 2012 (2012)

The question whether Dung’s abstract argumentation theory can be instantiated with classical propositional logic has drawn a considerable amount of attention among scientists in recent years. It was shown ... [more ▼]

The question whether Dung’s abstract argumentation theory can be instantiated with classical propositional logic has drawn a considerable amount of attention among scientists in recent years. It was shown by Cayrol in 1995 that if direct undercut is used, then stable extensions of an argumentation system correspond exactly to maximal (for set inclusion) consistent subsets of the knowledge base from which the argumentation system was constructed. Until now, no other correspondences were found between the extensions of an argumentation framework and its knowledge base (except if preferences are also given at the input of the system). This paper’s contribution is twofold. First, we identify four intuitive conditions describing a class of attack relations which return extensions corresponding exactly to the maximal (for set inclusion) consistent subsets of the knowledge base. Second, we show that if we relax those conditions, it is possible to instantiate Dung’s abstract argumentation theory with classical propositional logic and obtain a meaningful result which does not correspond to the maximal consistent subsets of the knowledge base used for constructing arguments. Indeed, we define a whole class of instantiations that return different results. Furthermore, we show that these instantiations are sound in the sense that they satisfy the postulates from argumentation literature (e.g. consistency, closure). In order to illustrate our results, we present one particular instantiation from this class, which is based on cardinalities of minimal inconsistent sets a formula belongs to. [less ▲]

Detailed reference viewed: 83 (0 UL)
Full Text
Peer Reviewed
See detailEunomos, a Legal Document and Knowledge Management System to Build Legal Services
Boella, Guido; Humphreys, Llio UL; Martin, Marco et al

in Palmirani, Monica; Pagallo, Ugo; Casanovas, Pompeu (Eds.) et al AI Approaches to the Complexity of Legal Systems. Models and Ethical Challenges for Legal Systems, Legal Language and Legal Ontologies, Argumentation and Software Agents (2012)

We introduce the Eunomos software, an advanced legal document management system with terminology management. We describe the challenges of legal research in an increasingly complex, multi-level and multi ... [more ▼]

We introduce the Eunomos software, an advanced legal document management system with terminology management. We describe the challenges of legal research in an increasingly complex, multi-level and multi-lingual world and how the Eunomos software helps expert users keep track of the state of the relevant law on any given topic. We will describe in particular the editorial process for building legal knowledge. [less ▲]

Detailed reference viewed: 178 (11 UL)
Full Text
Peer Reviewed
See detailConditional acceptance functions
Booth, Richard UL; Kaci, Souhila; Rienstra, Tjitze UL et al

in 4th International Conference on Computational Models of Argument (COMMA 2012) (2012)

Dung-style abstract argumentation theory centers on argumentation frameworks and acceptance functions. The latter take as input a framework and return sets of labelings. This methodology assumes full ... [more ▼]

Dung-style abstract argumentation theory centers on argumentation frameworks and acceptance functions. The latter take as input a framework and return sets of labelings. This methodology assumes full awareness of the arguments relevant to the evaluation. There are two reasons why this is not satisfactory. Firstly, full awareness is, in general, not a realistic assumption. Second, frameworks have explanatory power, which allows us to reason abductively or counterfactually, but this is lost under the usual semantics. To recover this aspect, we generalize conventional acceptance, and we present the concept of a conditional acceptance function. [less ▲]

Detailed reference viewed: 54 (2 UL)
Full Text
Peer Reviewed
See detailA logic of argumentation for specification and verification of abstract argumentation frameworks
Villata, Serena; Boella, Guido; Gabbay, Dov M. UL et al

in Annals of Mathematics & Artificial Intelligence (2012), 66(1-4), 199-230

In this paper, we propose a logic of argumentation for the specification and verification (LA4SV) of requirements on Dung’s abstract argumentation frameworks. We distinguish three kinds of decision ... [more ▼]

In this paper, we propose a logic of argumentation for the specification and verification (LA4SV) of requirements on Dung’s abstract argumentation frameworks. We distinguish three kinds of decision problems for argumentation verification, called extension verification, framework verification, and specification verification respectively. For example, given a political requirement like “if the argument to increase taxes is accepted, then the argument to increase services must be accepted too,” we can either verify an extension of acceptable arguments, or all extensions of an argumentation framework, or all extensions of all argumentation frameworks satisfying a framework specification. We introduce the logic of argumentation verification to specify such requirements, and we represent the three verification problems of argumentation as model checking and theorem proving properties of the logic. Moreover, we recast the logic of argumentation verification in a modal framework, in order to express multiple extensions, and properties like transitivity and reflexivity of the attack relation. Finally, we introduce a logic of meta-argumentation where abstract argumentation is used to reason about abstract argumentation itself. We define the logic of meta-argumentation using the fibring methodology in such a way to represent attack relations not only among arguments but also among attacks. [less ▲]

Detailed reference viewed: 120 (5 UL)
Full Text
Peer Reviewed
See detailModelling defeasible and prioritized support in bipolar argumentation
Villata, Serena; Boella, Guido; Gabbay, Dov M. UL et al

in Annals of Mathematics & Artificial Intelligence (2012), 66(1-4), 163-197

Cayrol and Lagasquie-Schiex introduce bipolar argumentation frameworks by introducing a second relation on the arguments for representing the support among them. The main drawback of their approach is ... [more ▼]

Cayrol and Lagasquie-Schiex introduce bipolar argumentation frameworks by introducing a second relation on the arguments for representing the support among them. The main drawback of their approach is that they cannot encode defeasible support, for instance they cannot model an attack towards a support relation. In this paper, we introduce a way to model defeasible support in bipolar argumentation frameworks. We use the methodology of meta-argumentation in which Dung’s theory is used to reason about itself. Dung’s well-known admissibility semantics can be used on this meta-argumentation framework to compute the acceptable arguments, and all properties of Dung’s classical theory are preserved. Moreover, we show how different contexts can lead to the alternative strengthening of the support relation over the attack relation, and converse. Finally, we present two applications of our methodology for modeling support, the case of arguments provided with an internal structure and the case of abstract dialectical frameworks. [less ▲]

Detailed reference viewed: 109 (5 UL)
Full Text
Peer Reviewed
See detailLogics for Security and Privacy
van der Torre, Leon UL

in 2012 (2012)

In this presentation I first review new developments of deontic logic in computer science, then I discuss the use of dynamic epistemic deontic logic to reason about privacy policies, and finally I discuss ... [more ▼]

In this presentation I first review new developments of deontic logic in computer science, then I discuss the use of dynamic epistemic deontic logic to reason about privacy policies, and finally I discuss the use of modal logic for access control. This presentation is based on joint work with Guillaume Aucher, Guido Boella, Jan Broersen, Dov Gabbay and Valerio Genovese. [less ▲]

Detailed reference viewed: 99 (2 UL)