Arnold Beckmann

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 19

Top Topics

Search Problems

Equational Theories

Ontological Framework

Top Venues

ACM Trans. Comput. Log.

Ann. Pure Appl. Log.

J. Log. Comput.

Publications

Arnold Beckmann, Georg Moser
On Complexity of Confluence and Church-Rosser Proofs. MFCS (2024)
Sadeer Beden, Arnold Beckmann
Towards an Ontological Framework for Integrating Domain Expert Knowledge with Random Forest Classification. ICSC (2023)
Qiushi Cao, Cecilia Zanni-Merk, Ahmed Samet, Christoph Reich, François de Bertrand de Beuvron, Arnold Beckmann, Cinzia Giannetti
KSPMI: A Knowledge-based System for Predictive Maintenance in Industry 4.0. Robotics Comput. Integr. Manuf. 74 (2022)
Arnold Beckmann, Yoriyuki Yamagata
On proving consistency of equational theories in Bounded Arithmetic. CoRR (2022)
Fahad F. Alhabardi, Arnold Beckmann, Bogdan Lazar, Anton Setzer
Verification of Bitcoin's Smart Contracts in Agda using Weakest Preconditions for Access Control. CoRR (2022)
Qiushi Cao, Sadeer Beden, Arnold Beckmann
A core reference ontology for steelmaking process knowledge modelling and information management. Comput. Ind. 135 (2022)
Kayal Lakshmanan, Eugenio Borghini, Arnold Beckmann, Cameron Pleydell-Pearce, Cinzia Giannetti
Data modelling and Remaining Useful Life estimation of rolls in a steel making cold rolling process. KES (2022)
Arnold Beckmann, João Santos, Indirajith Vijai Ananth
Modeling and Computing Available Rights for Algorithmic Licensing of Movies based on Blockchain. ICFNDS (2021)
Sadeer Beden, Qiushi Cao, Arnold Beckmann
Semantic Asset Administration Shells in Industry 4.0: A Survey. ICPS (2021)
Sadeer Beden, Qiushi Cao, Arnold Beckmann
SCRO: A Domain Ontology for Describing Steel Cold Rolling Processes towards Industry 4.0. Inf. 12 (8) (2021)
Fahad F. Alhabardi, Arnold Beckmann, Bogdan Lazar, Anton Setzer
Verification of Bitcoin Script in Agda Using Weakest Preconditions for Access Control. TYPES (2021)
Alexander J. M. Milne, Arnold Beckmann, Pardeep Kumar
Cyber-Physical Trust Systems Driven by Blockchain. IEEE Access 8 (2020)
Arnold Beckmann, Sam Buss
On transformations of constant depth propositional proofs. Ann. Pure Appl. Log. 170 (10) (2019)
Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen
Feasible set functions have small circuits. Comput. 8 (1) (2019)
Arnold Beckmann, Norbert Preining
Hyper Natural Deduction for Gödel Logic - A natural deduction system for parallel reasoning. J. Log. Comput. 28 (6) (2018)
Arnold Beckmann, Norbert Preining
Deciding logics of linear Kripke frames with scattered end pieces. Soft Comput. 21 (1) (2017)
Arnold Beckmann, Jean-José Razafindrakoto
Total Search Problems in Bounded Arithmetic and Improved Witnessing. WoLLIC (2017)
Arnold Beckmann, Sam Buss
The NP Search Problems of Frege and Extended Frege Proofs. ACM Trans. Comput. Log. 18 (2) (2017)
Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen
Cobham recursive set functions. Ann. Pure Appl. Log. 167 (3) (2016)
Arnold Beckmann, Samuel R. Buss, Sy-David Friedman
Safe Recursive Set Functions. J. Symb. Log. 80 (3) (2015)
Arnold Beckmann, Norbert Preining
Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences. J. Log. Comput. 25 (3) (2015)
Arnold Beckmann, Norbert Preining
Hyper Natural Deduction. LICS (2015)
Arnold Beckmann, Pavel Pudlák, Neil Thapen
Parity Games and Propositional Proofs. ACM Trans. Comput. Log. 15 (2) (2014)
Arnold Beckmann, Samuel R. Buss
Improved witnessing and local improvement principles for second-order bounded arithmetic. ACM Trans. Comput. Log. 15 (1) (2014)
Pavel Pudlák, Arnold Beckmann, Neil Thapen
Parity Games and Propositional Proofs. Electron. Colloquium Comput. Complex. 20 (2013)
Arnold Beckmann, Pavel Pudlák, Neil Thapen
Parity Games and Propositional Proofs. MFCS (2013)
Klaus Ambos-Spies, Arnold Beckmann, Erzsébet Csuhaj-Varjú, Benedikt Löwe
Computability in Europe 2009. J. Log. Comput. 23 (4) (2013)
Arnold Beckmann, Benedikt Löwe
Computability in Europe 2008. J. Log. Comput. 22 (2) (2012)
Phillip James, Arnold Beckmann, Markus Roggenbach
Using Domain Specific Languages to Support Verification in the Railway Domain. Haifa Verification Conference (2012)
Arnold Beckmann, Wolfgang Merkle, Benedikt Löwe
Computability in Europe 2009. Theory Comput. Syst. 51 (1) (2012)
Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss, Benedikt Löwe
Computability in Europe 2009. Ann. Pure Appl. Log. 163 (5) (2012)
Arnold Beckmann, Benedikt Löwe
Computability in Europe 2008. Theory Comput. Syst. 48 (3) (2011)
Arnold Beckmann, Samuel R. Buss
Corrected upper bounds for free-cut elimination. Theor. Comput. Sci. 412 (39) (2011)
Klaus Aehlig, Arnold Beckmann
On the computational complexity of cut-reduction. Ann. Pure Appl. Log. 161 (6) (2010)
Arnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe
Computability in Europe 2008. Arch. Math. Log. 49 (2) (2010)
Arnold Beckmann, Samuel R. Buss
Polynomial Local Search in the Polynomial Hierarchy and Witnessing in Fragments of Bounded Arithmetic. J. Math. Log. 9 (1) (2009)
Arnold Beckmann
A Characterisation of Definable NP Search Problems in Peano Arithmetic. WoLLIC (2009)
Arnold Beckmann, Edwin J. Beggs, Benedikt Löwe
From Gödel to Einstein: Computability between logic and physics at CiE 2006. Theor. Comput. Sci. 394 (3) (2008)
Klaus Aehlig, Arnold Beckmann
On the Computational Complexity of Cut-Reduction. LICS (2008)
Arnold Beckmann, Faron Moller
On the Complexity of Parity Games. BCS Int. Acad. Conf. (2008)
Arnold Beckmann, Benedikt Löwe
Computability in Europe 2006. Theory Comput. Syst. 43 (3-4) (2008)
Arnold Beckmann, Martin Goldstern, Norbert Preining
Continuous Fraïssé Conjecture. Order 25 (4) (2008)
Arnold Beckmann, Benedikt Löwe, Dag Normann
Logical Approaches to Computational Barriers: CiE 2006. J. Log. Comput. 17 (6) (2007)
Arnold Beckmann
Proofs, Programs and Abstract Complexity. CSL (2007)
Klaus Aehlig, Arnold Beckmann
Propositional Logic for Circuit Classes. CSL (2007)
Klaus Aehlig, Arnold Beckmann
On the computational complexity of cut-reduction CoRR (2007)
Arnold Beckmann, Norbert Preining
Linear Kripke frames and Gödel logics. J. Symb. Log. 72 (1) (2007)
Arnold Beckmann
Uniform Proof Complexity. J. Log. Comput. 15 (4) (2005)
Arnold Beckmann, Jan Johannsen
An unexpected separation result in Linearly Bounded Arithmetic. Math. Log. Q. 51 (2) (2005)
Arnold Beckmann, Samuel R. Buss
Separation results for the size of constant-depth propositional proofs. Ann. Pure Appl. Log. 136 (1-2) (2005)
Arnold Beckmann, Jeremy Avigad, Georg Moser
Preface. Ann. Pure Appl. Log. 136 (1-2) (2005)
Arnold Beckmann
Preservation theorems and restricted consistency statements in bounded arithmetic. Ann. Pure Appl. Log. 126 (1-3) (2004)
Arnold Beckmann, Chris Pollett, Samuel R. Buss
Ordinal notations and well-orderings in bounded arithmetic. Ann. Pure Appl. Log. 120 (1-3) (2003)
Arnold Beckmann
Dynamic ordinal analysis. Arch. Math. Log. 42 (4) (2003)
Arnold Beckmann
Height restricted constant depth LK Electron. Colloquium Comput. Complex. 10 (034) (2003)
Arnold Beckmann, Samuel R. Buss, Chris Pollett
Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 (2003) 197-223]. Ann. Pure Appl. Log. 123 (1-3) (2003)
Arnold Beckmann
Resolution Refutations and Propositional Proofs with Height-Restrictions. CSL (2002)
Arnold Beckmann
Notations for exponentiation. Theor. Comput. Sci. 288 (1) (2002)
Arnold Beckmann
A Note on Universal Measures for Weak Implicit Computational Complexity. LPAR (2002)
Arnold Beckmann
A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets. Arch. Math. Log. 41 (3) (2002)
Arnold Beckmann
Proving Consistency of Equational Theories in Bounded Arithmetic. J. Symb. Log. 67 (1) (2002)
Arnold Beckmann
Exact Bounds for Lengths of Reductions in Typed lambda-Calculus. J. Symb. Log. 66 (3) (2001)
Arnold Beckmann, Andreas Weiermann
Via Expanded Head Reduction Trees. Math. Log. Q. 46 (4) (2000)
Arnold Beckmann, Andreas Weiermann
Characterizing the elementary recursive functions by a fragment of Gödel's T. Arch. Math. Log. 39 (7) (2000)
Arnold Beckmann, Wolfram Pohlers
Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory. Ann. Pure Appl. Log. 94 (1-3) (1998)
Arnold Beckmann, Andreas Weiermann
A term rewriting characterization of the polytime functions and related complexity classes. Arch. Math. Log. 36 (1) (1996)