The following pages link to Gert Smolka (Q287374):
Displayed 50 items.
- Completeness and decidability results for CTL in constructive type theory (Q287375) (← links)
- Order-sorted unification (Q582269) (← links)
- A complete and recursive feature theory (Q673135) (← links)
- Attributive concept descriptions with complements (Q749235) (← links)
- Item:Q287374 (redirect page) (← links)
- A concurrent lambda calculus with futures (Q860851) (← links)
- Terminating tableau systems for hybrid logic with difference and converse (Q1047795) (← links)
- Inheritance hierarchies: Semantics and unifications (Q1124313) (← links)
- On the expressivity of feature logics with negation, functional uncertainty, and sort equations (Q1314281) (← links)
- A feature constraint system for logic programming with entailment (Q1314426) (← links)
- Situated simplification (Q1391936) (← links)
- Regular language representations in the constructive type theory of Coq (Q1663246) (← links)
- Weak call-by-value lambda calculus as a model of computation in Coq (Q1687735) (← links)
- Categoricity results for second-order ZF in dependent type theory (Q1687749) (← links)
- Verification of PCP-related computational reductions in Coq (Q1791165) (← links)
- Basic narrowing revisited (Q1824412) (← links)
- Call-by-value lambda calculus as a model of computation in Coq (Q2319993) (← links)
- Categoricity results and large model constructions for second-order ZF in dependent type theory (Q2319994) (← links)
- A goal-directed decision procedure for hybrid PDL (Q2351150) (← links)
- Clausal Tableaux for Hybrid PDL (Q2825411) (← links)
- Two-Way Automata in Coq (Q2829256) (← links)
- Hereditarily Finite Sets in Constructive Type Theory (Q2829273) (← links)
- Higher-Order Syntax and Saturation Algorithms for Hybrid Logic (Q2867945) (← links)
- Completeness and Decidability Results for CTL in Coq (Q2879254) (← links)
- A Constructive Theory of Regular Languages in Coq (Q2938041) (← links)
- A Linear First-Order Functional Intermediate Language for Verified Compilers (Q2945646) (← links)
- Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions (Q2945649) (← links)
- Transfinite Constructions in Classical Type Theory (Q2945651) (← links)
- (Q2958389) (← links)
- Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics (Q3010369) (← links)
- (Q3086781) (← links)
- Constructive Formalization of Hybrid Logic with Eventualities (Q3100197) (← links)
- Terminating Tableaux for $\mathcal{SOQ}$ with Number Restrictions on Transitive Roles (Q3163885) (← links)
- Extended First-Order Logic (Q3183527) (← links)
- (Q3490936) (← links)
- Generating Propagators for Finite Set Constraints (Q3524259) (← links)
- Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse (Q3541703) (← links)
- Analytic Tableaux for Simple Type Theory and its First-Order Fragment (Q3575302) (← links)
- Terminating Tableaux for the Basic Fragment of Simple Type Theory (Q3648727) (← links)
- (Q3965577) (← links)
- Feature-constraint logics for unification grammars (Q3992236) (← links)
- (Q3995237) (← links)
- (Q4013976) (← links)
- (Q4227021) (← links)
- Records for logic programming (Q4290618) (← links)
- (Q4364535) (← links)
- (Q4364536) (← links)
- Constructive Completeness for Modal Logic with Transitive Closure (Q4916063) (← links)
- Clausal Graph Tableaux for Hybrid Logic with Eventualities and Difference (Q4933321) (← links)
- Hybrid Tableaux for the Difference Modality (Q4982124) (← links)