References of "Steen, Alexander 50031912"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailAgent-Based HOL Reasoning
Steen, Alexander UL; Wisniewski, Max; Benzmüller, Christoph UL

in Greuel, GM; Koch, T; Paule, P (Eds.) et al Mathematical Software -- ICMS 2016, 5th International Congress, Proceedings (2016, July)

Detailed reference viewed: 65 (0 UL)
Full Text
Peer Reviewed
See detailEffective Normalization Techniques for HOL
Wisniewski, Max; Steen, Alexander UL; Kern, Kim et al

in Olivetti, Nicola; Tiwari, Ashish (Eds.) Automated Reasoning --- 8th International Joint Conference, IJCAR 2016, Coimbra, Portugal, June 27 -- July 2, 2016, Proceedings (2016, June)

Detailed reference viewed: 62 (0 UL)
See detailLeo-III
Steen, Alexander UL; Wisniewski, Max; Benzmüller, Christoph UL

Software (2016)

Detailed reference viewed: 51 (4 UL)
Full Text
Peer Reviewed
See detailSweet SIXTEEN: Automation via Embedding into Classical Higher-Order Logic
Steen, Alexander UL; Benzmüller, Christoph UL

in Logic and Logical Philosophy (2016), 25(4), 535-554

Detailed reference viewed: 55 (0 UL)
Full Text
Peer Reviewed
See detailEinsatz von Theorembeweisern in der Lehre
Wisniewski, Max; Steen, Alexander UL; Benzmüller, Christoph UL

in Schwill, Andreas; Lucke, Ulrike (Eds.) Hochschuldidaktik der Informatik: 7. Fachtagung des GI-Fachbereichs Informatik und Ausbildung/Didaktik der Informatik; 13.-14. September 2016 an der Universität Potsdam (2016)

Detailed reference viewed: 30 (0 UL)
Full Text
Peer Reviewed
See detailEmbedding of Quantified Higher-Order Nominal Modal Logic into Classical Higher-Order Logic
Wisniewski, Max; Steen, Alexander UL

in Benzmüller, Christpoh; Otten, Jens (Eds.) ARQNL 2014. Automated Reasoning in Quantified Non-Classical Logics (2015, December)

Detailed reference viewed: 59 (0 UL)
Full Text
Peer Reviewed
See detailThere Is No Best Beta-Normalization Strategy for Higher-Order Reasoners
Steen, Alexander UL; Benzmüller, Christoph UL

in Davis, Martin; Fehnker, Ansgar; McIver, Annabelle (Eds.) et al Logic for Programming, Artificial Intelligence, and Reasoning (LPAR) (2015, November)

Detailed reference viewed: 111 (0 UL)
Full Text
Peer Reviewed
See detailLeoPARD - A Generic Platform for the Implementation of Higher-Order Reasoners
Wisniewski, Max; Steen, Alexander UL; Benzmüller, Christoph UL

in Kerber, Manfred; Carette, Jacques; Kaliszyk, Cezary (Eds.) et al Intelligent Computer Mathematics - International Conference, CICM 2015, Washington, DC, USA, July 13-17, 2015, Proceedings (2015, June)

Detailed reference viewed: 70 (0 UL)
Full Text
See detailComputational Metaphysics
Benzmüller, Christoph UL; Wisniewski, Max; Steen, Alexander UL

Report (2015)

Detailed reference viewed: 51 (0 UL)
Full Text
See detailEfficient Data Structures for Automated Theorem Proving in Expressive Higher-Order Logics
Steen, Alexander UL

Bachelor/master dissertation (2014)

Church's Simple Theory of Types (STT), also referred to as classical higher-order logik, is an elegant and expressive formal system built on top of the simply typed λ-calculus. Its mechanisms of explicit ... [more ▼]

Church's Simple Theory of Types (STT), also referred to as classical higher-order logik, is an elegant and expressive formal system built on top of the simply typed λ-calculus. Its mechanisms of explicit binding and quantification over arbitrary sets and functions allow the representation of complex mathematical concepts and formulae in a concise and unambiguous manner. Higher-order automated theorem proving (ATP) has recently made major progress and several sophisticated ATP systems for higher-order logic have been developed, including Satallax, Osabelle/HOL and LEO-II. Still, higher-order theorem proving is not as mature as its first-order counterpart, and robust implementation techniques for efficient data structures are scarce. In this thesis, a higher-order term representation based upon the polymorphically typed λ-calculus is presented. This term representation employs spine notation, explicit substitutions and perfect term sharing for efficient term traversal, fast β-normalization and reuse of already constructed terms, respectively. An evaluation of the term representation is performed on the basis of a heterogeneous benchmark set. It shows that while the presented term data structure performs quite well in general, the normalization results indicate that a context dependent choice of reduction strategies is beneficial. A term indexing data structure for fast term retrieval based on various low-level criteria is presented and discussed. It supports symbol-based term retrieval, indexing of terms via structural properties, and subterm indexing. [less ▲]

Detailed reference viewed: 21 (1 UL)
Full Text
Peer Reviewed
See detailThe Leo-III Project
Wisniewski, Max; Steen, Alexander UL; Benzmüller, Christoph UL

in Bolotov, Alexander; Kerber, Manfred (Eds.) Proceedings of the Joint Automated Reasoning Workshop and Deduktionstreffen: As part of the Vienna Summer of Logic – IJCAR 23-24 July 2014 (2014)

Detailed reference viewed: 24 (0 UL)
See detailGeneration and State-Space Reduction of Program Graphs for Non-deterministic Programs
Steen, Alexander UL

Bachelor/master dissertation (2013)

Detailed reference viewed: 29 (2 UL)