
	Where results make sense

Topic: E equational theorem prover

Related Topics

Automated theorem proving

Bob Lee

Apt

Deer Trail, Colorado

Precompositional

Cajuru

Singapore Democratic Party

Alexandria Aces

Arcanum

In the News (Sat 2 Jun 12)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	Automated theorem proving - Wikipedia, the free encyclopedia
		Interactive provers are used for a variety of tasks, but even fully automatic systems have by now proven a number of interesting and hard theorems, including some that have eluded human mathematicians for a long time.
		A good example of this was the machine-aided proof of the four color theorem, which was very controversial as the first claimed mathematical proof which was essentially impossible to verify by humans due to the enormous size of the program's calculation (such proofs are called non-surveyable proofs).
		E is a high-performance prover built on a purely equational calculus, developed primarily in the automated reasoning group of Technical University of Munich.
	en.wikipedia.org /wiki/Theorem_prover (1136 words)

	E equational theorem prover - Wikipedia, the free encyclopedia
		E is a modern, high performance theorem prover for full first-order logic with equality.
		E is implemented in C and portable to most UNIX dialects.
		E - A Brainiac Theorem Prover, Stephan Schulz, Journal of AI Communications 15(2/3), 2002.
	en.wikipedia.org /wiki/E_equational_theorem_prover (190 words)

	E Equational Theorem Prover 0.61 "North Tukvar" released
		E Equational Theorem Prover 0.61 "North Tukvar" released
		E is a a purely equational theorem prover for clausal logic with equality.
		E is available as a source distribution for UNIX-variants.
	lists.gnu.org /archive/html/info-gnu/2001-04/msg00013.html (292 words)

	CASC-17 Entrants' System Descriptions
		E 0.6 [Sch99] is a purely equational theorem prover.
		MUSCADET is a theorem prover based upon Natural Deduction, in the sense of [Ble71] and [Pas78].
		Methods include splitting theorems into two or more subtheorems (conjunctive conclusion or disjunctive hypotheses), treatment of universal, existential or disjunctive conclusion, treatment of existential or disjunctive hypotheses (one at a time when it is decided by heuristic rules), replacement of the conclusion by its definition.
	www.cs.miami.edu /~tptp/CASC/17/SystemDescriptions.html (4247 words)

	The E Equational Theorem Prover
		E is a a purely equational theorem prover for full first-order logic.
		E's inference core is based on a modified version of the superposition calculus for equational clausal logic as described in [BG94].
		E also demands that each symbol is used only as a function symbol, a predicate, or a constant (SETHEO allows the same symbol to take on more than one role in different contexts, which is clearly the Wrong Thing).
	www4.informatik.tu-muenchen.de /~schulz/WORK/eprover.html (949 words)

	Mechanized Reasoning Systems (Site not responding. Last check: 2007-10-10)
		E is a theorem prover for clausal logic with equality.
		INKA is a first-order theorem prover with induction which is based on the explicit induction paradigm.
		Nqthm is a prover for quantifier free logic for recursive functions over the integers and other finitely generated structures, combining rewriting, heuristics for induction, and other techniques.
	www-formal.stanford.edu /clt/ARS/systems.html (1545 words)

	E Equational Theorem Prover -- Command line options (Site not responding. Last check: 2007-10-10)
		This option is particularly useful if you want to use E as a preprocessor or lemma generator in a larger system.
		This causes the prover to be potentially incomplete, but will allow you to limit the maximum amount of memory used fairly well.
		A value of 0 means no rewriting, 1 indicates to use rules (orientable equations) only, 2 indicates full rewriting with rules and instances of unorientable equations.
	www.risc.uni-linz.ac.at /institute/systems/documentation/AutomatedDeductionSystems/SupportedSystems/eprover/index_3.html (1563 words)

	Introduction; the Basic Session Model
		The basic model for a session under this prover is that the user enters a term in the internal language of the prover, further restrained by declarations of constants and operations in the theory in which the user is working.
		The user views a selected subterm of the current version of the right side of the equation; he may issue ``movement'' commands which change which subterm is selected, or he may apply theorems as rewrite rules to the selected subterm.
		When the equation has assumed the form the user wants, it is ``proved'' as a theorem and becomes available for use as a rewrite rule.
	math.boisestate.edu /~holmes/mark2/node3.html (517 words)

	Rewriting Systems
		E Prover (Equational Theorem Prover) - a high performance purely equational theorem prover for clausal logic.
		LP (the Larch Prover) - a first order prover designed for a middle ground between proof checkers that require detailed guidance and theorem provers that work completely automatically.
		Recently the theorem prover has been used for hardware verification application.
	rewriting.loria.fr /systems.html (829 words)

	The E Equational Theorem Prover -- Archive
		If you are looking for a good theorem prover to actually do work with, please consider the download section of the E home page, which has the latest released version.
		As for the main distribution, old versions of E are only available as source distributions for various versions of UNIX.
		E 0.6 is the release version of the prover that won the MIX category of the CASC-17 competition in 2000.
	www4.informatik.tu-muenchen.de /~schulz/WORK/old_download.html (418 words)

	Notes on concepts
		Specifiers are not limited to a fixed set of notations, but can use LSL to define specialized vocabularies suitable for particular interface specifications or classes of specifications.
		For example, if you give it the axioms for a group and state that there are two noncommuting elements, it will produce a noncommutative group.
		is a highly efficient theorem prover for positive unit equality clauses.
	piru.alexandria.ucsb.edu /~buchel/concepts/page2.htm (1490 words)

	Automated Reasoning Group Old HOL System
		ACL2 is a theorem proving system produced at Computational Logic, Inc. The acronym ``ACL2'' stands for ``A Computational Logic for Applicative Common Lisp.'' ACL2 is similar to the Boyer-Moore theorem prover, Nqthm, and Kaufmann's interactive extension, Pc-Nqthm.
		The proof attempt will typically fail, but examination of the prover's log (which is in English) will reveal either a flaw in the conjecture or a lemma that the prover needs to be aware of to succeed.
		Rewrite Rule Laboratory is a theorem prover for first-order logic with an emphasis on equational reasoning.
	www.cl.cam.ac.uk /Research/HVG/HOL/HOL.html (2689 words)

	:: equational :: related - ( e prover theorem ) by Spell-Dictionary (Site not responding. Last check: 2007-10-10)
		:: equational :: related - (e prover theorem) by Spell-Dictionary
		1 the process of equating or making equal; the state of being equal.
		equation of the first order, second order, etc. an equation involving only the first derivative, second derivative, etc.
	www.spell-dictionary.com /db/equational (69 words)

	Robbins Algebras Are Boolean (Site not responding. Last check: 2007-10-10)
		This theorem was proved automatically by EQP, a theorem proving program developed at Argonne National Laboratory.
		The proof that solves the Robbins problem was found October 10, 1996, by the theorem prover EQP.
		Our approach to this problem is to have the theorem prover construct a detailed proof object and have a very simple program (written in a high-level language) check that the proof object is correct.
	www.mcs.anl.gov /home/mccune/ar/robbins (793 words)

	Experiments With Subdivision of Search in Distributed Theorem Proving - Bonacina (ResearchIndex)
		We tried Peers mcd on the theorem Robbins algebras are Boolean, which was proved first by EQP [81] and we observe 2 that the...
		4 the reconstruction of proofs in distributed theorem proving:..
		1 The Clause-Diffusion theorem prover Peers-mcd (context) - Bonacina - 1997
	citeseer.ist.psu.edu /bonacina97experiments.html (693 words)

	Untitled -- Mathematical Services (Site not responding. Last check: 2007-10-10)
		They differ in their degree of automation respectively interaction with a human counterpart: some, like the PVS verifier [104] or Coq [103] are proof assistants more than automated provers; others, like Theorema [125], aim at utmost automation of the proving process.
		Because of the variety of different provers with different capabilities, their integration has been always of big interest [60][58].
		This is not surprising, because the topics are actually closely related; for instance, the Theorema system developed at RISC-Linz not only combines different provers into a natural deduction environment [20] but uses external computer algebra solvers for finding witnesses of existential formulas [14].
	poseidon.risc.uni-linz.ac.at:8080 /mathbroker/proposal/index_5.html (351 words)

	Linux Applications page (Site not responding. Last check: 2007-10-10)
		E is a a purely equational theorem prover for clausal logic.
		That means it is a program that you can stuff a mathematical specification (in clausal logic with equality) and a hypothesis into, and which will then run forever, using up all of your machines resources.
		Very occasionally it will find a proof for the hypothesis and tell you so ;-).
	wwits.net /linuxapps/detail.php3?Id=965 (61 words)

	Untitled -- References (Site not responding. Last check: 2007-10-10)
		Theorems and Algorithms: An Interface between Isabelle and Maple.
		Extending the HOL Theorem Prover with a Computer Algebra System to Reason About the Reals.
		SPASS: An Automated Theorem Prover for First-Order Logic with Equality, October 2000.
	poseidon.risc.uni-linz.ac.at:8080 /proposal/index_16.html (1880 words)

	Linux-Misc Digest #707
		I was just about to post some questions about how I would go about writing a program that did just that.
		Be warned that this can consume inane (in fact, theoretically unlimited) amounts of CPU time and memory for diffcult problems.
		This makes it possible to get good results even with low to medium amounts of memory (32 MB should work fine even for many hard proof problems).
	www.mail-archive.com /linux-misc@senator-bedfellow.mit.edu/msg00798.html (3827 words)

	[Fwd: E Equational Theorem Prover 0.61 "North Tukvar" released] (Site not responding. Last check: 2007-10-10)
		[Fwd: E Equational Theorem Prover 0.61 "North Tukvar" released]
		> > E is a a purely equational theorem prover for clausal logic with > equality.
		We take this as a sign that E performs relatively well overall.
	lists.tunes.org /archives/review/2001-April/000131.html (387 words)

	Mathematics Software For Linux
		This is not to say there will be no new features, but there is much work to be done before that stage will be reached, and for now new features are not likely to be our focus.
		JACAL can manipulate and simplify equations, scalars, vectors, and matrices of single and multiple valued algebraic expressions containing numbers, variables, radicals, and algebraic differential, and holonomic functions.
		LAPACK is written in Fortran77 and provides routines for solving systems of simultaneous linear equations, least-squares solutions of linear systems of equations, eigenvalue problems, and singular value problems.
	karmak.org /2003/linux-scimath/math.html (3701 words)

	E (Site not responding. Last check: 2007-10-10)
		You give it a mathematical specification (in clausal logic with equality) and a hypothesis; it will then try to find a proof for the hypothesis (and sometimes succeed).
		E is build on top of (and by now inseparable from) CLIB, a collection of library functions for building programs the follow the basic input-processing-output paradigm, with additional support for most levels of first-order logic.
		Higher level modules implement shared and unshared terms, equations, clauses and related stuff.
	directory.fsf.org /all_packages_in_directory/E.html (316 words)

	Sau La Lodtua: 94/1
		For the last two or three years, I have been writing an equational theorem prover, first in the research language Standard ML and now in C++.
		The logical capabilities of the prover are more than ample for the needs of the logic implemented in Loglan, although the underlying logical paradigm is somewhat different.
		For example, I have written a "program" under the prover which automatically "simplifies" expressions in the propositional calculus and incidentally identifies tautologies.
	www.loglan.org /Lodtua/lodtua-94-1.html (1012 words)

	Fundamentals of Deductive Program Synthesis (Site not responding. Last check: 2007-10-10)
		Bledsoe and L. Hines, "Variable elimination and chaining in a resolution-based prover for inequalities," in Proc.
		Felty and D. Miller, "Specifying theorem provers in a higher-order logic programming language," in Proc.
		Paulson, "The foundations of a generic theorem prover," J.
	csdl2.computer.org /persagen/DLAbsToc.jsp?resourcePath=/dl/trans/ts/&toc=comp/trans/ts/1992/08/e8toc.xml&DOI=10.1109/32.153379 (730 words)

	Some Experiments on the Applicability of Folding Architecture Networks to Guide Theorem Proving - Schulz, Kuchler, ...
		Abstract: One of the major problems in theorem proving is the control of proof search.
		A promising approach is the application of machine learning techniques for the acquisition of search control knowledge by learning from successful proof searches.
		3 SETHEO: A High-Perormance Theorem Prover (context) - Letz, Schumann et al.
	citeseer.ist.psu.edu /44988.html (633 words)

	Maude Manual -- 2.3 Module Hierarchies
		As already mentioned, and further explained in Section 4, a system module is a rewrite theory with initial semantics.
		Note that we can use the inclusion of membership equational logic into rewriting logic to view a functional module specifying an equational theory (Omega,E) as a degenerate case of a rewrite theory, namely the rewrite theory (Omega,E,Ø,Ø).
		Using the proof techniques in [4] together with an inductive theorem prover for membership equational logic and a Church-Rosser checker such as those described in [12], this can be done for functional modules; and it seems natural to expect that these techniques and tools will extend to similar ones for rewrite theories.
	maude.cs.uiuc.edu /maude1/manual/maude-manual-html/maude-manual_14.html (961 words)

	theorem prover - OneLook Dictionary Search (Site not responding. Last check: 2007-10-10)
		We found one dictionary with English definitions that includes the word theorem prover:
		Tip: Click on the first link on a line below to go directly to a page where "theorem prover" is defined.
		Phrases that include theorem prover: acl2 theorem prover, e equational theorem prover, gandalf theorem prover, hol theorem prover, isabelle theorem prover, more...
	www.onelook.com /cgi-bin/cgiwrap/bware/dofind.cgi?word=theorem+prover (93 words)

	EQP: Equational Theorem Prover (Site not responding. Last check: 2007-10-10)
		EQP is an automated theorem proving program for first-order equational logic.
		EQP is not as stable and polished as our main production theorem prover Otter.
		Otter, a theorem prover for full first-order logic with equality
	www-unix.mcs.anl.gov /AR/eqp (201 words)

	Linux-Misc Digest #688
		------------------------------ From: [EMAIL PROTECTED] (Stephan Schulz) Crossposted-To: gnu.announce,alt.sources.d Subject: E Equational Theorem Prover 0.32 "Lingia" released Date: 15 Jun 1999 17:27:35 GMT The E equational theorem prover version 0.32 "Lingia" has been released.
		E 0.32 has been tested on all 3334 CNF problems of the TPTP problem library, version 2.2.0, and showed no unexpected behaviour.
		The only thing that RH have contributed to me was it blew one of my 17" monitor during set up.
	mail-archive.com /linux-misc@senator-bedfellow.mit.edu/msg02329.html (4193 words)

Try your search on: Qwika (all wikis)