Zobrazeno 1 - 10
of 135
pro vyhledávání: '"Wolter, Frank P."'
Definite descriptions, such as 'the General Chair of KR 2024', are a semantically transparent device for object identification in knowledge representation. In first-order modal logic, definite descriptions have been widely investigated for their non-
Externí odkaz:
http://arxiv.org/abs/2405.07656
The separation problem for a class Q of database queries is to find a query in Q that distinguishes between a given set of `positive' and `negative' data examples. Separation provides explanations of examples and underpins the query-by-example paradi
Externí odkaz:
http://arxiv.org/abs/2405.03511
Autor:
Wolter, Frank, Zakharyaschev, Michael
The interpolant existence problem (IEP) for a logic L is to decide, given formulas P and Q, whether there exists a formula I, built from the shared symbols of P and Q, such that P entails I and I entails Q in L. If L enjoys the Craig interpolation pr
Externí odkaz:
http://arxiv.org/abs/2404.02683
As well known, weak K4 and the difference logic DL do not enjoy the Craig interpolation property. Our concern here is the problem of deciding whether any given implication does have an interpolant in these logics. We show that the nonexistence of an
Externí odkaz:
http://arxiv.org/abs/2403.11255
Normal modal logics extending the logic K4.3 of linear transitive frames are known to lack the Craig interpolation property, except some logics of bounded depth such as S5. We turn this `negative' fact into a research question and pursue a non-unifor
Externí odkaz:
http://arxiv.org/abs/2312.05929
Knowledge Representation and Reasoning is a central, longstanding, and active area of Artificial Intelligence. Over the years it has evolved significantly; more recently it has been challenged and complemented by research in areas such as machine lea
Externí odkaz:
http://arxiv.org/abs/2308.04161
Algorithms for learning database queries from examples and unique characterisations of queries by examples are prominent starting points for developing automated support for query construction and explanation. We investigate how far recent results an
Externí odkaz:
http://arxiv.org/abs/2306.07662
Autor:
Fortin, Marie, Konev, Boris, Ryzhikov, Vladislav, Savateev, Yury, Wolter, Frank, Zakharyaschev, Michael
In reverse engineering of database queries, we aim to construct a query from a given set of answers and non-answers; it can then be used to explore the data further or as an explanation of the answers and non-answers. We investigate this query-by-exa
Externí odkaz:
http://arxiv.org/abs/2305.01248
None of the first-order modal logics between $\mathsf{K}$ and $\mathsf{S5}$ under the constant domain semantics enjoys Craig interpolation or projective Beth definability, even in the language restricted to a single individual variable. It follows th
Externí odkaz:
http://arxiv.org/abs/2303.04598
Autor:
Fortin, Marie, Konev, Boris, Ryzhikov, Vladislav, Savateev, Yury, Wolter, Frank, Zakharyaschev, Michael
We aim to determine which temporal instance queries can be uniquely characterised by a (polynomial-size) set of positive and negative temporal data examples. We start by considering queries formulated in fragments of propositional linear temporal log
Externí odkaz:
http://arxiv.org/abs/2205.01651