en.unionpedia.org

IsaPlanner, the Glossary

Index IsaPlanner

IsaPlanner is a proof planner for the interactive proof assistant, Isabelle.[1]

Table of Contents

  1. 18 relations: Automated theorem proving, Best-first search, Combinatory logic, Conjecture, Expression (mathematics), Function (mathematics), Heuristic, Hierarchy, Higher-order logic, Isabelle (proof assistant), Iteration, Lazy evaluation, Mathematical induction, Proof assistant, Relation (mathematics), Rippling, School of Informatics, University of Edinburgh, University of Edinburgh.

  2. Automated theorem proving

Automated theorem proving

Automated theorem proving (also known as ATP or automated deduction) is a subfield of automated reasoning and mathematical logic dealing with proving mathematical theorems by computer programs.

See IsaPlanner and Automated theorem proving

Best-first search is a class of search algorithms, which explores a graph by expanding the most promising node chosen according to a specified rule.

See IsaPlanner and Best-first search

Combinatory logic

Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic.

See IsaPlanner and Combinatory logic

Conjecture

In mathematics, a conjecture is a conclusion or a proposition that is proffered on a tentative basis without proof.

See IsaPlanner and Conjecture

Expression (mathematics)

In mathematics, an expression or mathematical expression is a finite combination of symbols that is well-formed according to rules that depend on the context.

See IsaPlanner and Expression (mathematics)

Function (mathematics)

In mathematics, a function from a set to a set assigns to each element of exactly one element of.

See IsaPlanner and Function (mathematics)

Heuristic

A heuristic or heuristic technique (problem solving, mental shortcut, rule of thumb) is any approach to problem solving that employs a pragmatic method that is not fully optimized, perfected, or rationalized, but is nevertheless "good enough" as an approximation or attribute substitution.

See IsaPlanner and Heuristic

Hierarchy

A hierarchy (from Greek:, from, 'president of sacred rites') is an arrangement of items (objects, names, values, categories, etc.) that are represented as being "above", "below", or "at the same level as" one another.

See IsaPlanner and Hierarchy

Higher-order logic

In mathematics and logic, a higher-order logic (abbreviated HOL) is a form of logic that is distinguished from first-order logic by additional quantifiers and, sometimes, stronger semantics.

See IsaPlanner and Higher-order logic

Isabelle (proof assistant)

The Isabelle automated theorem prover is a higher-order logic (HOL) theorem prover, written in Standard ML and Scala.

See IsaPlanner and Isabelle (proof assistant)

Iteration

Iteration is the repetition of a process in order to generate a (possibly unbounded) sequence of outcomes.

See IsaPlanner and Iteration

Lazy evaluation

In programming language theory, lazy evaluation, or call-by-need, is an evaluation strategy which delays the evaluation of an expression until its value is needed (non-strict evaluation) and which also avoids repeated evaluations (by the use of sharing).

See IsaPlanner and Lazy evaluation

Mathematical induction

Mathematical induction is a method for proving that a statement P(n) is true for every natural number n, that is, that the infinitely many cases P(0), P(1), P(2), P(3), \dots  all hold.

See IsaPlanner and Mathematical induction

Proof assistant

In computer science and mathematical logic, a proof assistant or interactive theorem prover is a software tool to assist with the development of formal proofs by human–machine collaboration. IsaPlanner and proof assistant are automated theorem proving.

See IsaPlanner and Proof assistant

Relation (mathematics)

In mathematics, a relation on a set may, or may not, hold between two given members of the set.

See IsaPlanner and Relation (mathematics)

Rippling

In computer science, more particularly in automated theorem proving, rippling refers to a group of meta-level heuristics, developed primarily in the Mathematical Reasoning Group in the School of Informatics at the University of Edinburgh, and most commonly used to guide inductive proofs in automated theorem proving systems. IsaPlanner and rippling are automated theorem proving.

See IsaPlanner and Rippling

School of Informatics, University of Edinburgh

The School of Informatics is an academic unit of the University of Edinburgh, in Scotland, responsible for research, teaching, outreach and commercialisation in informatics.

See IsaPlanner and School of Informatics, University of Edinburgh

University of Edinburgh

The University of Edinburgh (University o Edinburgh, Oilthigh Dhùn Èideann; abbreviated as Edin. in post-nominals) is a public research university based in Edinburgh, Scotland.

See IsaPlanner and University of Edinburgh

See also

Automated theorem proving

References

[1] https://en.wikipedia.org/wiki/IsaPlanner