Results 1-7 of 7.
((uid:50000304))

Bookmark and Share    
Full Text
See detailA Representation Theorem for Abstract Cumulative Aggregation
Ambrossio, Diego Agustin UL; Parent, Xavier UL; van der Torre, Leon UL

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: 110 (35 UL)
Full Text
Peer Reviewed
See detailCumulative Aggregation
Ambrossio, Diego Agustin UL; Parent, Xavier UL; van der Torre, Leon UL

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: 50 (5 UL)
Full Text
Peer Reviewed
See detailOn the complexity of input/output logic
Sun, Xin UL; Ambrossio, Diego Agustin UL

in Proceedings of the Fifth International Conference on Logic, Rationality and Interaction (2015)

Detailed reference viewed: 12 (1 UL)
Full Text
Peer Reviewed
See detailComputational Complexity of Input/Output Logic
Sun, Xin UL; Ambrossio, Diego Agustin UL

in Lecture Notes in Computer Science (2015), 9426

Input/output logics are abstract structures designed to represent conditional norms. The complexity of input/output logic has been sparsely developed. In this paper we study the complexity of input/output ... [more ▼]

Input/output logics are abstract structures designed to represent conditional norms. The complexity of input/output logic has been sparsely developed. In this paper we study the complexity of input/output logics. We show that the lower bound of the complexity of the fulfillment problem of 4 input/output logics is coNP, while the upper bound is either coNP or P^NP. [less ▲]

Detailed reference viewed: 20 (6 UL)
Full Text
Peer Reviewed
See detailA Logic of Trust for Reasoning about Delegation and Revocation
Cramer, Marcos UL; Ambrossio, Diego Agustin UL; van Hertum, Pieter

in Proceedings of the 20th ACM Symposium on Access Control Models and Technologies (2015)

Detailed reference viewed: 41 (6 UL)
Full Text
Peer Reviewed
See detailArgument Revival in Annotated Argumentation Networks
Ambrossio, Diego Agustin UL; Antonini, Alessio; Elrakaiby, Yehia UL et al

Scientific Conference (2013, December)

This work explores the revival of arguments in abstract argumentation theory. A revived argument is an argument that is put forward in a specific context, but is somehow put aside because it did not seem ... [more ▼]

This work explores the revival of arguments in abstract argumentation theory. A revived argument is an argument that is put forward in a specific context, but is somehow put aside because it did not seem relevant to the discussion or it has been denied, and then becomes useful in another context when a similar argument emerges. We obtain necessary conditions for argument revival using real-world examples and show that a recently proposed temporal argumentation framework cannot account for argument revival. Next, we propose an algorithm for argument revival that uses arguments annotated by a context label. This algorithm determines what arguments can be revived using the context neighborhood, the attack relations and a revival policy. [less ▲]

Detailed reference viewed: 82 (12 UL)