This thesis presents an approach to learning good search guiding heuristics for the supposition-based theorom prover E in equational deductions. Search decisions from successful proof searches are represented as sets annotated clause patterns. Term Space Mapping, an alternative learning method for recursive structures is used to learn heuristic evaluation functions for the evaluation of potential new consequences. Experimental results with extended system E/TSM show the success of the approach. Additional contributions of the thesis are an extended superposition calculus and a description of both the proof procedure and the implementation of a state-of-the-art equational theorem prover.
This book constitutes the proceedings of the 20th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR-20, held in November 2015, in Suva, Fiji. The 43 regular papers presented together with 1 invited talk included in this volume were carefully reviewed and selected from 92 submissions. The series of International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, LPAR, is a forum where, year after year, some of the most renowned researchers in the areas of logic, automated reasoning, computational logic, programming languages and their applications come to present cutting-edge results, to discuss advances in these fields, and to exchange ideas in a scientifically emerging part of the world.
This book constitutes the refereed proceedings of the 6th International Joint Conference on Automated Reasoning, IJCAR 2012, held in Manchester, UK, in June 2012. IJCAR 2012 is a merger of leading events in automated reasoning, namely CADE (International Conference on Automated Deduction), FroCoS (International Symposium on Frontiers of Combining Systems), FTP (International Workshop on First-Order Theorem Proving), and TABLEAUX (International Conference on Automated Reasoning with Analytic Tableaux and Related Methods). The 32 revised full research papers and 9 system descriptions presented together with 3 invited talks were carefully reviewed and selected from 116 submissions. The papers address all aspects of automated reasoning, including foundations, implementations, and applications.
Handbook of the History of Logic brings to the development of logic the best in modern techniques of historical and interpretative scholarship. Computational logic was born in the twentieth century and evolved in close symbiosis with the advent of the first electronic computers and the growing importance of computer science, informatics and artificial intelligence. With more than ten thousand people working in research and development of logic and logic-related methods, with several dozen international conferences and several times as many workshops addressing the growing richness and diversity of the field, and with the foundational role and importance these methods now assume in mathematics, computer science, artificial intelligence, cognitive science, linguistics, law and many engineering fields where logic-related techniques are used inter alia to state and settle correctness issues, the field has diversified in ways that even the pure logicians working in the early decades of the twentieth century could have hardly anticipated. Logical calculi, which capture an important aspect of human thought, are now amenable to investigation with mathematical rigour and computational support and fertilized the early dreams of mechanised reasoning: "Calculemus. The Dartmouth Conference in 1956 – generally considered as the birthplace of artificial intelligence – raised explicitly the hopes for the new possibilities that the advent of electronic computing machinery offered: logical statements could now be executed on a machine with all the far-reaching consequences that ultimately led to logic programming, deduction systems for mathematics and engineering, logical design and verification of computer software and hardware, deductive databases and software synthesis as well as logical techniques for analysis in the field of mechanical engineering. This volume covers some of the main subareas of computational logic and its applications. - Chapters by leading authorities in the field - Provides a forum where philosophers and scientists interact - Comprehensive reference source on the history of logic
1. BASIC CONCEPTS OF INTERACTIVE THEOREM PROVING Interactive Theorem Proving ultimately aims at the construction of powerful reasoning tools that let us (computer scientists) prove things we cannot prove without the tools, and the tools cannot prove without us. Interaction typi cally is needed, for example, to direct and control the reasoning, to speculate or generalize strategic lemmas, and sometimes simply because the conjec ture to be proved does not hold. In software verification, for example, correct versions of specifications and programs typically are obtained only after a number of failed proof attempts and subsequent error corrections. Different interactive theorem provers may actually look quite different: They may support different logics (first-or higher-order, logics of programs, type theory etc.), may be generic or special-purpose tools, or may be tar geted to different applications. Nevertheless, they share common concepts and paradigms (e.g. architectural design, tactics, tactical reasoning etc.). The aim of this chapter is to describe the common concepts, design principles, and basic requirements of interactive theorem provers, and to explore the band width of variations. Having a 'person in the loop', strongly influences the design of the proof tool: proofs must remain comprehensible, - proof rules must be high-level and human-oriented, - persistent proof presentation and visualization becomes very important.
This volume contains the contributions to the Joint German/Austrian Con- rence on Arti?cial Intelligence, KI 2001, which comprises the 24th German and the 9th Austrian Conference on Arti?cial Intelligence. They are divided into the following categories: – 2 contributions by invited speakers of the conference; – 29 accepted technical papers, of which 5 where submitted as application papers and 24 as papers on foundations of AI; – 4 contributions by participants of the industrial day, during which companies working in the ?eld presented their AI applications. After a long period of separate meetings, the German and Austrian Societies ̈ for Arti?cial Intelligence, KI and OGAI, decided to hold a joint conference in Vienna in 2001. The two societies had previously held one joint conference. This took place in Ottstein, a small town in Lower Austria, in 1986. At that time, the rise of expert system technology had also renewed interest in AI in general, with quite some expectations for future advances regarding the use of AI techniques in applications pervading many areas of our daily life. Since then ?fteen years have passed, and we may want to comment, at the beginning of a newcentury, on the progress that has been made in this direction.
This book constitutes the refereed proceedings of the 13th International Symposium on Frontiers of Combining Systems, FroCoS 2021, held in Birmingham, UK, in September 2021.
This book constitutes the refereed proceedings of the 13th International Conference on Automated Deduction, CADE-13, held in July/August 1996 in New Brunswick, NJ, USA, as part of FLoC '96. The volume presents 46 revised regular papers selected from a total of 114 submissions in this category; also included are 15 selected system descriptions and abstracts of two invited talks. The CADE conferences are the major forum for the presentation of new results in all aspects of automated deduction. Therefore, the volume is a timely report on the state-of-the-art in the area.
