Zobrazeno 1 - 10
of 82
pro vyhledávání: '"Balder ten Cate"'
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
Autor:
Luc Segoufin, Balder ten Cate
Publikováno v:
Logical Methods in Computer Science, Vol Volume 9, Issue 3 (2013)
We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and the $\mu$
Externí odkaz:
https://doaj.org/article/006e45219f3c4d108d29264b660d94cb
Autor:
Amélie Gheerbrant, Balder ten Cate
Publikováno v:
Logical Methods in Computer Science, Vol Volume 8, Issue 4 (2012)
We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present axiomatizations o
Externí odkaz:
https://doaj.org/article/ba92e3ffc4fb4710a5473db870ef1eec
Publikováno v:
Logical Methods in Computer Science, Vol Volume 5, Issue 3 (2009)
Lindstr\"om theorems characterize logics in terms of model-theoretic conditions such as Compactness and the L\"owenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic. But on the other hand, many
Externí odkaz:
https://doaj.org/article/87fae7217b5f42a291f9f8c3195a4eb8
Publikováno v:
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic, 2021
ACM Transactions on Computational Logic, Association for Computing Machinery, 2021
ACM Transactions on Computational Logic, Association for Computing Machinery, 2021, 22, pp.1-69. ⟨10.1145/3452919⟩
ACM Transactions on Computational Logic, 2021, 22, pp.1-69. ⟨10.1145/3452919⟩
ACM Transactions on Computational Logic, 22(2):13. Association for Computing Machinery (ACM)
ACM Transactions on Computational Logic, 2021
ACM Transactions on Computational Logic, Association for Computing Machinery, 2021
ACM Transactions on Computational Logic, Association for Computing Machinery, 2021, 22, pp.1-69. ⟨10.1145/3452919⟩
ACM Transactions on Computational Logic, 2021, 22, pp.1-69. ⟨10.1145/3452919⟩
ACM Transactions on Computational Logic, 22(2):13. Association for Computing Machinery (ACM)
We provide a wide-ranging study of the scenario where a subset of the relations in a relational vocabulary is visible to a user—that is, their complete contents are known—while the remaining relations are invisible. We also have a background theo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::21d6612b3a40f577c782a498df186f87
https://doi.org/10.1145/3452919
https://doi.org/10.1145/3452919
Autor:
Balder ten Cate
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37f805e7f4ec57ad774668c5306653a1
https://doi.org/10.2139/ssrn.4137209
https://doi.org/10.2139/ssrn.4137209
Query reformulation refers to a process of translating a source query—a request for information in some high-level logic-based language—into a target plan that abides by certain interface restrictions. Many practical problems in data management c
Publikováno v:
ACM Transactions on Database Systems. 42:1-41
In recent years, data examples have been at the core of several different approaches to schema-mapping design. In particular, Gottlob and Senellart introduced a framework for schema-mapping discovery from a single data example, in which the derivatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfdf40ad80e4f419260306a488b5f88d
https://doi.org/10.1145/3044712
https://doi.org/10.1145/3044712
Publikováno v:
Proceedings of the Second Workshop on Shortcomings in Vision and Language.
There has been significant interest recently in learning multilingual word embeddings -- in which semantically similar words across languages have similar embeddings. State-of-the-art approaches have relied on expensive labeled data, which is unavail
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f3cd44387a9e83a9c7d60feec049c27
https://doi.org/10.18653/v1/w19-1807
https://doi.org/10.18653/v1/w19-1807
Publikováno v:
Journal of Symbolic Logic. 83(4)
The Guarded Negation Fragment (GNFO) is a fragment of first-order logic that contains all positive existential formulas, can express the first-order translations of basic modal logic and of many description logics, along with many sentences that aris
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e928a404f02a2f98697ca010a6615073
http://ora.ox.ac.uk/objects/uuid:
http://ora.ox.ac.uk/objects/uuid: