The following pages link to Gabriel Ebner (Q1622973):
Displayed 9 items.
- Complexity of decision problems on totally rigid acyclic tree grammars (Q1622974) (← links)
- A unifying splitting framework (Q2055869) (← links)
- Herbrand constructivization for automated intuitionistic theorem proving (Q2180528) (← links)
- Maintaining a library of formal mathematics (Q2219408) (← links)
- On the generation of quantified lemmas (Q2417949) (← links)
- System Description: GAPT 2.0 (Q2817928) (← links)
- (Q3384900) (← links)
- Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars (Q4608715) (← links)
- Unifying splitting (Q6103590) (← links)