Results 11 to 20 of about 1,423 (254)
Automated Theorem Proving in the Classroom [PDF]
Electronic Proceedings in Theoretical Computer Science, 2021 We report on several scenarios of using automated theorem proving software in university education. In particular, we focus on using the Theorema system in a software-enhanced logic-course for students in computer science or artificial intelligence.
openaire +2 more sources
Clause Set Cycles and Induction [PDF]
Logical Methods in Computer Science, 2020 In this article we relate a family of methods for automated inductive theorem proving based on cycle detection in saturation-based provers to well-known theories of induction.
Stefan Hetzl, Jannik Vierling
doaj +1 more source
Some observations on the logical foundations of inductive theorem proving [PDF]
Logical Methods in Computer Science, 2018 In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a goal. Based on
Stefan Hetzl, Tin Lok Wong
doaj +1 more source
A Theorem Prover for Scientific and Educational Purposes [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We present a prototype of an integrated reasoning environment for educational purposes. The presented tool is a fragment of a proof assistant and automated theorem prover.
Mario Frank, Christoph Kreitz
doaj +1 more source
On Interpolation in Automated Theorem Proving [PDF]
Journal of Automated Reasoning, 2014 Given two inconsistent formulae, a (reverse) interpolant is a formula implied by one, inconsistent with the other, and only containing symbols they share. Interpolation finds application in program analysis, verification, and synthesis, for example, towards invariant generation.
BONACINA, Maria Paola, Moa Johansson
openaire +1 more source
Towards Intuitive Reasoning in Axiomatic Geometry [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Proving lemmas in synthetic geometry is often a time-consuming endeavour since many intermediate lemmas need to be proven before interesting results can be obtained.
Maximilian Doré, Krysia Broda
doaj +1 more source
Implementing Natural Language Inference for comparatives
Journal of Language Modelling, 2023 This paper presents a computational framework for Natural Language Inference (NLI) using logic-based semantic representations and theorem-proving. We focus on logical inferences with comparatives and other related constructions in English, which are ...
Izumi Haruta +2 more
doaj +1 more source
Influences of Frege’s Predicate Logic on Some Computational Models [PDF]
Future Human Image, 2018 The purpose of this paper is to give some insights into the immense role of Frege’s first order logic (FOL) in the development of computer science. We argue that the FOL is fundamental in computer science, and that some computer science subfields could ...
Mohamad Awwad
doaj +1 more source
The "never-proved" triangle inequality: A GeoGebra & CAS approach
AIMS Mathematics, 2023 We use a quite simple, yet challenging, elementary geometry statement, the so-called "never proved" (by a mathematician) theorem, introduced by Prof.
Zoltán Kovács +3 more
doaj +1 more source
Rewriting and Well-Definedness within a Proof System [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting.
Issam Maamria, Michael Butler
doaj +1 more source