BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Canada
1 × China
1 × Cyprus
1 × France
1 × Greece
1 × Japan
1 × Poland
1 × Portugal
1 × Switzerland
1 × United Kingdom
2 × Australia
3 × USA
Collaborated with:
M.Benedikt M.V.Boom L.Segoufin C.Lutz P.G.Kolaitis W.C.Tan V.Bárány B.Alexe G.Fontaine A.Gheerbrant M.Franceschet E.Tsamoura M.Otto J.v.Benthem J.A.Väänänen T.Colcombet C.Civili E.Sherkhonov W.Tan M.Bienvenu F.Wolter L.Chiticariu W.Conradie M.Marx Y.Venema M.Aref T.J.Green B.Kimelfeld D.Olteanu E.Pasalic T.L.Veldhuizen G.Washburn
Talks about:
logic (9) guard (4) interpol (3) complex (3) schema (3) design (3) queri (3) path (3) data (3) map (3)

Person: Balder ten Cate

DBLP DBLP: Cate:Balder_ten

Contributed to:

LICS 20152015
PODS 20152015
SIGMOD 20152015
CSL-LICS 20142014
PODS 20142014
PODS 20132013
VLDB 20122012
ICALP (2) 20112011
SIGMOD 20112011
VLDB 20112011
FOSSACS 20102010
CSL 20092009
VLDB 20092009
PODS 20082008
LICS 20072007
PODS 20072007
KR 20062006
PODS 20062006
CSL 20052005
KR 20022002

Wrote 21 papers:

LICS-2015-BenediktCB #decidability #fixpoint #logic
Interpolation with Decidable Fixpoint Logics (MB, BtC, MVB), pp. 378–389.
LICS-2015-BenediktCCB #bound #complexity #logic
The Complexity of Boundedness for Guarded Logics (MB, BtC, TC, MVB), pp. 293–304.
PODS-2015-CateCST #ontology #using
High-Level Why-Not Explanations using Ontologies (BtC, CC, ES, WCT), pp. 31–43.
SIGMOD-2015-ArefCGKOPVW #design #implementation
Design and Implementation of the LogicBlox System (MA, BtC, TJG, BK, DO, EP, TLV, GW), pp. 1371–1382.
LICS-CSL-2014-BenediktCB #effectiveness #logic
Effective interpolation and preservation in guarded logics (MB, BtC, MVB), p. 10.
PODS-2014-BenediktCT #generative #low cost #proving
Generating low-cost plans from proofs (MB, BtC, ET), pp. 200–211.
PODS-2013-BienvenuCLW #case study #csp #data access #datalog #ontology
Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP (MB, BtC, CL, FW), pp. 213–224.
VLDB-2012-BaranyCO #query
Queries with Guarded Negation (VB, BtC, MO), pp. 1328–1339.
Guarded Negation (VB, BtC, LS), pp. 356–367.
SIGMOD-2011-AlexeCKT #design
Designing and refining schema mappings via data examples (BA, BtC, PGK, WCT), pp. 133–144.
VLDB-2011-AlexeCKT #design #interactive #named #refinement
EIRENE: Interactive Design and Refinement of Schema Mappings via Data Examples (BA, BtC, PGK, WCT), pp. 1414–1417.
FoSSaCS-2010-CateF #calculus #finite #proving #μ-calculus
An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees (BtC, GF), pp. 161–175.
CSL-2009-GheerbrantC #linear
Craig Interpolation for Linear Temporal Languages (AG, BtC), pp. 287–301.
VLDB-2009-CateCKT #query #sql
Laconic Schema Mappings: Computing the Core with SQL Queries (BtC, LC, PGK, WCT), pp. 1006–1017.
PODS-2008-CateS #automaton #logic #transitive #xpath
XPath, transitive closure logic, and nested tree walking automata (BtC, LS), pp. 251–260.
LICS-2007-CateBV #first-order #logic #theorem
Lindstrom theorems for fragments of first-order logic (BtC, JvB, JAV), pp. 280–292.
PODS-2007-CateL #complexity #query #xpath
The complexity of query containment in expressive fragments of XPath 2.0 (BtC, CL), pp. 73–82.
KR-2006-CateCMV #logic
Definitorially Complete Description Logics (BtC, WC, MM, YV), pp. 79–89.
PODS-2006-Cate #transitive #xpath
The expressivity of XPath with transitive closure (BtC), pp. 328–337.
CSL-2005-CateF #complexity #hybrid #logic #on the
On the Complexity of Hybrid Logics with Binders (BtC, MF), pp. 339–354.
KR-2002-Cate #logic #on the
On the Logic of d-separation (BtC), pp. 568–577.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.