Zobrazeno 1 - 10
of 167
pro vyhledávání: '"MEIER, ARNE"'
We study consistent query answering via different graph representations. First, we introduce solution-conflict hypergraphs in which nodes represent facts and edges represent either conflicts or query solutions. Considering a monotonic query and a set
Externí odkaz:
http://arxiv.org/abs/2412.08324
We present team semantics for two of the most important linear and branching time specification languages, Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). With team semantics, LTL is able to express hyperproperties, which have in the la
Externí odkaz:
http://arxiv.org/abs/2409.18667
Autor:
Gutleben, Jan, Meier, Arne
The A-hierarchy is a parametric analogue of the polynomial hierarchy in the context of paramterised complexity theory. We give a new characterisation of the A-hierarchy in terms of a generalisation of the SUBSET-SUM problem.
Externí odkaz:
http://arxiv.org/abs/2409.07996
Abstract argumentation is a popular toolkit for modeling, evaluating, and comparing arguments. Relationships between arguments are specified in argumentation frameworks (AFs), and conditions are placed on sets (extensions) of arguments that allow AFs
Externí odkaz:
http://arxiv.org/abs/2408.10683
Autor:
Fröhlich, Nicolas, Meier, Arne
Expressing system specifications using Computation Tree Logic (CTL) formulas, formalising programs using Kripke structures, and then model checking the system is an established workflow in program verification and has wide applications in AI. In this
Externí odkaz:
http://arxiv.org/abs/2312.09868
We introduce a general abstract framework for database repairing in which the repair notions are defined using formal logic. We differentiate between integrity constraints and the so-called query constraints. The former are used to model consistency
Externí odkaz:
http://arxiv.org/abs/2306.15516
We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic independence logic with the Boolean negation, and a recently introduced l
Externí odkaz:
http://arxiv.org/abs/2306.00420
In this article, we study the complexity of weighted team definability for logics with team semantics. This problem is a natural analogue of one of the most studied problems in parameterized complexity, the notion of weighted Fagin-definability, whic
Externí odkaz:
http://arxiv.org/abs/2302.00541
Temporal logics have been studied as an approach to the specification of hyperproperties, resulting in the conception of "hyperlogics". With a few recent exceptions, the hyperlogics thus far developed can only relate different traces of a transition
Externí odkaz:
http://arxiv.org/abs/2110.12699