Michael Benedikt

According to our database1, Michael Benedikt authored at least 127 papers between 1996 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Guest Editorial: Special Issue on Database Theory.
Theory Comput. Syst., 2019

Reasoning about Disclosure in Data Integration in the Presence of Source Constraints.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018
Logic-based Perspectives on Query Reformulationover Restricted Interfaces.
SIGMOD Record, 2018

Some Model Theory of Guarded Negation.
J. Symb. Log., 2018

Logical foundations of information disclosure in ontology-based data integration.
Artif. Intell., 2018

How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)?
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

When Can We Answer Queries Using Result-Bounded Data Interfaces?
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Form Filling Based on Constraint Solving.
Proceedings of the Web Engineering - 18th International Conference, 2018

Goal-Driven Query Answering for Existential Rules With Equality.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Determinacy and rewriting of functional top-down and MSO tree transformations.
J. Comput. Syst. Sci., 2017

Benchmarking the Chase.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Polynomial automata: Zeroness and applications.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

ArtForm: a tool for exploring the codebase of form-based websites.
Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, Santa Barbara, CA, USA, July 10, 2017

Reformulating Queries: Theory and Practice.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Characterizing Definability in Decidable Fixpoint Logics.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Source Information Disclosure in Ontology-Based Data Integration.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation
Synthesis Lectures on Data Management, Morgan & Claypool Publishers, 2016

Generating Plans from Proofs.
ACM Trans. Database Syst., 2016

Limiting Until in Ordered Tree Query Languages.
ACM Trans. Comput. Log., 2016

SPARQLByE: Querying RDF data by example.
PVLDB, 2016

Querying Visible and Invisible Information.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

A Step Up in Expressiveness of Decidable Fixpoint Logics.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Biological Web Services: Integration, Optimization, and Reasoning.
Proceedings of the Workshop on Advances in Bioinformatics and Artificial Intelligence: Bridging the Gap co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), 2016

Query Answering with Transitive and Linear-Ordered Data.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Analysis of Schemas with Access Restrictions.
ACM Trans. Database Syst., 2015

Querying with Access Patterns and Integrity Constraints.
PVLDB, 2015

The complexity of higher-order queries.
Inf. Comput., 2015

The Complexity of Boundedness for Guarded Logics.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Interpolation with Decidable Fixpoint Logics.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Finite Open-World Query Answering with Number Restrictions.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Combining Existential Rules and Description Logics.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
The per-character cost of repairing word languages.
Theor. Comput. Sci., 2014

PDQ: Proof-driven Query Answering over Web-based Data.
PVLDB, 2014

Querying and Reasoning Under Expressive Constraints (Dagstuhl Seminar 14331).
Dagstuhl Reports, 2014

Generating low-cost plans from proofs.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

The ICDT 2014 Test of Time Award.
Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014

Effective interpolation and preservation in guarded logics.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Logical Approaches to Query Optimization over Web-Based Sources.
Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management, 2014

2013
Report on the first workshop on innovative querying of streams.
SIGMOD Record, 2013

Aggregating Semantic Annotators.
PVLDB, 2013

ROSeAnn: Reconciling Opinions of Semantic Annotators.
PVLDB, 2013

Bounded repairability of word languages.
J. Comput. Syst. Sci., 2013

Two Variable vs. Linear Temporal Logic in Model Checking and Games
Logical Methods in Computer Science, 2013

LTL Model Checking of Interval Markov Chains.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

The ACM PODS Alberto O. Mendelzon test-of-time award 2013.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

Determinacy and Rewriting of Top-Down and MSO Tree Transformations.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Rewriting Guarded Negation Queries.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Bisimilarity of Pushdown Automata is Nonelementary.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Access patterns and integrity constraints revisited.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Complexity of Two-Variable Logic on Finite Trees.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Report on PODS 2012.
SIGACT News, 2012

Querying Schemas With Access Restrictions.
PVLDB, 2012

ProFoUnd: program-analysis-based form understanding.
Proceedings of the 21st World Wide Web Conference, 2012

Higher­Order Functions and Structured Datatypes.
Proceedings of the 15th International Workshop on the Web and Databases 2012, 2012

Verification of Two-Variable Logic Revisited.
Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012

Monadic Datalog Containment.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

QUASAR: querying annotation, structure, and reasoning.
Proceedings of the 15th International Conference on Extending Database Technology, 2012

2011
HOMES: A Higher-Order Mapping Evaluation System.
PVLDB, 2011

Determining relevance of accesses at runtime.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Regular Repair of Specifications.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Complexity of higher-order queries.
Proceedings of the Database Theory, 2011

The Cost of Traveling between Languages.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Two Variable vs. Linear Temporal Logic in Model Checking and Games.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Databases.
Proceedings of the Computer Science, The Hardware, Software and Heart of It, 2011

2010
Report on the EDBT/ICDT 2010 workshop on updates in XML.
SIGMOD Record, 2010

Probabilistic XML via Markov Chains.
PVLDB, 2010

The Impact of Virtual Views on Containment.
PVLDB, 2010

Destabilizers and Independence of XML Updates.
PVLDB, 2010

Positive higher-order queries.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

Analysis of declarative updates: invited talk.
Proceedings of the 2010 EDBT/ICDT Workshops, Lausanne, Switzerland, March 22-26, 2010, 2010

Automata vs. Logics on Data Words.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

What You Must Remember When Processing Data Words.
Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management, 2010

2009
From XQuery to relational logics.
ACM Trans. Database Syst., 2009

Regular tree languages definable in FO and in FOmod.
ACM Trans. Comput. Log., 2009

Schema-Based Independence Analysis for XML Updates.
PVLDB, 2009

Towards a characterization of order-invariant queries over tame graphs.
J. Symb. Log., 2009

How big must complete XML query languages be?
Proceedings of the Database Theory, 2009

Semantics, Types and Effects for XML Updates.
Proceedings of the Database Programming Languages, 2009

2008
Efficient network aware search in collaborative tagging sites.
PVLDB, 2008

XPath leashed.
ACM Comput. Surv., 2008

Stream firewalling of xml constraints.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

2007
Logical definability and query languages over ranked and unranked trees.
ACM Trans. Comput. Log., 2007

Database Theory 2004.
J. Comput. Syst. Sci., 2007

Challenges in Searching Online Communities.
IEEE Data Eng. Bull., 2007

Efficient and Expressive Tree Filters.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006
A characterization of first-order topological properties of planar spatial data.
J. ACM, 2006

Interpreting Tree-to-Tree Queries.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Data Cleaning for Decision Support.
Proceedings of the First Int'l VLDB Workshop on Clean Databases, 2006

2005
Analysis of recursive state machines.
ACM Trans. Program. Lang. Syst., 2005

Adding Updates to XQuery: Semantics, Optimization, and Static Analysis.
Proceedings of the Second International Workshop on XQuery Implementation, 2005

Regular Tree Languages Definable in FO.
Proceedings of the STACS 2005, 2005

XPath satisfiability in the presence of DTDs.
Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

An Insider's Guide to Logic in Telecommunications Data.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

XML Subtree Queries: Specification and Composition.
Proceedings of the Database Programming Languages, 10th International Symposium, 2005

Towards a Characterization of Order-Invariant Queries over Tame Structures.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

Verification of Tree Updates for Optimization.
Proceedings of the Computer Aided Verification, 17th International Conference, 2005

2004
A Characterization of First-Order Topological Properties of Planar Spatial Data.
Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

On Guard: Producing Run-Time Checks from Integrity Constraints.
Proceedings of the Algebraic Methodology and Software Technology, 2004

2003
Definability with a predicate for a semi-linear set.
J. Symb. Log., 2003

Definable relations and first-order query languages over strings.
J. ACM, 2003

Capturing both Types and Constraints in Data Integration.
Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003

E-services: a look behind the curtain.
Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

Structural Properties of XPath Fragments.
Proceedings of the Database Theory, 2003

2002
Aggregate Operators in Constraint Query Languages.
J. Comput. Syst. Sci., 2002

DTD-Directed Publishing with Attribute Translation Grammars.
Proceedings of 28th International Conference on Very Large Data Bases, 2002

Tree Extension Algebras: Logics, Automata, and Query Languages.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

2001
String Operations in Query Languages.
Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2001

A Model-Theoretic Approach to Regular String Relations.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

Model Checking of Unrestricted Hierarchical State Machines.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Relational queries over interpreted structures.
J. ACM, 2000

Reachability and Connectivity Queries in Constraint Databases.
Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2000

Definability over Linear Constraints.
Proceedings of the Computer Science Logic, 2000

Query Safety with Constraints.
Proceedings of the Constraint Databases, 2000

Expressive Power: The Finite Case.
Proceedings of the Constraint Databases, 2000

1999
Hierarchies of Measure-Theoretic Ultrafilters.
Ann. Pure Appl. Logic, 1999

Exact and Approximate Aggregation in Constraint Query.
Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

A Decidable Logic for Describing Linked Data Structures.
Proceedings of the Programming Languages and Systems, 1999

1998
Ultrafilters which Extend Measures.
J. Symb. Log., 1998

Safe Constraint Queries.
Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998

Embedded Finite Models, Stability Theory and the Impact of Order.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997
Languages for Relational Databases over Interpreted Structures.
Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1997

Expressive Power of Unary Counters.
Proceedings of the Database Theory, 1997

Experience with a Domain Specific Language for Form-based Services.
Proceedings of the Conference on Domain-Specific Languages, 1997

Expressive Power of Unary Counters.
Proceedings of the Structures in Logic and Computer Science, 1997

1996
Verifiable Properties of Database Transactions.
Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1996

Relational Expressive Power of Constraint Query Languages.
Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1996

On the Structure of Queries in Constraint Query Languages.
Proceedings of the Proceedings, 1996


  Loading...