Results 221 to 230 of about 39,214 (275)
Automated theorem proving for the systematic analysis of interactive systems
, 2013 Michael D. Harrison +3 more
openalex +1 more source
Beyond Correctness: Exposing LLM-generated Logical Flaws in Reasoning via Multi-step Automated Theorem Proving [PDF]
Xinyi Zheng +6 more
openalex
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