Gabriel Ebner

20162019
If you made any changes in Pure these will be visible here soon.

Personal profile

Ancillary activities

No ancillary activities

Ancillary activities are updated daily

Fingerprint Dive into the research topics where Gabriel Ebner is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

Proof Theory Mathematics
Grammar Mathematics
Decision problem Mathematics
Data structures Engineering & Materials Science
Computational complexity Engineering & Materials Science
Compression Mathematics
Automated Deduction Mathematics
Processing Engineering & Materials Science

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2016 2019

  • 4 Conference contribution
  • 2 Article

On the Generation of Quantified Lemmas

Ebner, G., Hetzl, S., Leitsch, A., Reis, G. & Weller, D., 15 Jun 2019, In : Journal of Automated Reasoning. 63, 1, p. 95-126 32 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Decomposition

Complexity of Decision Problems on Totally Rigid Acyclic Tree Grammars

Eberhard, S., Ebner, G. & Hetzl, S., 1 Jan 2018, Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. Hoshi, M. & Seki, S. (eds.). Springer Verlag, p. 291-303 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11088 LNCS).

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Decision problem
Grammar
Computational complexity
Cover
Proof Theory

Efficient translation of sequent calculus proofs into natural deduction proofs

Ebner, G. & Schlaipfer, M., 1 Jan 2018, 6th Workshop on Practical Aspects of Automated Reasoning, PAAR 2018. Vol. 2162. p. 17-33 17 p. (CEUR Workshop Proceedings).

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Fast cut-elimination using proof terms: An empirical study

Ebner, G., 19 Oct 2018, 7th International Workshop on Classical Logic and Computation, CL and C 2018; Oxford; United Kingdom; 7 July 2018 through. Vol. 281. p. 24-38 15 p. (Electronic Proceedings in Theoretical Computer Science, EPTCS).

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Open Access

Algorithmic compression of finite tree languages by rigid acyclic grammars

Eberhard, S., Ebner, G. & Hetzl, S., 1 Sep 2017, In : ACM Transactions on Computational Logic. 18, 4, 26.

Research output: Contribution to JournalArticleAcademicpeer-review

Grammar
Compression
Automated Deduction
Term Rewriting
Proof Theory