The following pages link to Michael Benedikt (Q394743):
Displayed 23 items.
- (Q5094143) (← links)
- Characterizing Definability in Decidable Fixpoint Logics (Q5111439) (← links)
- Finite Open-world Query Answering with Number Restrictions (Q5121278) (← links)
- (Q5144648) (← links)
- (Q5232911) (← links)
- Bisimilarity of Pushdown Automata is Nonelementary (Q5271086) (← links)
- Logical definability and query languages over ranked and unranked trees (Q5277776) (← links)
- Effective Interpolation and Preservation in Guarded Logics (Q5277909) (← links)
- Limiting Until in Ordered Tree Query Languages (Q5277915) (← links)
- Complexity of Two-Variable Logic on Finite Trees (Q5278193) (← links)
- Algebraic Methodology and Software Technology (Q5313010) (← links)
- LTL Model Checking of Interval Markov Chains (Q5326312) (← links)
- Complexity of Two-Variable Logic on Finite Trees (Q5327424) (← links)
- Computer Science Logic (Q5394583) (← links)
- Databases (Q5397501) (← links)
- Efficient and Expressive Tree Filters (Q5458857) (← links)
- (Q5477350) (← links)
- Database Programming Languages (Q5493337) (← links)
- STACS 2005 (Q5710686) (← links)
- Computer Aided Verification (Q5716579) (← links)
- On Monotonic Determinacy and Rewritability for Recursive Queries and Views (Q5886523) (← links)
- The past and future of embedded finite model theory (Q6173101) (← links)
- Embedded Finite Models beyond Restricted Quantifier Collapse (Q6433540) (← links)