Results 171 to 180 of about 38,933 (219)
Predictor-Based Output Feedback Control of Tumour Growth With Positive Input: Application to Antiangiogenic Therapy. [PDF]
IET Syst BiolHomayounzade M.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +2 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 +2 more sources
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 +2 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 +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
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 +1 more source
Directed Automated Theorem Proving
2002This paper analyzes the effect of heuristic search algorithms like A* and IDA* to accelerate proof-state based theorem provers. A functional implementation of possibly weighted A* is proposed that extends Dijkstra's single-source shortest-path algorithm. Efficient implementation issues and possible flaws for both A* and IDA* are discussed in detail.
Stefan Edelkamp, Peter Leven
openaire +1 more source
Automated Theorem Proving in Euler Diagram Systems
Journal of Automated Reasoning, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stapleton, Gem +4 more
openaire +1 more source
2011
The semi-decidability of provability leads to the design of proof search algorithms. This chapter first introduces the sequent calculus, gives a proof of the cut elimination theorem and discusses proof search in the cut free sequent calculus.
openaire +1 more source
The semi-decidability of provability leads to the design of proof search algorithms. This chapter first introduces the sequent calculus, gives a proof of the cut elimination theorem and discusses proof search in the cut free sequent calculus.
openaire +1 more source
Integrating Automated and Interactive Theorem Proving
1998Automated and interactive theorem proving are the two main directions in the field of deduction. Most chapters of this book belong to either the one or the other, whether focusing on theory, on methods or on systems. This reflects the fact that, for a long time, research in computer-aided reasoning was divided into these two directions, driven forward ...
Ahrendt, Wolfgang +6 more
openaire +2 more sources
Automated theorem proving for ?ukasiewicz logics
Studia Logica, 1993The paper is concerned with decision procedures for the \(\aleph_ 0\)- valued Łukasiewicz logic \(L_{\aleph_ 0}\). Within the paper, the author presents an attempt to use linear programming techniques in theorem provers for the \(\aleph_ 0\)-valued Łukasiewicz logics.
openaire +1 more source