Titlebook: Intellectics and Computational Logic; Papers in Honor of W Steffen H?lldobler Book 2000 Springer Science+Business Media Dordrecht 2000 Prol

Decimate

失望未來(lái)

Matrix-Based Constructive Theorem Proving,rules. Even proof parts that rely entirely on predicate logic can seldomly be found automatically, as there are no complete proof search procedures embedded into these systems. It is therefore desirable to extend the reasoning power of proof assistants by integrating well-understood techniques from automated theorem proving.

Hot-Flash

Complex Plans in the Fluent Calculus,plan. The plan may be given to it by a programmer, it may have (semi-)automatically generated the plan from the initial state, the goal state and the descriptions of the primitive actions it is able to perform or it may have learned it from examples. For the purpose of this article we just assume that a plan at the abstract level is given.

鎮(zhèn)壓

A Complete Neural Network Algorithm for Horn-SAT,how to combine the fields of symbolic problem solving by means of Neural Networks and parallel complexity theory to develop a neural network algorithm that solves propositional SAT-problems within the time bounds given by the results of complexity theory.

Outwit

Automated Theorem Proving in High-Quality Software Design,er systems are used in the area of telecommunication (telephone, electronic commerce) or space exploration. Computer applications in this area are not only subject to safety considerations, but also security issues are important.

省略

A Confluent Connection Calculus, developments like A-ordered tableaux (Klingenbeck and H?hnle, 1994; H?hnle and Klingenbeck, 1996), and tableaux with selection function (H?hnle and Pape, 1997). Let us refer to all these calculi by the term “rigid variable methods”. Recently complexity issues for those kinds of calculi have been considered in (Voronkov, 1998; Voronkov, 1997).

theta-waves

糾纏,纏繞