B
Balder ten Cate
Researcher at University of California, Santa Cruz
Publications - 105
Citations - 3086
Balder ten Cate is an academic researcher from University of California, Santa Cruz. The author has contributed to research in topics: Data exchange & Conjunctive query. The author has an hindex of 31, co-authored 96 publications receiving 2808 citations. Previous affiliations of Balder ten Cate include Google & École normale supérieure de Cachan.
Papers
More filters
Book ChapterDOI
14 Hybrid logics
Carlos Areces,Balder ten Cate +1 more
TL;DR: This chapter discusses the proof theory, expressivity, and complexity of a number of the well-known hybrid logics and provides a snapshot of the logical territory lying between the basic modal languages and their classical companions.
Proceedings ArticleDOI
Design and Implementation of the LogicBlox System
Molham Aref,Balder ten Cate,Todd J. Green,Benny Kimelfeld,Dan Olteanu,Emir Pasalic,Todd L. Veldhuizen,Geoffrey Washburn +7 more
TL;DR: The design considerations behind the LogicBlox system are discussed and the use of purely functional data structures; novel join processing strategies; advanced incremental maintenance and live programming facilities; and a novel concurrency control scheme are given.
Proceedings ArticleDOI
Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP
TL;DR: This paper studies several classes of ontology-mediated queries, where the database queries are given as some form of conjunctive query and the ontologies are formulated in description logics or other relevant fragments of first-order logic, such as the guarded fragment and the unary-negation fragment.
Journal ArticleDOI
Ontology-Based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP
TL;DR: It is shown that popular ontology-mediated query languages have the same expressive power as natural fragments of disjunctive datalog, and the relative succinctness of ontology's queries is studied, to establish intimate connections between ontological-mediated queries and constraint satisfaction problems (CSPs) and their logical generalization, MMSNP formulas.
Proceedings ArticleDOI
Designing and refining schema mappings via data examples
TL;DR: This work presents a novel paradigm and develops a system for the interactive design of schema mappings via data examples and proves that this problem is complete for the second level of the polynomial hierarchy, hence, in a precise sense, harder than NP-complete.