Sebastian Eberhard

Publication Activity (10 Years)

Years Active: 2014-2018
Publications (10 Years): 4

Top Topics

Theorem Proving

Decision Problems

Top Venues

Ann. Pure Appl. Log.

ACM Trans. Comput. Log.

J. Log. Comput.

Publications

Sebastian Eberhard, Gabriel Ebner, Stefan Hetzl
Complexity of Decision Problems on Totally Rigid Acyclic Tree Grammars. DLT (2018)
Sebastian Eberhard, Stefan Hetzl
On the compressibility of finite languages and formal proofs. Inf. Comput. 259 (2) (2018)
Sebastian Eberhard, Gabriel Ebner, Stefan Hetzl
Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars. ACM Trans. Comput. Log. 18 (4) (2017)
Sebastian Eberhard, Stefan Hetzl, Daniel Weller
Boolean unification with predicates. J. Log. Comput. 27 (1) (2017)
Sebastian Eberhard
Applicative theories for logarithmic complexity classes. Theor. Comput. Sci. 585 (2015)
Sebastian Eberhard, Stefan Hetzl
Compressibility of Finite Languages by Grammars. DCFS (2015)
Sebastian Eberhard, Stefan Hetzl
Inductive theorem proving based on tree grammars. Ann. Pure Appl. Log. 166 (6) (2015)
Sebastian Eberhard
A feasible theory of truth over combinatory algebra. Ann. Pure Appl. Log. 165 (5) (2014)