| Generating collection transformations from proofs | 0 | 0.34 | 2021 |
| Balancing Expressiveness and Inexpressiveness in View Design | 0 | 0.34 | 2021 |
| Inference from Visible Information and Background Knowledge | 0 | 0.34 | 2021 |
| Finite Open-world Query Answering with Number Restrictions | 0 | 0.34 | 2020 |
| Monadic Datalog, Tree Validity, and Limited Access Containment | 0 | 0.34 | 2020 |
| On monotonic determinacy and rewritability for recursive queries and views | 0 | 0.34 | 2020 |
| Balancing expressiveness and inexpressiveness in view design | 0 | 0.34 | 2020 |
| DEFINABILITY AND INTERPOLATION WITHIN DECIDABLE FIXPOINT LOGICS | 0 | 0.34 | 2019 |
| Reasoning about disclosure in data integration in the presence of source constraints. | 0 | 0.34 | 2019 |
| Goal-Driven Query Answering for Existential Rules with Equality | 0 | 0.34 | 2018 |
| Some Model Theory of Guarded Negation. | 0 | 0.34 | 2018 |
| Logical foundations of information disclosure in ontology-based data integration. | 3 | 0.50 | 2018 |
| Logic-based Perspectives on Query Reformulationover Restricted Interfaces. | 0 | 0.34 | 2018 |
| How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)? | 0 | 0.34 | 2018 |
| Characterizing Definability in Decidable Fixpoint Logics. | 1 | 0.34 | 2017 |
| ArtForm: a tool for exploring the codebase of form-based websites. | 2 | 0.36 | 2017 |
| Source Information Disclosure in Ontology-Based Data Integration. | 2 | 0.35 | 2017 |
| Reformulating Queries: Theory and Practice. | 2 | 0.36 | 2017 |
| Determinacy and rewriting of functional top-down and MSO tree transformations. | 0 | 0.34 | 2017 |
| When Can We Answer Queries Using Result-Bounded Data Interfaces? | 0 | 0.34 | 2017 |
| Benchmarking the Chase. | 1 | 0.35 | 2017 |
| SPARQLByE: Querying RDF data by example. | 0 | 0.34 | 2016 |
| SPARQLByE: Querying RDF data by example. | 10 | 0.56 | 2016 |
| Querying Visible and Invisible Information. | 2 | 0.35 | 2016 |
| Query Answering with Transitive and Linear-Ordered Data. | 3 | 0.39 | 2016 |
| A Step Up in Expressiveness of Decidable Fixpoint Logics. | 5 | 0.40 | 2016 |
| Generating Plans from Proofs. | 5 | 0.41 | 2016 |
| Biological Web Services: Integration, Optimization, and Reasoning. | 2 | 0.35 | 2016 |
| Limiting until in ordered tree query languages | 0 | 0.34 | 2016 |
| Querying Visible and Invisible Tables in the Presence of Integrity Constraints | 2 | 0.38 | 2015 |
| Querying with access patterns and integrity constraints | 13 | 0.57 | 2015 |
| The Complexity of Boundedness for Guarded Logics | 7 | 0.45 | 2015 |
| Finite Open-World Query Answering with Number Restrictions | 5 | 0.48 | 2015 |
| The complexity of higher-order queries | 0 | 0.34 | 2015 |
| Combining Existential Rules and Description Logics (Extended Version) | 0 | 0.34 | 2015 |
| Analysis of Schemas with Access Restrictions | 1 | 0.36 | 2015 |
| Querying with Access Patterns and Integrity Constraints. | 0 | 0.34 | 2015 |
| Interpolation with Decidable Fixpoint Logics | 0 | 0.34 | 2015 |
| The per-character cost of repairing word languages. | 2 | 0.40 | 2014 |
| PDQ: Proof-driven Query Answering over Web-based Data. | 0 | 0.34 | 2014 |
| Querying and Reasoning Under Expressive Constraints (Dagstuhl Seminar 14331). | 0 | 0.34 | 2014 |
| Effective interpolation and preservation in guarded logics | 0 | 0.34 | 2014 |
| Effective interpolation and preservation in guarded logics | 2 | 0.40 | 2014 |
| Generating low-cost plans from proofs | 7 | 0.51 | 2014 |
| PDQ: proof-driven query answering over web-based data | 5 | 0.42 | 2014 |
| Aggregating semantic annotators | 3 | 0.45 | 2013 |
| Rewriting Guarded Negation Queries. | 2 | 0.37 | 2013 |
| Two Variable vs. Linear Temporal Logic in Model Checking and Games | 0 | 0.34 | 2013 |
| Access patterns and integrity constraints revisited | 6 | 0.49 | 2013 |
| ROSeAnn: reconciling opinions of semantic annotators | 1 | 0.35 | 2013 |
