Arnold Beckmann

According to our database, Arnold Beckmann authored at least 60 papers between 1996 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Towards an Ontological Framework for Integrating Domain Expert Knowledge with Random Forest Classification.

Sadeer Beden, Arnold Beckmann

Proceedings of the 17th IEEE International Conference on Semantic Computing, 2023

2022

KSPMI: A Knowledge-based System for Predictive Maintenance in Industry 4.0.

Qiushi Cao, Cecilia Zanni-Merk, Ahmed Samet, Christoph Reich, François de Bertrand de Beuvron, Arnold Beckmann, Cinzia Giannetti

Robotics Comput. Integr. Manuf., 2022

On proving consistency of equational theories in Bounded Arithmetic.

Arnold Beckmann, Yoriyuki Yamagata

CoRR, 2022

Verification of Bitcoin's Smart Contracts in Agda using Weakest Preconditions for Access Control.

Fahad F. Alhabardi, Arnold Beckmann, Bogdan Lazar, Anton Setzer

CoRR, 2022

A core reference ontology for steelmaking process knowledge modelling and information management.

Qiushi Cao, Sadeer Beden, Arnold Beckmann

Comput. Ind., 2022

Data modelling and Remaining Useful Life estimation of rolls in a steel making cold rolling process.

Kayal Lakshmanan, Eugenio Borghini, Arnold Beckmann, Cameron Pleydell-Pearce, Cinzia Giannetti

Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 26th International Conference KES-2022, 2022

2021

SCRO: A Domain Ontology for Describing Steel Cold Rolling Processes towards Industry 4.0.

Sadeer Beden, Qiushi Cao, Arnold Beckmann

Inf., 2021

Verification of Bitcoin Script in Agda Using Weakest Preconditions for Access Control.

Fahad F. Alhabardi, Arnold Beckmann, Bogdan Lazar, Anton Setzer

Proceedings of the 27th International Conference on Types for Proofs and Programs, 2021

Semantic Asset Administration Shells in Industry 4.0: A Survey.

Sadeer Beden, Qiushi Cao, Arnold Beckmann

Proceedings of the 4th IEEE International Conference on Industrial Cyber-Physical Systems, 2021

Modeling and Computing Available Rights for Algorithmic Licensing of Movies based on Blockchain.

Arnold Beckmann, João Santos, Indirajith Vijai Ananth

Proceedings of the ICFNDS 2021: The 5th International Conference on Future Networks & Distributed Systems, Dubai United Arab Emirates, December 15, 2021

2020

Cyber-Physical Trust Systems Driven by Blockchain.

Alexander J. M. Milne, Arnold Beckmann, Pardeep Kumar

IEEE Access, 2020

2019

Feasible set functions have small circuits.

Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen

Comput., 2019

On transformations of constant depth propositional proofs.

Arnold Beckmann, Sam Buss

Ann. Pure Appl. Log., 2019

2018

Hyper Natural Deduction for Gödel Logic - A natural deduction system for parallel reasoning.

Arnold Beckmann, Norbert Preining

J. Log. Comput., 2018

2017

The NP Search Problems of Frege and Extended Frege Proofs.

Arnold Beckmann, Sam Buss

ACM Trans. Comput. Log., 2017

Deciding logics of linear Kripke frames with scattered end pieces.

Arnold Beckmann, Norbert Preining

Soft Comput., 2017

Total Search Problems in Bounded Arithmetic and Improved Witnessing.

Arnold Beckmann, Jean-José Razafindrakoto

Proceedings of the Logic, Language, Information, and Computation, 2017

2016

Cobham recursive set functions.

Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen

Ann. Pure Appl. Log., 2016

2015

Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences.

Arnold Beckmann, Norbert Preining

J. Log. Comput., 2015

Safe Recursive Set Functions.

Arnold Beckmann, Samuel R. Buss, Sy-David Friedman

J. Symb. Log., 2015

Hyper Natural Deduction.

Arnold Beckmann, Norbert Preining

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014

Parity Games and Propositional Proofs.

Arnold Beckmann, Pavel Pudlák, Neil Thapen

ACM Trans. Comput. Log., 2014

Improved witnessing and local improvement principles for second-order bounded arithmetic.

Arnold Beckmann, Samuel R. Buss

ACM Trans. Comput. Log., 2014

2013

Computability in Europe 2009.

Klaus Ambos-Spies, Arnold Beckmann, Erzsébet Csuhaj-Varjú, Benedikt Löwe

J. Log. Comput., 2013

2012

Computability in Europe 2009.

Arnold Beckmann, Wolfgang Merkle, Benedikt Löwe

Theory Comput. Syst., 2012

Computability in Europe 2009.

Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss, Benedikt Löwe

Ann. Pure Appl. Log., 2012

Using Domain Specific Languages to Support Verification in the Railway Domain.

Phillip James, Arnold Beckmann, Markus Roggenbach

Proceedings of the Hardware and Software: Verification and Testing, 2012

2011

Corrected upper bounds for free-cut elimination.

Arnold Beckmann, Samuel R. Buss

Theor. Comput. Sci., 2011

Computability in Europe 2008.

Arnold Beckmann, Benedikt Löwe

Theory Comput. Syst., 2011

2010

On the computational complexity of cut-reduction.

Klaus Aehlig, Arnold Beckmann

Ann. Pure Appl. Log., 2010

Computability in Europe 2008.

Arnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe

Arch. Math. Log., 2010

2009

Polynomial Local Search in the Polynomial Hierarchy and Witnessing in Fragments of Bounded Arithmetic.

Arnold Beckmann, Samuel R. Buss

J. Math. Log., 2009

A Characterisation of Definable NP Search Problems in Peano Arithmetic.

Arnold Beckmann

Proceedings of the Logic, 2009

2008

From Gödel to Einstein: Computability between logic and physics at CiE 2006.

Arnold Beckmann, Edwin J. Beggs, Benedikt Löwe

Theor. Comput. Sci., 2008

Continuous Fraïssé Conjecture.

Arnold Beckmann, Martin Goldstern, Norbert Preining

Order, 2008

Computability in Europe 2006.

Arnold Beckmann, Benedikt Löwe

Theory Comput. Syst., 2008

On the Complexity of Parity Games.

Arnold Beckmann, Faron Moller

Proceedings of the Visions of Computer Science, 2008

2007

Logical Approaches to Computational Barriers: CiE 2006.

Arnold Beckmann, Benedikt Löwe, Dag Normann

J. Log. Comput., 2007

Linear Kripke frames and Gödel logics.

Arnold Beckmann, Norbert Preining

J. Symb. Log., 2007

Proofs, Programs and Abstract Complexity.

Arnold Beckmann

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

Propositional Logic for Circuit Classes.

Klaus Aehlig, Arnold Beckmann

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2005

An unexpected separation result in Linearly Bounded Arithmetic.

Arnold Beckmann, Jan Johannsen

Math. Log. Q., 2005

Uniform Proof Complexity.

Arnold Beckmann

J. Log. Comput., 2005

Separation results for the size of constant-depth propositional proofs.

Arnold Beckmann, Samuel R. Buss

Ann. Pure Appl. Log., 2005

Preface.

Arnold Beckmann, Jeremy Avigad, Georg Moser

Ann. Pure Appl. Log., 2005

2004

Preservation theorems and restricted consistency statements in bounded arithmetic.

Arnold Beckmann

Ann. Pure Appl. Log., 2004

2003

Height restricted constant depth LK

Arnold Beckmann

Electron. Colloquium Comput. Complex., 2003

Ordinal notations and well-orderings in bounded arithmetic.

Arnold Beckmann, Chris Pollett, Samuel R. Buss

Ann. Pure Appl. Log., 2003

Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 (2003) 197-223].

Arnold Beckmann, Samuel R. Buss, Chris Pollett

Ann. Pure Appl. Log., 2003

Dynamic ordinal analysis.

Arnold Beckmann

Arch. Math. Log., 2003

2002

Notations for exponentiation.

Arnold Beckmann

Theor. Comput. Sci., 2002

Proving Consistency of Equational Theories in Bounded Arithmetic.

Arnold Beckmann

J. Symb. Log., 2002

A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets.

Arnold Beckmann

Arch. Math. Log., 2002

A Note on Universal Measures for Weak Implicit Computational Complexity.

Arnold Beckmann

Proceedings of the Logic for Programming, 2002

Resolution Refutations and Propositional Proofs with Height-Restrictions.

Arnold Beckmann

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001

Exact Bounds for Lengths of Reductions in Typed lambda-Calculus.

Arnold Beckmann

J. Symb. Log., 2001

2000

Analyzing Gödel's <i>T</i> Via Expanded Head Reduction Trees.

Arnold Beckmann, Andreas Weiermann

Math. Log. Q., 2000

Characterizing the elementary recursive functions by a fragment of Gödel's T.

Arnold Beckmann, Andreas Weiermann

Arch. Math. Log., 2000

1998

Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory.

Arnold Beckmann, Wolfram Pohlers

Ann. Pure Appl. Log., 1998

1996

A term rewriting characterization of the polytime functions and related complexity classes.

Arnold Beckmann, Andreas Weiermann

Arch. Math. Log., 1996