Delegation of Obligations and Responsibility

Part 6: Policy Compliance and ObligationsInternational audienceIn this paper, we discuss the issue of responsibilities related to the fulfillment and the violation of obligations. We propose to formally define the different aspects of responsibility, namely causal responsibility, functional responsibility, liability as well as sanctions, and to examine how delegation influences these concepts. Our main aim is to identify the responsibility of each agent that is involved in the delegation of obligations. More precisely, we try to answer to the following questions: who is responsible for the obligation fulfillment? When a violation occurs, which agents are causally responsible for this violation? Who is liable for this violation and to whom? And finally, who must be sanctioned

Propositional fusion rules

Abstract. In previous papers, we have presented a logic-based framework for merging structured news reports [14, 16, 15]. Structured news reports are XML documents, where the text entries are restricted to individual words or simple phrases, such as names and domain-specific terminology, and numbers and units. We assume structured news reports do not require natural language processing. In this paper, we present propositional fusion rules as a way of implementing logic-based fusion for structured news reports. Fusion rules are a form of scripting language that define how structured news reports should be merged. The antecedent of a fusion rule is a call to investigate the information in the structured news reports and the background knowledge, and the consequent of a fusion rule is a formula specifying an action to be undertaken to form a merged report. It is expected that a set of fusion rules is defined for any given application. We give the syntax and mode of execution for fusion rules, and explain how the resulting actions give a merged report.

On Enumerating Models for the Logic of Paradox Using Tableau

International audienceWe extend the classic propositional tableau method in order to compute the models given by the semantics of the Priest’s paraconsistent logic of paradox. Without loss of generality, we assume that the knowledge base is represented through propositional statements in NNF, which leads to use only two rules from the classical propositional tableau calculus for computing the paraconsistent models. We consider multisets to represent branches of the tableau tree and we extend the classical closed branches in order to compute the paradoxical models of formulas of the knowledge base. A sound and complete algorithm is provided

A Modal Framework for Relating Belief and Signed Information

International audienceThe aim of this paper is to propose a modal framework for reasoning about signed information. This modal framework allows agents to keep track of information source as long as they receive information in a multi-agent system. Agents gain that they can elaborate and justify their own current belief state by considering a reliability relation over the sources of information. The belief elaboration process is considered under two perspectives: (i) from a static point of view an agent aggregates received signed information according to its preferred sources in order to build its belief and (ii) from a dynamic point of view as an agent receives information it adapts its belief state about signed information. Splitting the notions of beliefs and signed statement is useful for handling the underlying trust issue: an agent believes some statement because it may justify the statement’s origin and its reliability