Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
نویسنده
چکیده
Algorithms and datastructures form the kernel of any efficient theorem prover. In this abstract we discuss research on algorithms and datastructures for efficient theorem proving based on our experience with the theorem prover Vampire. We also briefly overview other works related to algorithms and datastructures, and to efficient theorem proving in general.
منابع مشابه
Deduction as an Engineering Science
Although in recent years considerable progress has been made in the theory of automated theorem proving, the use of theorem provers in practice is still more or less restricted to a limited number of academic groups. A lot of effort has been spent in techniques to optimize the underlying logic engine by, for instance, developing efficient datastructures or controlling redundancy in large search...
متن کاملFirst - order Theorem Proving 4 th International Workshop , FTP 2003 Valencia , Spain , June 12 - 14 , 2003
Although in recent years a considerable progress has been made in the theory of automated theorem proving, the use of theorem provers in practice is still more or less restricted to a limited number of academic groups. A lot of effort has been spent in techniques to optimize the underlying logic engine by, for instance, developing efficient datastructures or controlling redundancy in large sear...
متن کاملInformation from Deduction: Models and Proofs
This report documents the program and the outcomes of Dagstuhl Seminar 15381 “Information from Deduction: Models and Proofs”. The aim of the seminar was to bring together researchers working in deduction and applications that rely on models and proofs produced by deduction tools. Proofs and models serve two main purposes: (1) as an upcoming paradigm towards the next generation of automated dedu...
متن کاملAn Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کاملPartial Deduction for Assisting Automated Semantic Web Service Composition
Industry has recently recognised the need for additional descriptions of Web services beyond those provided by WSDL documents and tModels in UDDI. These descriptions should facilitate discovery, integration and composition of Web services in a more efficient way than supported currently. This need sheds light to the progress on Semantic Web services as provided by initiatives like WSMO and OWL-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001