Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Marti, Johannes"'
We study the interaction of views, queries, and background knowledge in the form of existential rules. The motivating questions concern monotonic determinacy of a query using views w.r.t. rules, which refers to the ability to recover the query answer
Externí odkaz:
http://arxiv.org/abs/2407.14907
Automata operating on infinite objects feature prominently in the theory of the modal $\mu$-calculus. One such application concerns the tableau games introduced by Niwi\'{n}ski & Walukiewicz, of which the winning condition for infinite plays can be n
Externí odkaz:
http://arxiv.org/abs/2307.06897
Autor:
Galeazzi, Paolo, Marti, Johannes
Following the decision-theoretic approach to game theory, we extend the analysis of Epstein & Wang and of Di Tillio from hierarchies of preference relations to hierarchies of choice functions. We then construct the universal choice structure containi
Externí odkaz:
http://arxiv.org/abs/2304.11575
Publikováno v:
EPTCS 346, 2021, pp. 291-307
A key result in the theory of the modal mu-calculus is the disjunctive normal form theorem by Janin & Walukiewicz, stating that every mu-calculus formula is semantically equivalent to a so-called disjunctive formula. These disjunctive formulas have g
Externí odkaz:
http://arxiv.org/abs/2109.08310
Autor:
Marti, Johannes, Venema, Yde
In this paper we introduce a cut-free sequent calculus for the alternation-free fragment of the modal $\mu$-calculus. This system allows for cyclic proofs and uses a simple focus mechanism to control the unravelling of fixpoints along infinite branch
Externí odkaz:
http://arxiv.org/abs/2103.01671
Publikováno v:
Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 October - 2 November 2018, pages 389--398, AAAI Press, 2018
In ontology-based data access, multiple data sources are integrated using an ontology and mappings. In practice, this is often achieved by a bootstrapping process, that is, the ontology and mappings are first designed to support only the most importa
Externí odkaz:
http://arxiv.org/abs/2011.09176
We discuss and compare complexity measures for the modal $\mu$-calculus, focusing on size and alternation depth. As a yardstick we take Wilke's alternating tree automata, which we shall call parity formulas in the text. Building on work by Bruse, Fri
Externí odkaz:
http://arxiv.org/abs/2010.14430
Autor:
Marti, Johannes
We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting the antec
Externí odkaz:
http://arxiv.org/abs/2006.00604
We study complete approximations of an ontology formulated in a non-Horn description logic (DL) such as $\mathcal{ALC}$ in a Horn DL such as~$\mathcal{EL}$. We provide concrete approximation schemes that are necessarily infinite and observe that in t
Externí odkaz:
http://arxiv.org/abs/2001.07754
Game logic was introduced by Rohit Parikh in the 1980s as a generalisation of propositional dynamic logic (PDL) for reasoning about outcomes that players can force in determined 2-player games. Semantically, the generalisation from programs to games
Externí odkaz:
http://arxiv.org/abs/1904.07691