Anders Schlichtkrull

Anders Schlichtkrull

Auto-generated profile, based on publicly available information

Anders Schlichtkrull

Aalborg University, Aalborg, Denmark

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2019 in Electronic Proceedings in Theoretical Computer Science
Verified
Journal Article
Open access
PDF file
JVJørgen Villadsen
Jørgen Villadsen
AFAndreas Halkjær From
Andreas Halkjær From
ASAnders Schlichtkrull
Anders Schlichtkrull
We present the Natural Deduction Assistant (NaDeA) and discuss its advantages and disadvantages as a tool for teaching logic. NaDeA is available online and is based on a formalization of natural deduction in the Isabelle proof assistant. We first provide concise formulations of the main formalization results. We then elaborate on the prerequisites for NaDeA, in particular we describe a formalization in Isabelle of "Hilbert's Axioms" that we use as a starting point in our bachelor course on mathematical logic. We discuss a recent evaluation of NaDeA and also give an overview of the exercises in NaDeA.

14 January 2019
Verified
Conference Paper
Open access
ASAnders Schlichtkrull
Anders Schlichtkrull
JBJasmin Christian Blanchette
Jasmin Christian Blanchette
DTDmitriy Traytel
Dmitriy Traytel
The superposition calculus, which underlies first-order theorem provers such as E, SPASS, and Vampire, combines ordered resolution and equality reasoning. As a step towards verifying modern provers, we specify, using Isabelle/HOL, a purely functional first-order ordered resolution prover and establish its soundness and refutational completeness. Methodologically, we apply stepwise refinement to obtain, from an abstract nondeterministic specification, a verified deterministic program, written in a subset of Isabelle/HOL from which we extract purely functional Standard ML code that constitutes a semidecision procedure for first-order logic.

2 March 2018 in Electronic Proceedings in Theoretical Computer Science
Verified
Journal Article
Open access
PDF file
JVJørgen Villadsen
Jørgen Villadsen
AFAndreas Halkjær From
Andreas Halkjær From
ASAnders Schlichtkrull
Anders Schlichtkrull

20 January 2018 in Journal of Automated Reasoning
Verified
Journal Article
Closed access
PDF file
ASAnders Schlichtkrull
Anders Schlichtkrull

17 May 2018 in AI Communications
Verified
Journal Article
Closed access
PDF file
AJAlexander Birch Jensen
Alexander Birch Jensen
JLJohn Bruntse Larsen
John Bruntse Larsen
ASAnders Schlichtkrull
Anders Schlichtkrull
JVJørgen Villadsen
Jørgen Villadsen
We certify in the proof assistant Isabelle/HOL the soundness of a declarative first-order prover with equality. The LCF-style prover is a translation we have made, to Standard ML, of a prover in John Harrison’s Handbook of Practical Logic and Automat

17 June 2020 in Journal of Automated Reasoning
Verified
Journal Article
Closed access
PDF file
ASAnders Schlichtkrull
Anders Schlichtkrull
JBJasmin Blanchette
Jasmin Blanchette
DTDmitriy Traytel
Dmitriy Traytel
UWUwe Waldmann
Uwe Waldmann