Beden, S. & Beckmann, A.(2023). Towards an Ontological Framework for Integrating Domain Expert Knowledge with Random Forest Classification. In 2023 IEEE 17th International Conference on Semantic Computing (ICSC)IEEE.
Alhabardi, F., Beckmann, A., Lazar, B., & Setzer, A. (2022). Verification of Bitcoin Script in Agda using Weakest Preconditions for Access Control. In Henning Basold, Jesper Cockx, Silvia Ghilezan (Ed.),27th International Conference on Types for Proofs and Programs (TYPES 2021) (pp. 1:1-1:25). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Beckmann, A., Santos, J., & Vijai Ananth, I. (2021). Modeling and Computing Available Rights for Algorithmic Licensing of Movies based on Blockchain. In The 5th International Conference on Future Networks & Distributed Systems (pp. 795-802). ACM.
Cao, Q., Beden, S., & Beckmann, A. (2022). A core reference ontology for steelmaking process knowledge modelling and information management. Computers in Industry, 135, 103574
Cao, Q., Zanni-Merk, C., Samet, A., Reich, C., Beuvron, F., Beckmann, A., & Giannetti, C. (2022). KSPMI: A Knowledge-based System for Predictive Maintenance in Industry 4.0. Robotics and Computer-Integrated Manufacturing, 74, 102281
Alsamani, A. & Beckmann, A.(2022). Combining Blockchain and Semantic Technologies: A Survey. In 2022 IEEE 1st Global Emerging Technology Blockchain Forum: Blockchain & Beyond (iGETblockchain)IEEE.
Beckmann, A. & Preining, N.(2018). Hyper Natural Deduction for Gödel Logic—A natural deduction system for parallel reasoning. Journal of Logic and Computation, 28(6), 1125-1187.
Vessio, M., Beckmann, A., Roach, M., Saintier, S., Clements, R., & Setzer, A. (2024). InPerpetuity{Challenging Misperceptions of the Term ‘Smart Contract’}. European Journal of Law and Technology, 15(2)
Vessio, M., Beckmann, A., Roach, M., Saintier, S., Clements, R., & Setzer, A. (2024). InPerpetuity{Challenging Misperceptions of the Term “Smart Contract”}. European Journal of Law and Technology, 15(2)
Beden, S., Lakshmanan, K., Giannetti, C., & Beckmann, A. (2023). Steelmaking Predictive Analytics Based on Random Forest and Semantic Reasoning. Applied Sciences, 13(23), 12778
Lakshmanan, K., Borghini, E., Beckmann, A., Pleydell-Pearce, C., & Giannetti, C. (2022). Data modelling and Remaining Useful Life estimation of rolls in a steel making cold rolling process. Procedia Computer Science, 207(C), 1057-1066.
Cao, Q., Zanni-Merk, C., Samet, A., Reich, C., Beuvron, F., Beckmann, A., & Giannetti, C. (2022). KSPMI: A Knowledge-based System for Predictive Maintenance in Industry 4.0. Robotics and Computer-Integrated Manufacturing, 74, 102281
Cao, Q., Beden, S., & Beckmann, A. (2022). A core reference ontology for steelmaking process knowledge modelling and information management. Computers in Industry, 135, 103574
Beden, S., Cao, Q., & Beckmann, A. (2021). SCRO: A Domain Ontology for Describing Steel Cold Rolling Processes towards Industry 4.0. Information, 12(8), 304-18.
Beckmann, A. & Preining, N.(2018). Hyper Natural Deduction for Gödel Logic—A natural deduction system for parallel reasoning. Journal of Logic and Computation, 28(6), 1125-1187.
Beckmann, A., Buss, S., Friedman, S., Müller, M., & Thapen, N. (2015). Cobham recursive set functions. Annals of Pure and Applied Logic, 167(3), 335-369.
Beckmann, A., Preining, N., & Beckmann, A. (2014). Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences. Journal of Logic and Computation
Beckmann, A. & Buss, S.(2014). Improved witnessing and local improvement principles for second-order bounded arithmetic. ACM Transactions on Computational Logic, 15(1), 2:1-2:35.
Beckmann, A. & BUSS, S.(2009). POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC. Journal of Mathematical Logic, 09(01), 103-138.
Beckmann, A. & Buss, S.(2005). Separation results for the size of constant-depth propositional proofs. Annals of Pure and Applied Logic, 136(1-2), 30-55.
Beckmann, A. (2004). Preservation theorems and restricted consistency statements in bounded arithmetic. Annals of Pure and Applied Logic, 126(1-3), 255-280.
Beckmann, A., Pollett, C., & Buss, S. (2003). Ordinal notations and well-orderings in bounded arithmetic. Annals of Pure and Applied Logic, 120(1-3), 197-223.
Arnold, B. & Beckmann, A.(2002). A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets. Archive for Mathematical Logic, 41(3), 251-257.
Arnold, B., Andreas, W., & Beckmann, A. (2000). Characterizing the elementary recursive functions by a fragment of Gödel's T. Archive for Mathematical Logic, 39(7), 475-491.
Arnold, B., Wolfram, P., & Beckmann, A. (1998). Applications of cut-free infinitary derivations to generalized recursion theory. Annals of Pure and Applied Logic, 94(1-3), 7-19.
Arnold, B., Andreas, W., & Beckmann, A. (1996). A term rewriting characterization of the polytime functions and related complexity classes. Archive for Mathematical Logic, 36(1), 11-30.
Beckmann, A., Milne, A., Razafindrakoto, J., Kumar, P., Breach, M., & Preining, N. (2020). Blockchain‐Based Cyber Physical Trust Systems. In Madhusanka Liyanage An Braeken Pardeep Kumar Mika Ylianttila (Ed.),IoT Security (pp. 265-277). Wiley
Beckmann, A., Buss, S., Friedman, S., Müller, M., & Thapen, N. (2017). Cobham Recursive Set Functions and Weak Set Theories. Sets and Computations (pp. 55-116). World Scientific
Beckmann, A. & Buss, S.(2010). Characterising definable search problems in bounded arithmetic via proof notations. Ways of Proof Theory (pp. 65-134). De Gruyter
Beckmann, A. & Moser, G.(2024). On Complexity of Confluence and Church-Rosser Proofs. In Mathematical Foundations of Computer Science (MFCS)Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Beden, S. & Beckmann, A.(2023). Towards an Ontological Framework for Integrating Domain Expert Knowledge with Random Forest Classification. In 2023 IEEE 17th International Conference on Semantic Computing (ICSC)IEEE.
Alsamani, A. & Beckmann, A.(2022). Combining Blockchain and Semantic Technologies: A Survey. In 2022 IEEE 1st Global Emerging Technology Blockchain Forum: Blockchain & Beyond (iGETblockchain)IEEE.
Alhabardi, F., Beckmann, A., Lazar, B., & Setzer, A. (2022). Verification of Bitcoin Script in Agda using Weakest Preconditions for Access Control. In Henning Basold, Jesper Cockx, Silvia Ghilezan (Ed.),27th International Conference on Types for Proofs and Programs (TYPES 2021) (pp. 1:1-1:25). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Beckmann, A., Santos, J., & Vijai Ananth, I. (2021). Modeling and Computing Available Rights for Algorithmic Licensing of Movies based on Blockchain. In The 5th International Conference on Future Networks & Distributed Systems (pp. 795-802). ACM.
Beden, S., Cao, Q., & Beckmann, A. (2021). Semantic Asset Administration Shells in Industry 4.0: A Survey. In 2021 4th IEEE International Conference on Industrial Cyber-Physical Systems (ICPS)IEEE.
Beckmann, A., Razafindrakoto, J., & Razafindrakoto, J. (2017). Total Search Problems in Bounded Arithmetic and Improved Witnessing. In Logic, Language, Information, and Computation (pp. 31-47). 24th International Workshop, WoLLIC 2017, London, UK, July 18-21, 2017, Proceedings.
James, P., Beckmann, A., & Roggenbach, M. (2013). Using Domain Specific Languages to Support Verification in the Railway Domain. In Hardware and Software: Verification and Testing (pp. 274-275). Springer.
Beckmann, A., Pudlák, P., & Thapen, N. (2013). Parity Games and Propositional Proofs. In Mathematical Foundations of Computer Science 2013 (pp. 111-122). Springer.
Beckmann, A. (2009). A Characterisation of Definable NP Search Problems in Peano Arithmetic. In Logic, Language, Information and Computation (pp. 1-12). Springer.
Beckmann, A. & Moller, F.(2008). On the complexity of parity games. In Visions of Computer Science — BCS International Academic Conference (pp. 237-247). BCS.