English
Related papers

Related papers: Making Isabelle Content Accessible in Knowledge Re…

200 papers

We present a new software tool for teaching logic based on natural deduction. Its proof system is formalized in the proof assistant Isabelle such that its definition is very precise. Soundness of the formalization has been proved in…

Computers and Society · Computer Science 2015-07-16 Jørgen Villadsen , Alexander Birch Jensen , Anders Schlichtkrull

We present a mechanically checked Isabelle/HOL bridge from the Picard-Lindelof flow infrastructure in the Archive of Formal Proofs (AFP) to selected qualitative facts for the mass-action, closed-population SIR epidemic ODE. The…

Logic in Computer Science · Computer Science 2026-05-05 David B. Hulak , Arthur F. Ramos , Ruy J. G. B. de Queiroz

The FAIR (Findable, Accessible, Interoperable, and Reusable) data principles [1] promote the interoperability of scientific data by encouraging the use of persistent identifiers, standardized vocabularies, and formal metadata structures.…

Before we can get the whole potential of employing computers in the process of managing mathematical `knowledge', we have to convert informal knowledge into machine-oriented representations. How exactly to support this process so that it…

Digital Libraries · Computer Science 2010-10-29 Constantin Jucovschi

When faced with the question of how to represent properties in a formal proof system any user has to make design decisions. We have proved three of the theorems from Maskin's 2004 survey article on Auction Theory using the Isabelle/HOL…

Logic in Computer Science · Computer Science 2014-06-04 Marco B. Caminati , Manfred Kerber , Christoph Lange , Colin Rowat

A flexible infrastructure for normative reasoning is outlined. A small-scale demonstrator version of the envisioned system has been implemented in the proof assistant Isabelle/HOL by utilising the first authors universal logical reasoning…

Artificial Intelligence · Computer Science 2018-04-10 Christoph Benzmüller , Xavier Parent

Despite the recent progress in automatic theorem provers, proof engineers are still suffering from the lack of powerful proof automation. In this position paper we first report our proof strategy language based on a meta-tool approach.…

Artificial Intelligence · Computer Science 2017-01-12 Yutaka Nagashima

Formal theorem proving, a field at the intersection of mathematics and computer science, has seen renewed interest with advancements in large language models (LLMs). This paper introduces SubgoalXL, a novel approach that synergizes…

Machine Learning · Computer Science 2024-08-22 Xueliang Zhao , Lin Zheng , Haige Bo , Changran Hu , Urmish Thakker , Lingpeng Kong

A key issue hindering discoverability, attribution and reusability of open research software is that its existence often remains hidden within the manuscript of research papers. For these resources to become first-class bibliographic…

The Isabelle/HOL proof assistant has a powerful library for continuous analysis, which provides the foundation for verification of hybrid systems. However, Isabelle lacks automated proof support for continuous artifacts, which means that…

Logic in Computer Science · Computer Science 2021-02-05 Thomas Hickman , Christian Pardillo Laursen , Simon Foster

Formal verification (FV) has witnessed growing significance with current emerging program synthesis by the evolving large language models (LLMs). However, current formal verification mainly resorts to symbolic verifiers or hand-craft rules,…

Artificial Intelligence · Computer Science 2024-06-24 Xiaohan Lin , Qingxing Cao , Yinya Huang , Haiming Wang , Jianqiao Lu , Zhengying Liu , Linqi Song , Xiaodan Liang

Proof assistants, such as Isabelle/HOL, offer tools to facilitate inductive theorem proving. Isabelle experts know how to use these tools effectively; however, they did not have a systematic way to encode their expertise. To address this…

Logic in Computer Science · Computer Science 2019-07-08 Yutaka Nagashima

We propose a simple, yet expressive proof representation from which proofs for different proof assistants can easily be generated. The representation uses only a few inference rules and is based on a frag- ment of first-order logic called…

Logic in Computer Science · Computer Science 2014-05-15 Sana Stojanovic , Julien Narboux , Marc Bezem , Predrag Janicic

We present a semantic framework for the deductive verification of hybrid systems with Isabelle/HOL. It supports reasoning about the temporal evolutions of hybrid programs in the style of differential dynamic logic modelled by flows or…

Logic in Computer Science · Computer Science 2021-09-21 Jonathan Julián Huerta y Munive , Georg Struth

The foundations of formal models for epistemic and doxastic logics often rely on certain logical aspects of modal logics such as S4 and S4.2 and their semantics; however, the corresponding mathematical results are often stated in papers or…

Logic in Computer Science · Computer Science 2024-04-24 Laura P. Gamboa Guzman , Kristin Y. Rozier

This paper describes a formal theory of smooth vector fields, Lie groups and the Lie algebra of a Lie group in the theorem prover Isabelle. Lie groups are abstract structures that are composable, invertible and differentiable. They are…

Logic in Computer Science · Computer Science 2024-07-30 Richard Schmoetten , Jacques D. Fleuriot

We report on our journey to develop ProofBuddy, a web application that is powered by a server-side instance of the proof assistant Isabelle, for the teaching and learning of proofs and proving. The journey started from an attempt to use…

Logic in Computer Science · Computer Science 2025-05-21 Nadine Karsten , Kim Jana Eiken , Uwe Nestmann

Objective: To create a commons for infectious disease (ID) epidemiology in which epidemiologists, public health officers, data producers, and software developers can not only share data and software, but receive assistance in improving…

Interactive theorem provers are complex systems that require sophisticated platform efforts - and hence systems programming environments - to manage effectively. The Isabelle platform exemplifies this with its Isabelle/Scala systems…

Logic in Computer Science · Computer Science 2024-12-18 Fabian Huch

Pattern-based, modular ontologies have several beneficial properties that lend themselves to FAIR data practices, especially as it pertains to Interoperability and Reusability. However, developing such ontologies has a high upfront cost,…

Artificial Intelligence · Computer Science 2019-04-12 Cogan Shimizu , Quinn Hirt , Pascal Hitzler