Results 151 to 160 of about 307,150 (181)

Automated Theorem Proving & First-Order Logic

2018
Following the line of thought begun in Chapter 1, we’ll start this chapter by introducing a topic related to AI and logic: automated theorem proving. This is a field of AI that serves mathematicians in their research and assists them in proving theorems, corollaries, and so forth.
openaire   +1 more source

The Propositional Complexity of First-Order Theorem Proving Strategies

1997
The efficiency of a theorem prover is more directly influenced by the total number of inferences performed before a proof is found than by the size of the final proof. In general, in the field of automated deduction for full first-order logic, there has been a great deal of attention devoted to the completeness of strategies but little to their ...
David A. Plaisted, Yunshan Zhu
openaire   +1 more source

Predicate Elimination for Preprocessing in First-Order Theorem Proving

2016
Preprocessing plays a major role in efficient propositional reasoning but has been less studied in first-order theorem proving. In this paper we propose a predicate elimination procedure which can be used as a preprocessing step in first-order theorem proving and is also applicable for simplifying quantified formulas in a general framework of ...
Khasidashvili, Zurab, Korovin, Konstantin   +1 more
openaire   +2 more sources

First-order automation for higher-order-logic theorem proving

1994
In comparison with higher-order-logic proof checkers, automatic theorem provers for first-order logic typically require many fewer basic proof steps for proving comparable goals. Therefore it is vital to increase the automation of higher-order logic systems in order to really benefit from their particular advantages.
openaire   +1 more source

First-order theorem proving for program analysis and theory reasoning

2015
In dieser Dissertation untersuchen wir, wie mit Beweismethoden der Pr dikatenlogik erster Stufe Programmeigenschaften gefunden und bewiesen werden k nnen. Die erarbeiteten Methoden wurden in einem vollst ndig automatisierten Tool namens Lingva umgesetzt, welches quantifizierte Invarianten ber Arrays generiert.
openaire   +1 more source

4th International Workshop on First-Order Theorem Proving- FTP'2003

2003
Proceedings of the 4th international workshop on first-order theorem proving. FTP'2003 is the fourth in a series of workshops intended to focus effort on First-Order Theorem Proving as a core theme of Automated Deduction, and to provide a forum for presentation of very recent work and discussion of research in ...
Dahn, Ingo, Vigneron, Laurent
openaire   +1 more source

Formalization of bond graph using higher-order-logic theorem proving

ISA Transactions, 2022
Adnan Rashid, Osman Hasan
exaly  

First‐order Modal Logic Theorem Proving and Functional Simulation

1993
We propose a translation approach from modal logics to first‐order predicate \u000Alogic which combines advantages from both, the (standard) relational \u000Atranslation and the (rather compact) functional translation method and avoids \u000Amany of their respective disadvantages (exponential growth versus equality \u000Ahandling).\\ In particular in ...
openaire   +1 more source

First-order polynomial based theorem proving

2000
openaire   +2 more sources

An Automated Theorem Proving in First-Order Predicate Calculus using Resolution

International Journal of Engineering Research and, 2020
null Moko Anasuodei, null James Godbless Tamaraebi   +1 more
openaire   +1 more source