Browse ORBi

- What it is and what it isn't
- Green Road / Gold Road?
- Ready to Publish. Now What?
- How can I support the OA movement?
- Where can I learn more?

ORBi

Cumulative Aggregation Ambrossio, Diego Agustin ; Parent, Xavier ; van der Torre, Leon 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: 80 (11 UL)A Representation Theorem for Abstract Cumulative Aggregation Ambrossio, Diego Agustin ; Parent, Xavier ; van der Torre, Leon 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: 151 (41 UL)Computational Complexity of Input/Output Logic Sun, Xin ; Ambrossio, Diego Agustin 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: 49 (6 UL)A Logic of Trust for Reasoning about Delegation and Revocation Cramer, Marcos ; Ambrossio, Diego Agustin ; in Proceedings of the 20th ACM Symposium on Access Control Models and Technologies (2015) Detailed reference viewed: 56 (7 UL)On the complexity of input/output logic Sun, Xin ; Ambrossio, Diego Agustin in Proceedings of the Fifth International Conference on Logic, Rationality and Interaction (2015) Detailed reference viewed: 38 (1 UL)Argument Revival in Annotated Argumentation Networks Ambrossio, Diego Agustin ; ; Elrakaiby, Yehia 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: 91 (12 UL)Revival of Arguments in Temporal Argumentation Networks Van Zee, Marc ; Ambrossio, Diego Agustin ; Elrakaiby, Yehia et al Poster (2013, July 04) Detailed reference viewed: 68 (15 UL) |
||