Zobrazeno 1 - 10
of 2 051
pro vyhledávání: '"A, Balder"'
Autor:
Cate, Balder ten, Kappé, Tobias
Kleene Algebra with Tests (KAT) provides an elegant algebraic framework for describing non-deterministic finite-state computations. Using a small finite set of non-deterministic programming constructs (sequencing, non-deterministic choice, and iterat
Externí odkaz:
http://arxiv.org/abs/2411.14284
A fitting algorithm for conjunctive queries (CQs) produces, given a set of positively and negatively labeled data examples, a CQ that fits these examples. In general, there may be many non-equivalent fitting CQs and thus the algorithm has some freedo
Externí odkaz:
http://arxiv.org/abs/2312.03407
Autor:
Cate, Balder ten, Comer, Jesse
We show that the guarded-negation fragment is, in a precise sense, the smallest extension of the guarded fragment with Craig interpolation. In contrast, we show that full first-order logic is the smallest extension of both the two-variable fragment a
Externí odkaz:
http://arxiv.org/abs/2310.08689
We propose bounded fitting as a scheme for learning description logic concepts in the presence of ontologies. A main advantage is that the resulting learning algorithms come with theoretical guarantees regarding their generalization to unseen example
Externí odkaz:
http://arxiv.org/abs/2305.08511
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 3 (September 4, 2024) lmcs:11328
We investigate a number of semantically defined fragments of Tarski's algebra of binary relations, including the function-preserving fragment. We address the question whether they are generated by a finite set of operations. We obtain several positiv
Externí odkaz:
http://arxiv.org/abs/2305.04656
Autor:
Cate, Balder ten, Comer, Jesse
We show that the guarded-negation fragment (GNFO) is, in a precise sense, the smallest extension of the guarded fragment (GFO) with Craig interpolation. In contrast, %we show that the smallest extension of the two-variable fragment (FO2) with Craig i
Externí odkaz:
http://arxiv.org/abs/2304.08086
Autor:
Cate, Balder ten, Koudijs, Raoul
We study the existence of finite characterisations for modal formulas. A finite characterisation of a modal formula $\varphi$ is a finite collection of positive and negative examples that distinguishes $\varphi$ from every other, non-equivalent modal
Externí odkaz:
http://arxiv.org/abs/2304.06646
A query algorithm based on homomorphism counts is a procedure for determining whether a given instance satisfies a property by counting homomorphisms between the given instance and finitely many predetermined instances. In a left query algorithm, we
Externí odkaz:
http://arxiv.org/abs/2304.06294
A Datalog program can be viewed as a syntactic specification of a functor from database instances over some schema to database instances over another schema. The same holds more generally for $\exists$Datalog. We establish large classes of Datalog an
Externí odkaz:
http://arxiv.org/abs/2302.06366
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)
We investigate a number of semantically defined fragments of Tarski's algebra of binary relations, including the function-preserving fragment. We address the question whether they are generated by a finite set of operations. We obtain several positiv
Externí odkaz:
https://doaj.org/article/0aabc79542ca4600ae1616505a27e6da
