|
Prover9
Prover9 is an automated theorem proving, automated theorem prover for first-order logic, first-order and equational logic developed by William McCune. Description Prover9 is the successor of the Otter (theorem prover), Otter theorem prover also developed by William McCune. Prover9 is noted for producing relatively readable proofs and having a powerful hints strategy. Prover9 is intentionally paired with Mace4, which searches for finite models and counterexamples. Both can be run simultaneously from the same input, with Prover9 attempting to find a proof, while Mace4 attempts to find a (disproving) counter-example. Prover9, Mace4, and many other tools are built on an underlying library named LADR ("Library for Automated Deduction Research") to simplify implementation. Resulting proofs can be double-checked by Ivy, a automated proof checking, proof-checking tool that has been separately verified using ACL2. In July 2006 the LADR/Prover9/Mace4 input language made a major change (which ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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. Automated reasoning over mathematical proof was a major motivating factor for the development of computer science. Logical foundations While the roots of formalized Logicism, logic go back to Aristotelian logic, Aristotle, the end of the 19th and early 20th centuries saw the development of modern logic and formalized mathematics. Gottlob Frege, Frege's ''Begriffsschrift'' (1879) introduced both a complete propositional logic, propositional calculus and what is essentially modern predicate logic. His ''The Foundations of Arithmetic, Foundations of Arithmetic'', published in 1884, expressed (parts of) mathematics in formal logic. This approach was continued by Bertrand Russell, Russell and Alfred North Whitehead, Whitehead in their influential ''Principia Mathematica'', first published 1910� ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
William McCune
William Walker McCune (December 17, 1953 – May 2, 2011) was an American computer scientist and logician working in the fields of automated reasoning, algebra, logic, and formal methods. Biography He was best known for the development of the Otter, Prover9, and Mace4 automated reasoning systems, and the automated proof of the Robbins conjecture In abstract algebra, a Robbins algebra is an algebra containing a single binary operation, usually denoted by \lor, and a single unary operation usually denoted by \neg satisfying the following axioms: For all elements ''a'', ''b'', and ''c'': # A ... using the EQP theorem prover. In 2000, McCune received the Herbrand Award for Distinguished Contributions to Automated Reasoning. In 2013, ''Automated Reasoning and Mathematics - Essays in Memory of William W. McCune'' was published in his honour. References External links Prover9 softwareWilliam McCune home pageUpdated version of Prover9 software {{DEFAULTSORT:McCune, William ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Otter (theorem Prover)
OTTER (Organized Techniques for Theorem-proving and Effective Research) is an automated theorem prover developed by William McCune at Argonne National Laboratory in Illinois. Otter was the first widely distributed, high-performance theorem prover for first-order logic, and it pioneered a number of important implementation techniques. ''Otter'' is an acronym for ''Organized Techniques for Theorem-proving and Effective Research''. Description Otter is based on resolution and paramodulation, constrained by term orderings similar to those in the superposition calculus. The prover also supports positive and negative hyperresolution and a set-of-support strategy. Proof search is based on saturation using a version of the given-clause algorithm, and is controlled by several heuristics. There also are meta-heuristics determining search parameters automatically. Otter also pioneered the use of efficient term indexing techniques to speed up the search for inference partners in large ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mace4
Models And Counter-Examples (Mace) is a model finder. Most automated theorem provers try to perform a proof by refutation on the clause normal form of the proof problem, by showing that the combination of axioms and negated conjecture can never be simultaneously true, i.e. does not have a model. A model finder such as Mace, on the other hand, tries to find an explicit model of a set of clauses. If it succeeds, this corresponds to a counter-example for the conjecture, i.e. it disproves the (claimed) theorem. Mace is GNU GPL licensed. See also * Otter (theorem prover) * Prover9 Prover9 is an automated theorem proving, automated theorem prover for first-order logic, first-order and equational logic developed by William McCune. Description Prover9 is the successor of the Otter (theorem prover), Otter theorem prover also dev ... References External links System download Free theorem provers Software using the GNU General Public License {{logic-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Automated Proof Checking
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. This involves some sort of interactive proof editor, or other User interface, interface, with which a human can guide the search for proofs, the details of which are stored in, and some steps provided by, a computer. A recent effort within this field is making these tools use artificial intelligence to automate the formalization of ordinary mathematics. System comparison * ACL2 – a programming language, a first-order logical theory, and a theorem prover (with both interactive and automatic modes) in the Boyer–Moore tradition. * Rocq (software), Rocq (formerly known as ''Coq'') – Allows the expression of mathematical assertions, mechanically checks proofs of these assertions, helps to find formal proofs, and extracts a certified program from the constructive proof ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Clausal Form
In Boolean algebra, a formula is in conjunctive normal form (CNF) or clausal normal form if it is a conjunction of one or more clauses, where a clause is a disjunction of literals; otherwise put, it is a product of sums or an AND of ORs. In automated theorem proving, the notion "''clausal normal form''" is often used in a narrower sense, meaning a particular representation of a CNF formula as a set of sets of literals. Definition A logical formula is considered to be in CNF if it is a conjunction of one or more disjunctions of one or more literals. As in disjunctive normal form (DNF), the only propositional operators in CNF are or (\vee), and (\and), and not (\neg). The ''not'' operator can only be used as part of a literal, which means that it can only precede a propositional variable. The following is a context-free grammar for CNF: : ''CNF'' \, \to \, ''Disjunct'' \, \mid \, ''Disjunct'' \, \land \, ''CNF'' : ''Disjunct'' \, \to \, ''Literal'' \, \mid\, ''Literal'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quebec City
Quebec City is the capital city of the Provinces and territories of Canada, Canadian province of Quebec. As of July 2021, the city had a population of 549,459, and the Census Metropolitan Area (including surrounding communities) had a population of 839,311. It is the twelfthList of the largest municipalities in Canada by population, -largest city and the seventh-List of census metropolitan areas and agglomerations in Canada, largest metropolitan area in Canada. It is also the List of towns in Quebec, second-largest city in the province, after Montreal. It has a humid continental climate with warm summers coupled with cold and snowy winters. Explorer Samuel de Champlain founded a French settlement here in 1608, and adopted the Algonquin name. Quebec City is one of the List of North American cities by year of foundation, oldest European settlements in North America. The Ramparts of Quebec City, ramparts surrounding Old Quebec () are the only fortified city walls remaining in the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Charles University
Charles University (CUNI; , UK; ; ), or historically as the University of Prague (), is the largest university in the Czech Republic. It is one of the List of oldest universities in continuous operation, oldest universities in the world in continuous operation, the oldest university north of the Alps and east of University of Paris, Paris. Today, the university consists of 17 faculties located in Prague, Hradec Králové, and Plzeň. History Medieval university (1349–1419) The establishment of a medieval university in Prague was inspired by Holy Roman Emperor Charles IV, Holy Roman Emperor, Charles IV. He requested his friend and ally, Pope Clement VI, to create the university. On 26 January 1347, the pope issued the bull establishing a university in Prague, modeled on the University of Paris, with all four faculty (division), faculties, including theology. On 7 April 1348 Charles, the king of Bohemia, gave to the established university privileges and immunities from the se ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Irrational Number
In mathematics, the irrational numbers are all the real numbers that are not rational numbers. That is, irrational numbers cannot be expressed as the ratio of two integers. When the ratio of lengths of two line segments is an irrational number, the line segments are also described as being '' incommensurable'', meaning that they share no "measure" in common, that is, there is no length ("the measure"), no matter how short, that could be used to express the lengths of both of the two given segments as integer multiples of itself. Among irrational numbers are the ratio of a circle's circumference to its diameter, Euler's number ''e'', the golden ratio ''φ'', and the square root of two. In fact, all square roots of natural numbers, other than of perfect squares, are irrational. Like all real numbers, irrational numbers can be expressed in positional notation, notably as a decimal number. In the case of irrational numbers, the decimal expansion does not terminate, nor end ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Square Root Of 2
The square root of 2 (approximately 1.4142) is the positive real number that, when multiplied by itself or squared, equals the number 2. It may be written as \sqrt or 2^. It is an algebraic number, and therefore not a transcendental number. Technically, it should be called the ''principal'' square root of 2, to distinguish it from the negative number with the same property. Geometrically, the square root of 2 is the length of a diagonal across a Unit square, square with sides of one unit of length; this follows from the Pythagorean theorem. It was probably the first number known to be irrational number, irrational. The fraction (≈ 1.4142857) is sometimes used as a good Diophantine approximation, rational approximation with a reasonably small denominator. Sequence in the On-Line Encyclopedia of Integer Sequences consists of the digits in the decimal expansion of the square root of 2, here truncated to 60 decimal places: : History The Babylonian clay tablet YBC 7289 (–1 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Free Software
Free software, libre software, libreware sometimes known as freedom-respecting software is computer software distributed open-source license, under terms that allow users to run the software for any purpose as well as to study, change, distribute it and any adapted versions. Free software is a matter of liberty, not price; all users are legally free to do what they want with their copies of a free software (including profiting from them) regardless of how much is paid to obtain the program.Selling Free Software (GNU) Computer programs are deemed "free" if they give end-users (not just the developer) ultimate control over the software and, subsequently, over their devices. The right to study and modify a computer program entails that the source code—the preferred ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
GNU General Public License
The GNU General Public Licenses (GNU GPL or simply GPL) are a series of widely used free software licenses, or ''copyleft'' licenses, that guarantee end users the freedom to run, study, share, or modify the software. The GPL was the first copyleft license available for general use. It was originally written by Richard Stallman, the founder of the Free Software Foundation (FSF), for the GNU Project. The license grants the recipients of a computer program the rights of the Free Software Definition. The licenses in the GPL series are all copyleft licenses, which means that any derivative work must be distributed under the same or equivalent license terms. The GPL is more restrictive than the GNU Lesser General Public License, and even more distinct from the more widely used permissive software licenses such as BSD, MIT, and Apache. Historically, the GPL license family has been one of the most popular software licenses in the free and open-source software (FOSS) domai ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
