Trosolwg
Mae'r Athro Arnold Beckmann yn aelod o'n Hadran Gyfrifiadureg ym Mhrifysgol Abertawe.
Yr Athro Arnold Beckmann
Athro
Computer Science
402
Pedwerydd Llawr
Y Ffowndri Gyfrifiadol
Campws y Bae
Pedwerydd Llawr
Y Ffowndri Gyfrifiadol
Campws y Bae
Ar gael ar gyfer Goruchwyliaeth Ôl-raddedig
Dolenni Ymchwil
Meysydd Arbenigedd
- Rhesymeg Fathemategol
- Cyfrifiadureg Ddamcaniaethol
- Theori prawf a chymhlethdod prawf
- Rhifyddeg ffinedig a chymhlethdod prawf gosodiadol
- Cymhlethdod cyfrifiadurol ymhlyg
- Systemau lleihau
- Rhesymeg draethiadol ganolradd
Cyhoeddiadau
Uchafbwyntiau Ymchwil
-
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.
-
Milne, A., Beckmann, A., & Kumar, P. (2020). Cyber-Physical Trust Systems Driven by Blockchain. IEEE Access, 8, 66423-66437.
-
Beckmann, A. & Buss, S. (2019). On transformations of constant depth propositional proofs. Annals of Pure and Applied Logic
-
Beckmann, A., Buss, S., Friedman, S., Müller, M., & Thapen, N. (2018). Feasible set functions have small circuits. Computability, 8(1), 67-98.
-
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.
Holl Ymchwil
Erthyglau Cylchgronau
-
Beckmann, A. & YAMAGATA, Y. (2025). On proving consistency of equational theories in bounded arithmetic. The Journal of Symbolic Logic, 90(1), 135-165.
-
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)SU Repository: https://cronfa.swan.ac.uk/Record/cronfa67545
-
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)SU Repository: https://cronfa.swan.ac.uk/Record/cronfa68617
-
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.
-
Milne, A., Beckmann, A., & Kumar, P. (2020). Cyber-Physical Trust Systems Driven by Blockchain. IEEE Access, 8, 66423-66437.
-
Beckmann, A. & Buss, S. (2019). On transformations of constant depth propositional proofs. Annals of Pure and Applied Logic
-
Beckmann, A., Buss, S., Friedman, S., Müller, M., & Thapen, N. (2018). Feasible set functions have small circuits. Computability, 8(1), 67-98.
-
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. (2017). The NP Search Problems of Frege and Extended Frege Proofs. ACM Transactions on Computational Logic, 18(2), 1-19.
-
Beckmann, A. & Preining, N. (2017). Deciding logics of linear Kripke frames with scattered end pieces. Soft Computing, 21(1), 191-197.
-
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., Buss, S., & Friedman, S. (2015). Safe Recursive Set Functions. The Journal of Symbolic Logic, 80(03), 730-762.
-
Beckmann, A., Pudlák, P., & Thapen, N. (2014). Parity Games and Propositional Proofs. ACM Transactions on Computational Logic, 15(2), 17:1-17:30.
-
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. (2011). Corrected upper bounds for free-cut elimination. Theoretical Computer Science, 412(39), 5433-5445.
-
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.
-
Aehlig, K. & Beckmann, A. (2009). On the computational complexity of cut-reduction. Annals of Pure and Applied Logic, 161(6), 711-736.
-
Beckmann, A., Goldstern, M., & Preining, N. (2008). Continuous Fraïssé Conjecture. Order, 25(4), 281-298.
-
Beckmann, A. & Preining, N. (2007). Linear Kripke frames and Gödel logics. Journal of Symbolic Logic, 72(1), 26-44.
-
Beckmann, A. (2006). Generalised dynamic ordinals - universal measures for implicit computational complexity. Lecture Notes in Logic, 27, 48-74.SU Repository: https://cronfa.swan.ac.uk/Record/cronfa13719
-
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. & Johannsen, J. (2005). An unexpected separation result in Linearly Bounded Arithmetic. MLQ, 51(2), 191-200.
-
Beckmann, A. & Beckmann, A. (2005). Uniform Proof Complexity. Journal of Logic and Computation, 15(4), 433-446.
-
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.
-
Beckmann, A. (2002). Dynamic ordinal analysis. Archive for Mathematical Logic, 42(4), 303-334.
-
Arnold, B. & Beckmann, A. (2002). Notations for exponentiation. Theoretical Computer Science, 288(1), 3-19.
-
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). Analyzing Gödel's T Via Expanded Head Reduction Trees. MLQ, 46(4), 517-536.
-
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.
Llyfrau Awdurol
-
Beckmann, A. (2004). Bounded Arithmetic and Resolution-Based Proof Systems Kurt Gödel Society.SU Repository: https://cronfa.swan.ac.uk/Record/cronfa14893
Penodau Llyfrau
-
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
Cyfraniadau Cynadleddau
-
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.
-
Beckmann, A. & Preining, N. (2015). Hyper Natural Deduction. In 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 547-558). IEEE.
-
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.SU Repository: https://cronfa.swan.ac.uk/Record/cronfa56
-
Aehlig, K. & Beckmann, A. (2008). On the Computational Complexity of Cut-Reduction. (pp. 284-293). IEEE.
-
Shahid, Z., Beckmann, A., Sylla, A., Giannetti, C., & Alpan, G. (n.d.) Ontology-Based Approach to Supplier Risk Management Using Large Language Models. In 11th IFAC Conference on Manufacturing Modelling, Management and ControlSU Repository: https://cronfa.swan.ac.uk/Record/cronfa69399
Llyfrau wedi'u Golygu
-
Beckmann, A., Csuhaj-Varjú, E., & Meer, K. (Eds.). (2014). Language, Life, Limits. Springer.
-
Beckmann, A. & Löwe, B. (Eds.). (2013). Acts of the Programme Semantics and Syntax. College Publication.SU Repository: https://cronfa.swan.ac.uk/Record/cronfa19986
Goruchwyliaeth
-
Hybrid AI for Supply Chain Optimization in Industry 4.0 (cyfredol)
PhDGoruchwyliwr arall: Prof Cinzia Giannetti -
Semantic Technologies for Addressing Challenges in Pharmaceutical Supply Chains (cyfredol)
PhDGoruchwyliwr arall: Dr Anton Setzer -
Verification of Smart contracts using the interactive theorem prover Agda (dyfarnwyd 2024)
PhDGoruchwyliwr arall: Dr Anton Setzer -
Knowledge-driven Artificial Intelligence in Steelmaking: Towards Industry 4.0 (dyfarnwyd 2024)
PhDGoruchwyliwr arall: Dr Phillip James
Modiwlau a Addysgir
-
CSC375 Logic for Computer Science
This module provides an introduction to logic and its applications to computer science, in particular to the formal specification and verification of computer programs.
-
CSCM029 Blockchain Cryptocurrencies and Smart Contracts
This module offers a comprehensive introduction to blockchain technology, covering fundamental concepts such as the notions of money, smart contracts, and cryptography. It delves into the history of Bitcoin, the UTXO model, Bitcoin Script, and the intricacies of transactions and mining. The course also explores the basics of Ethereum, including its history, philosophy, and the smart contract language Solidity. Students will gain an understanding of the Ethereum Virtual Machine (EVM), Proof of Stake, and smart contract security. The module concludes with practical applications of blockchain technology.