Results 11 to 20 of about 39,214 (275)
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
Automated Geometric Theorem Proving: Wu's Method
The Mathematics Enthusiast, 2006 Joran Elias
openalex +4 more sources
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
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
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
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
A proof-theoretic analysis of the classical propositional matrix method [PDF]
, 2014 The matrix method, due to Bibel and Andrews, is a proof procedure designed for automated theorem-proving. We show that underlying this method is a fully structured combinatorial model of conventional classical proof theory.
Pym, D, Ritter, E, Robinson, E
core +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
Automated verification of refinement laws [PDF]
, 2009 Demonic refinement algebras are variants of Kleene algebras. Introduced by von Wright as a light-weight variant of the refinement calculus, their intended semantics are positively disjunctive predicate transformers, and their calculus is entirely within ...
Hofner, P., Struth, G., Sutcliffe, G.
core +1 more source
Automated Theorem Proving for Metamath
14th International Conference on Interactive Theorem Proving (ITP 2023), 2023 Metamath is a proof assistant that keeps surprising outsiders by its combination of a very minimalist design with a large library of advanced results, ranking high on the Freek Wiedijk’s 100 list. In this work, we develop several translations of the Metamath logic and its large set-theoretical library into higher-order and first-order TPTP formats for ...
Carneiro, Mario +2 more
openaire +4 more sources