AI Chat AI Image Generator AI Video Text to Speech

Pecan: An Automated Theorem Prover for Automatic Sequences using Büchi Automata

02/02/2021

∙

by Reed Oei, et al.

∙

∙

Pecan is an automated theorem prover for reasoning about properties of Sturmian words, an important object in the field of combinatorics on words. It is capable of efficiently proving non-trivial mathematical theorems about all Sturmian words.

Reed Oei
4 publications
Dun Ma
2 publications
Christian Schulz
62 publications
Philipp Hieronymi
6 publications

page 1

page 2

page 3

page 4

research

∙ 02/03/2019

Automated ZFC Theorem Proving with E

I introduce an approach for automated reasoning in first order set theor...

0 John Hester, et al. ∙

research

∙ 03/18/2016

Automatic Theorem Proving in Walnut

Walnut is a software package that implements a mechanical decision proce...

0 Hamoon Mousavi, et al. ∙

research

∙ 08/09/2013

MaLeS: A Framework for Automatic Tuning of Automated Theorem Provers

MaLeS is an automatic tuning framework for automated theorem provers. It...

0 Daniel Kühlwein, et al. ∙

research

∙ 06/14/2015

Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between Computational Time and Information Value

We show that strategies implemented in automatic theorem proving involve...

0 Santiago Hernández-Orozco, et al. ∙

research

∙ 07/27/2023

What Makes a Good Paraphrase: Do Automated Evaluations Work?

Paraphrasing is the task of expressing an essential idea or meaning in d...

0 Anna Moskvina, et al. ∙

research

∙ 04/23/2019

The Theorem Prover Museum -- Conserving the System Heritage of Automated Reasoning

We present the Theorem Prover Museum, and initiative to conserve -- and ...

0 Michael Kohlhase, et al. ∙

research

∙ 11/29/2016

Semantic Parsing of Mathematics by Context-based Learning from Aligned Corpora and Theorem Proving

We study methods for automated parsing of informal mathematical expressi...

0 Cezary Kaliszyk, et al. ∙