Automated Deduction Cade 11
Download Automated Deduction Cade 11 PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Automated Deduction Cade 11 book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Automated Deduction, CADE-11
"This volume contains the papers presented at the Eleventh International Conference on Automated Deduction (CADE-11) held in Saratoga Springs, NY, inJune 1992. A total of 136 papers were submitted for presentation by researchers from nearly 20 countries. Papers covered many topics including: resolution; term rewriting; natural deduction; theorem proving, in particular in algebra and geometry; parallel theoremprovers; unification theory; constraint solving; logic programing; verification; multivalued, temporal and nonclassical logics; non-monotonic reasoning; planning; proof theory; higher-order logics; and inductive theorem proving. Each submission was reviewed by at least three program committee members and 46 papers were selected for presentation and publication. This volume also contains short descriptions of 23 implementations of automated deduction systems. The volume opens with a keynote address by Larry Wos, winner of the first Herbrand Award for Distinguished Contributions to Automated Reasoning."--PUBLISHER'S WEBSITE.
Automated Deduction, Cade-12.
Author: Alan Bundy
language: en
Publisher: Springer Science & Business Media
Release Date: 1994-06-08
This volume contains the reviewed papers presented at the 12th International Conference on Automated Deduction (CADE-12) held at Nancy, France in June/July 1994. The 67 papers presented were selected from 177 submissions and document many of the most important research results in automated deduction since CADE-11 was held in June 1992. The volume is organized in chapters on heuristics, resolution systems, induction, controlling resolutions, ATP problems, unification, LP applications, special-purpose provers, rewrite rule termination, ATP efficiency, AC unification, higher-order theorem proving, natural systems, problem sets, and system descriptions.