This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4-9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.
This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4-9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.
This volume constitutes the proceedings of the 11th annual Symposium on Theoretical Aspects of Computer Science (STACS '94), held in Caen, France, February 24-26, 1994. Besides three prominent invited papers, the proceedings contains 60 accepted contributions chosen by the international program committee during a highly competitive reviewing process from a total of 234 submissions for 38 countries. The volume competently represents most areas of theoretical computer science with a certain emphasis on (parallel) algorithms and complexity.
This book is a translation of Professor Wu’s seminal Chinese book of 1984 on Automated Geometric Theorem Proving. The translation was done by his former student Dongming Wang jointly with Xiaofan Jin so that authenticity is guaranteed. Meanwhile, automated geometric theorem proving based on Wu’s method of characteristic sets has become one of the fundamental, practically successful, methods in this area that has drastically enhanced the scope of what is computationally tractable in automated theorem proving. This book is a source book for students and researchers who want to study both the intuitive first ideas behind the method and the formal details together with many examples.
This advanced text for undergraduate and graduate students introduces mathematical logic with an emphasis on proof theory and procedures for algorithmic construction of formal proofs. The self-contained treatment is also useful for computer scientists and mathematically inclined readers interested in the formalization of proofs and basics of automatic theorem proving. Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in first-order logic; SLD-resolution, logic programming, and the foundations of PROLOG; and many-sorted first-order logic. Numerous problems appear throughout the book, and two Appendixes provide practical background information.
Interest in computer applications has led to a new attitude to applied logic in which researchers tailor a logic in the same way they define a computer language. In response to this attitude, this text for undergraduate and graduate students discusses major algorithmic methodologies, and tableaux and resolution methods. The authors focus on first-order logic, the use of proof theory, and the computer application of automated searches for proofs of mathematical propositions. Annotation copyrighted by Book News, Inc., Portland, OR
ACM Monograph Series: A Computational Logic focuses on the use of induction in proving theorems, including the use of lemmas and axioms, free variables, equalities, and generalization. The publication first elaborates on a sketch of the theory and two simple examples, a precise definition of the theory, and correctness of a tautology-checker. Topics include mechanical proofs, informal development, formal specification of the problem, well-founded relations, natural numbers, and literal atoms. The book then examines the use of type information to simplify formulas, use of axioms and lemmas as rewrite rules, and the use of definitions. Topics include nonrecursive functions, computing values, free variables in hypothesis, infinite backwards chaining, infinite looping, computing type sets, and type prescriptions. The manuscript takes a look at rewriting terms and simplifying clauses, eliminating destructors and irrelevance, using equalities, and generalization. Concerns include reasons for eliminating isolated hypotheses, precise statement of the generalization heuristic, restricting generalizations, precise use of equalities, and multiple destructors and infinite looping. The publication is a vital source of data for researchers interested in computational logic.
The themes of the 1997 conference are new theoretical and practical accomplishments in logic programming, new research directions where ideas originating from logic programming can play a fundamental role, and relations between logic programming and other fields of computer science. The annual International Logic Programming Symposium, traditionally held in North America, is one of the main international conferences sponsored by the Association of Logic Programming. The themes of the 1997 conference are new theoretical and practical accomplishments in logic programming, new research directions where ideas originating from logic programming can play a fundamental role, and relations between logic programming and other fields of computer science. Topics include theoretical foundations, constraints, concurrency and parallelism, deductive databases, language design and implementation, nonmonotonic reasoning, and logic programming and the Internet.
Investigates the application of logic to problem solving and computer programming. Requires no previous knowledge in this field, and therefore can be used as an introduction to logic, the theory of problem-solving and computer programming. Annotation copyrighted by Book News, Inc., Portland, OR
