Axiom weakening is a novel technique that allows for fine-grained repair of inconsistent ontologies. In a multi-agent setting, integrating ontologies corresponding to multiple agents may lead to inconsistencies. Such inconsistencies can be resolved after the integrated ontology has been built, or their generation can be prevented during ontology generation. We implement and compare these two approaches. First, we study how to repair an inconsistent ontology resulting from a voting-based aggregation of views of heterogeneous agents. Second, we prevent the generation of inconsistencies by letting the agents engage in a turn-based rational protocol about the axioms to be added to the integrated ontology. We instantiate the two approaches using real-world ontologies and compare them by measuring the levels of satisfaction of the agents w.r.t. the ontology obtained by the two procedures.
In Team Semantics, a dependency notion is strongly first order if every sentence of the logic obtained by adding the corresponding atoms to First-Order Logic is equivalent to some first-order sentence. In this work it is shown that all nontrivial dependency atoms that are strongly first order, downwards closed, and relativizable (in the sense that the relativizations of the corresponding atoms with respect to some unary predicate are expressible in terms of them) are definable in terms of constancy atoms. Additionally, it is shown that any strongly first-order dependency is safe for any family of downwards closed dependencies, in the sense that every sentence of the logic obtained by adding to First-Order Logic both the strongly first-order dependency and the downwards closed dependencies is equivalent to some sentence of the logic obtained by adding only the downwards closed dependencies.
7 September 2018 in Electronic Proceedings in Theoretical Computer Science
I consider the question of which dependencies are safe for a Team Semantics-based logic FO(D), in the sense that they do not increase its expressive power over sentences when added to it. I show that some dependencies, like totality, non-constancy and non-emptiness, are safe for all logics FO(D), and that other dependencies, like constancy, are not safe for FO(D) for some choices of D despite being strongly first order (that is, safe for FO(/ 0)). I furthermore show that the possibility operator ⋄φ , which holds in a team if and only if φ holds in some nonempty subteam, can be added to any logic FO(D) without increasing its expressive power over sentences.
18 September 2019 in Electronic Proceedings in Theoretical Computer Science
Team Semantics generalizes Tarski's Semantics for First Order Logic by allowing formulas to be satisfied or not satisfied by sets of assignments rather than by single assignments. Because of this, in Team Semantics it is possible to extend the language of First Order Logic via new types of atomic formulas that express dependencies between different assignments. Some of these extensions are much more expressive than First Order Logic proper; but the problem of which atoms can instead be added to First Order Logic without increasing its expressive power is still unsolved. In this work, I provide an answer to this question under the additional assumptions (true of most atoms studied so far) that the dependency atoms are relativizable and non-jumping. Furthermore, I show that the global (or Boolean) disjunction connective can be added to any strongly first order family of dependencies without increasing the expressive power, but that the same is not true in general for non strongly first order dependencies.