The following pages link to Michael Benedikt (Q394743):
Displayed 50 items.
- Bounded repairability of word languages (Q394744) (← links)
- The complexity of higher-order queries (Q498405) (← links)
- Structural properties of XPath fragments (Q555765) (← links)
- Aggregate operators in constraint query languages (Q696963) (← links)
- (Q730499) (redirect page) (← links)
- Determinacy and rewriting of functional top-down and MSO tree transformations (Q730500) (← links)
- Verifiable properties of database transactions (Q1281498) (← links)
- Hierarchies of measure-theoretic ultrafilters (Q1302305) (← links)
- Reachability and connectivity queries in constraint databases (Q1394800) (← links)
- Logical foundations of information disclosure in ontology-based data integration (Q1711879) (← links)
- The per-character cost of repairing word languages (Q2453121) (← links)
- (Q2753675) (← links)
- Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation (Q2799047) (← links)
- Rewriting Guarded Negation Queries (Q2849901) (← links)
- Determinacy and Rewriting of Top-Down and MSO Tree Transformations (Q2849905) (← links)
- Regular tree languages definable in FO and in FO <sub> <i>mod</i> </sub> (Q2946590) (← links)
- The Cost of Traveling between Languages (Q3012923) (← links)
- Two Variable vs. Linear Temporal Logic in Model Checking and Games (Q3090852) (← links)
- Monadic Datalog Containment (Q3167001) (← links)
- Definable relations and first-order query languages over strings (Q3452507) (← links)
- Relational queries over interpreted structures (Q3457752) (← links)
- A characterization of first-order topological properties of planar spatial data (Q3546315) (← links)
- XPath satisfiability in the presence of DTDs (Q3546365) (← links)
- Automata vs. Logics on Data Words (Q3586037) (← links)
- Interpreting Tree-to-Tree Queries (Q3591449) (← links)
- Towards a characterization of order-invariant queries over tame graphs (Q3616348) (← links)
- Relational expressive power of constraint query languages (Q3841038) (← links)
- Ultrafilters which extend measures (Q4212927) (← links)
- (Q4362726) (← links)
- (Q4414527) (← links)
- Definability with a predicate for a semi-linear set (Q4457736) (← links)
- Stability theory, permutations of indiscernibles, and embedded finite models (Q4505906) (← links)
- (Q4508937) (← links)
- (Q4508939) (← links)
- (Q4535054) (← links)
- Effective interpolation and preservation in guarded logics (Q4635596) (← links)
- The Complexity of Boundedness for Guarded Logics (Q4635812) (← links)
- Finite Open-World Query Answering with Number Restrictions (Q4635813) (← links)
- Interpolation with Decidable Fixpoint Logics (Q4635819) (← links)
- Querying Visible and Invisible Information (Q4635885) (← links)
- A Step Up in Expressiveness of Decidable Fixpoint Logics (Q4635946) (← links)
- SOME MODEL THEORY OF GUARDED NEGATION (Q4647097) (← links)
- (Q4863304) (← links)
- Two Variable vs. Linear Temporal Logic in Model Checking and Games (Q4927426) (← links)
- (Q4936135) (← links)
- Safe Constraint Queries (Q4943888) (← links)
- Query Answering with Transitive and Linear-Ordered Data (Q4963219) (← links)
- Monadic Datalog, Tree Validity, and Limited Access Containment (Q4972170) (← links)
- Analysis of Schemas with Access Restrictions (Q5012523) (← links)
- Generating Plans from Proofs (Q5012541) (← links)