BibSLEIGH — Michael

Travelled to:

1 × Austria
1 × China
1 × Czech Republic
1 × Denmark
1 × France
1 × Germany
1 × Japan
1 × Latvia
1 × Switzerland
1 × The Netherlands
15 × USA
2 × Greece
2 × Italy
3 × Canada
3 × United Kingdom

Collaborated with:

L.Libkin G.Puppis L.Segoufin B.t.Cate E.Tsamoura J.Cheney P.Senellart M.V.Boom G.Gottlob H.Vu W.Fan J.Leblay P.Bourhis C.Ley C.Riveros T.W.Reps A.Amarilli L.Chen S.Ortona G.Orsi C.Koch ∅ T.Schwentick H.J.Keisler J.T.Baldwin R.Lenhardt J.Worrell C.Y.Chan R.Rastogi A.Jeffrey R.Ley-Wild F.Geerts P.Godefroid S.Sagiv T.Griffin T.Colcombet S.Göller S.Kiefer A.S.Murawski E.Kharlamov D.Olteanu S.Amer-Yahia L.V.S.Lakshmanan J.Stoyanovich A.Bonifati S.Flesca A.Vyas C.Löding J.V.d.Bussche T.Wilke R.Hull V.Christophides J.Su M.Grohe G.Dong L.Wong J.Freire S.Zheng A.Zhou S.Benaim W.Charatonik E.Kieronski F.Mazowiecki

Talks about:

queri (15) constraint (9) logic (8) languag (6) data (6) order (5) tree (5) structur (4) model (4) xml (4)

Person: Michael Benedikt

DBLP: Benedikt:Michael

Facilitated 1 volumes:

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

Wrote 49 papers:

LICS-2015-AmarilliB #finite #query #strict: Finite Open-World Query Answering with Number Restrictions (AA, MB), pp. 305–316.
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.
VLDB-2015-BenediktLT #constraints #data access #query: Querying with Access Patterns and Integrity Constraints (MB, JL, ET), pp. 690–701.
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.
VLDB-2014-BenediktLT #named #query: PDQ: Proof-driven Query Answering over Web-based Data (MB, JL, ET), pp. 1553–1556.
ICALP-v2-2013-BenaimBCKLMW #complexity #finite #logic: Complexity of Two-Variable Logic on Finite Trees (SB, MB, WC, EK, RL, FM, JW), pp. 74–88.
LICS-2013-BenediktGKM #automaton #similarity: Bisimilarity of Pushdown Automata is Nonelementary (MB, SG, SK, ASM), pp. 488–498.
TACAS-2013-BenediktLW #ltl #markov #model checking: LTL Model Checking of Interval Markov Chains (MB, RL, JW), pp. 32–46.
VLDB-2013-ChenOOB #named #semantics: ROSeAnn: Reconciling Opinions of Semantic Annotators (LC, SO, GO, MB), pp. 1238–1241.
VLDB-2013-ChenOOB13a #semantics: ggregating Semantic Annotators (LC, SO, GO, MB), pp. 1486–1497.
ICALP-v2-2012-BenediktBS #datalog #monad: Monadic Datalog Containment (MB, PB, PS), pp. 79–91.
VLDB-2012-BenediktBL #query #strict: Querying Schemas With Access Restrictions (MB, PB, CL), pp. 634–645.
ICALP-v2-2011-BenediktPR #cost analysis: The Cost of Traveling between Languages (MB, GP, CR), pp. 234–245.
LICS-2011-BenediktPR #specification: Regular Repair of Specifications (MB, GP, CR), pp. 335–344.
PODS-2011-BenediktGS #runtime: Determining relevance of accesses at runtime (MB, GG, PS), pp. 211–222.
VLDB-2011-VuB #evaluation #higher-order #named: HOMES: A Higher-Order Mapping Evaluation System (HV, MB), pp. 1399–1402.
CSL-2010-BenediktLP #automaton #logic #word: Automata vs. Logics on Data Words (MB, CL, GP), pp. 110–124.
PODS-2010-BenediktPV #higher-order #query: Positive higher-order queries (MB, GP, HV), pp. 27–38.
VLDB-2010-BenediktC #independence #xml: Destabilizers and Independence of XML Updates (MB, JC), pp. 906–917.
VLDB-2010-BenediktG: The Impact of Virtual Views on Containment (MB, GG), pp. 297–308.
VLDB-2010-BenediktKOS #markov #probability #xml: Probabilistic XML via Markov Chains (MB, EK, DO, PS), pp. 770–781.
VLDB-2009-BenediktC #analysis #independence #xml: Schema-Based Independence Analysis for XML Updates (MB, JC), pp. 61–72.
SIGMOD-2008-BenediktJL #constraints #xml: Stream firewalling of xml constraints (MB, AJ, RLW), pp. 487–498.
VLDB-2008-Amer-YahiaBLS #collaboration #network #performance: Efficient network aware search in collaborative tagging sites (SAY, MB, LVSL, JS), pp. 710–721.
ICALP-v2-2006-BenediktK #query: Interpreting Tree-to-Tree Queries (MB, CK), pp. 552–564.
CAV-2005-BenediktBFV #optimisation #verification: Verification of Tree Updates for Optimization (MB, AB, SF, AV), pp. 379–393.
CSL-2005-BenediktS #invariant #query #towards: Towards a Characterization of Order-Invariant Queries over Tame Structures (MB, LS), pp. 276–291.
LICS-2005-Benedikt #logic: An Insider’s Guide to Logic in Telecommunications Data (MB), pp. 104–105.
PODS-2005-BenediktFG #satisfiability #xpath: XPath satisfiability in the presence of DTDs (MB, WF, FG), pp. 25–36.
PODS-2004-BenediktLBW #first-order: A Characterization of First-Order Topological Properties of Planar Spatial Data (MB, CL, JVdB, TW), pp. 107–114.
PODS-2003-HullBCS #named: E-services: a look behind the curtain (RH, MB, VC, JS), pp. 1–14.
SIGMOD-2003-BenediktCFFR #constraints #integration: Capturing both Types and Constraints in Data Integration (MB, CYC, WF, JF, RR), pp. 277–288.
LICS-2002-BenediktL #algebra #automaton #logic #query: Tree Extension Algebras: Logics, Automata, and Query Languages (MB, LL), p. 203–?.
VLDB-2002-BenediktCFRZZ: DTD-Directed Publishing with Attribute Translation Grammars (MB, CYC, WF, RR, SZ, AZ), pp. 838–849.
ICALP-2001-BenediktGR #model checking #state machine #strict: Model Checking of Unrestricted Hierarchical State Machines (MB, PG, TWR), pp. 652–666.
LICS-2001-BenediktLSS #approach #string: A Model-Theoretic Approach to Regular String Relations (MB, LL, TS, LS), pp. 431–440.
PODS-2001-BenediktLSS #query #string: String Operations in Query Languages (MB, LL, TS, LS).
CSL-2000-BenediktK #constraints #linear: Definability over Linear Constraints (MB, HJK), pp. 217–231.
PODS-2000-BenediktGLS #constraints #database #query #reachability: Reachability and Connectivity Queries in Constraint Databases (MB, MG, LL, LS), pp. 104–115.
ESOP-1999-BenediktRS #data type #decidability #linked data #logic #open data: A Decidable Logic for Describing Linked Data Structures (MB, TWR, SS), pp. 2–19.
PODS-1999-BenediktL #approximate #constraints #query: Exact and Approximate Aggregation in Constraint Query (MB, LL), pp. 102–113.
LICS-1998-BaldwinB #embedded #finite #modelling #order: Embedded Finite Models, Stability Theory and the Impact of Order (JTB, MB), pp. 490–500.
PODS-1998-BenediktL #constraints #query: Safe Constraint Queries (MB, LL), pp. 99–108.
PODS-1997-BenediktL #database #relational: Languages for Relational Databases over Interpreted Structures (MB, LL), pp. 87–98.
LICS-1996-BenediktL #constraints #on the #query: On the Structure of Queries in Constraint Query Languages (MB, LL), pp. 25–34.
PODS-1996-BenediktDLW #constraints #power of #query #relational: Relational Expressive Power of Constraint Query Languages (MB, GD, LL, LW), pp. 5–16.
PODS-1996-BenediktGL #database #transaction: Verifiable Properties of Database Transactions (MB, TG, LL), pp. 117–127.