Results 201 to 210 of about 1,423 (254)
Some of the next articles are maybe not open access.
WIREs Cognitive Science, 2014
Automated theorem proving is the use of computers to prove or disprove mathematical or logical statements. Such statements can express properties of hardware or software systems, or facts about the world that are relevant for applications such as natural language processing and planning.
openaire +3 more sources
Automated theorem proving is the use of computers to prove or disprove mathematical or logical statements. Such statements can express properties of hardware or software systems, or facts about the world that are relevant for applications such as natural language processing and planning.
openaire +3 more sources
Automated Theorem Proving 1965–1970 [PDF]
, 1983 In this article we give a critical history of automated theorem proving from 1965 through 1970. By evaluating the contributions of the period, we provide a guide to a study of the field during its development. In order to differentiate between that work which turned out to be significant and that which had lesser impact, we occasionally rely of ...
L. Henschen, Larry Wos
openaire +1 more source
2001
In modern algebraic methods for automated geometry theorem proving, Wu’s characteristic set method (Wu, 1978, 1994; Chou, 1988) and the Grobner basis method (Buchberger, Collins and Kutzler, 1988; Kutzler and Stifter, 1986; Kapur, 1986) are two basic ones.
openaire +4 more sources
In modern algebraic methods for automated geometry theorem proving, Wu’s characteristic set method (Wu, 1978, 1994; Chou, 1988) and the Grobner basis method (Buchberger, Collins and Kutzler, 1988; Kutzler and Stifter, 1986; Kapur, 1986) are two basic ones.
openaire +4 more sources
Automated theorem proving methods
BIT, 1985A quick review of the basic ideas of four theorem proving methods is given: Robinson's resolution, Kowalski's connection graph, Prawitz' matrix reduction and the author's compactness method.
openaire +2 more sources
Automated theorem proving in mathematics
Annals of Mathematics and Artificial Intelligence, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Problems and Experiments for and with Automated Theorem-Proving Programs
IEEE Transactions on Computers, 1976The two objectives of this paper are 1) to give a large and varied problem set, complete clause sets for use in testing automated theorem-proving programs and 2) the presentation of a number of experiments with an existing program under a variety of conditions.
Wos, McCharen, Overbeek
openaire +3 more sources
A Tool for Automated Theorem Proving in Agda [PDF]
, 2006 We present a tool for automated theorem proving in Agda, an implementation of Martin-Lof's intuitionistic type theory. The tool is intended to facilitate interactive proving by relieving the user from filling in simple but tedious parts of a proof. The proof search is conducted directly in type theory and produces proof terms.
Marcin Benke, Fredrik Lindblad
openaire +1 more source
Automating Theorem Proving with SMT [PDF]
, 2013 The power and automation offered by modern satisfiability-modulo-theories (SMT) solvers is changing the landscape for mechanized formal theorem proving. For instance, the SMT-based program verifier Dafny supports a number of proof features traditionally found only in interactive proof assistants, like inductive, co-inductive, and declarative proofs. To
openaire +1 more source