97 research outputs found
Rational Verification in Iterated Electric Boolean Games
Electric boolean games are compact representations of games where the players
have qualitative objectives described by LTL formulae and have limited
resources. We study the complexity of several decision problems related to the
analysis of rationality in electric boolean games with LTL objectives. In
particular, we report that the problem of deciding whether a profile is a Nash
equilibrium in an iterated electric boolean game is no harder than in iterated
boolean games without resource bounds. We show that it is a PSPACE-complete
problem. As a corollary, we obtain that both rational elimination and rational
construction of Nash equilibria by a supervising authority are PSPACE-complete
problems.Comment: In Proceedings SR 2016, arXiv:1607.0269
Non-normal modalities in variants of Linear Logic
This article presents modal versions of resource-conscious logics. We
concentrate on extensions of variants of Linear Logic with one minimal
non-normal modality. In earlier work, where we investigated agency in
multi-agent systems, we have shown that the results scale up to logics with
multiple non-minimal modalities. Here, we start with the language of
propositional intuitionistic Linear Logic without the additive disjunction, to
which we add a modality. We provide an interpretation of this language on a
class of Kripke resource models extended with a neighbourhood function: modal
Kripke resource models. We propose a Hilbert-style axiomatization and a
Gentzen-style sequent calculus. We show that the proof theories are sound and
complete with respect to the class of modal Kripke resource models. We show
that the sequent calculus admits cut elimination and that proof-search is in
PSPACE. We then show how to extend the results when non-commutative connectives
are added to the language. Finally, we put the logical framework to use by
instantiating it as logics of agency. In particular, we propose a logic to
reason about the resource-sensitive use of artefacts and illustrate it with a
variety of examples
Logical operators for ontological modeling
We show that logic has more to offer to ontologists than standard first order
and modal operators. We first describe some operators of linear logic which we
believe are particularly suitable for ontological modeling, and suggest how to interpret
them within an ontological framework. After showing how they can coexist
with those of classical logic, we analyze three notions of artifact from the literature
to conclude that these linear operators allow for reducing the ontological commitment
needed for their formalization, and even simplify their logical formulation
Reasoning about coalitional agency and ability in the logics of "bringing-it-about"
The logics of "bringing-it-about" have been part of a prominent tradition for the formalization of individual and institutional agency. They are the logics to talk about what states of affairs an acting entity brings about while abstracting away from the means of action. Elgesem\u27s proposal analyzes the agency of individual agents as the goal-directed manifestation of an individual ability. It has become an authoritative modern reference. The first contribution of this paper is to extend Elgesem\u27s logic of individual agency and ability to coalitions. We present a general theory and later propose several possible specializations. As a second contribution, we offer algorithms to reason with the logics of bringing-it-about and we analyze their computational complexity
Two Approaches to Ontology Aggregation Based on Axiom Weakening
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
- …