Results 221 to 230 of about 1,423 (254)

Automated reasoning in geometry theorem proving with Prolog

Journal of Automated Reasoning, 1986
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luís Moniz Pereira, Helder Coelho
openaire   +3 more sources

Automated theorem proving

2016
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2016, Director: Juan Carlos Martínez ...
openaire   +1 more source

Methods for Automated Theorem Proving in Nonclassical Logics

IEEE Transactions on Computers, 1976
In this paper we outline two basic methods for automated theorem proving in nonclassical logics, including modal, many-valued, relevance, and intuitionistic logics. We discuss advantages and disadvantages of each method and give several illustrative examples.
openaire   +3 more sources

Automated Theorem Proving with Web Services

2013
Automated theorem provers (ATP) usually operate on finite input where all relevant axioms and conjectures are known at the start of the proof attempt. However, when a prover is embedded in a real-world knowledge representation application, it may have to draw upon data that is not immediately available in a local file, for example by accessing ...
openaire   +2 more sources

Orderings in Automated Theorem Proving

1998
This paper is intended to give an introduction to several techniques used in automated theorem proving, and based on the concept of ordering on terms and more generally on formulas. Different orderings and their automation are presented and several applications are considered.
openaire   +1 more source

Clue as a Testbed for Automated Theorem Proving

2002
Recent articles explore formalizations of the popular board game Clue. For several years, this game was used as a testbed for automated theorem proving exercises in the context of introductory and advanced AI classes at the University of Saskatchewan, by way of motivating the usefulness of Prolog Technology Theorem Provers (PTTPS) as game playing ...
openaire   +2 more sources

Strategy selection for automated theorem proving

1998
Automated theorem provers use search strategies. Unfortunately, no strategy is uniformly successful on all problems. This motivates us to spend the available resources in terms of processors and time on different strategies. In this paper, we develop the basic concept of the complementarity of strategy sets.
openaire   +2 more sources

Recent advances in automated theorem proving on inequalities

Journal of Computer Science and Technology, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On Automated Theorem Proving

Annals of the New York Academy of Sciences, 1992
Stephen Russell, Traci Wheeler Unisys
openaire   +2 more sources

A New Class of Automated Theorem-Proving Algorithms

Journal of the ACM, 1974
A procedure is defined for deriving from any statementSan infinite sequence of statementsS0,S1,S2,S3, ··· such that: (a) if there exists anisuch thatSiis unsatisfiable, thenSis unsatisfiable; (b) ifSis unsatisfiable, then there exists anisuch thatSiis unsatisfiable; (c) for allithe Herbrand universe ofSiis finite; hence, for eachithe satisfiability ...
openaire   +3 more sources