Automated Reasoning
First International Joint Conference, IJCAR 2001 Siena, Italy, June 18-23, 2001 Proceedings (Lecture Notes in Computer Science)
1 edition
Our rough guess is there are 177,000 words in this book.
At a pace averaging 250 words per minute, this book will take 11 hours and 48 minutes to read. With a half hour per day, this will take 24 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Rajeev Gore (Editor) - Contributor
- Alexander Leitsch (Editor) - Contributor
- Tobias Nipkow (Editor) - Contributor
Publication
2001-08-09 - Springer
Language
English
Word Count
177,000 words, Guess
Page Count
708 pages
Physical Format
Paperback
Identifiers
- Open LibraryOL9869085M
- ISBN-139783540422549
- ISBN-103540422544
- OCLC Control Number505189233
- OCLC Control Number123141162
and 3 more
- Internet Archiveautomatedreasoni0000ijca_l9z6
- Library of Congress Control Number2001041144
- Goodreads993979
Classifications
- LCCQA76.9.A96 I38 2001
- LCCQ334-342
Description
Automated Reasoning: First International Joint Conference, IJCAR 2001 Siena, Italy, June 18–22, 2001 Proceedings<br />Author: Rajeev Goré, Alexander Leitsch, Tobias Nipkow<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-42254-9<br /> DOI: 10.1007/3-540-45744-5<br /><br />Table of Contents:<p></p><ul><li>Program Termination Analysis by Size-Change Graphs (Abstract) </li><li>SET Cardholder Registration: The Secrecy Proofs </li><li>Algorithms, Datastructures, and other Issues in Efficient Automated Deduction </li><li>The Description Logic ALCNH </li><li>NExpTime-Complete Description Logics with Concrete Domains </li><li>Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics </li><li>The Hybrid μ-Calculus </li><li>The Inverse Method Implements the Automata Approach for Modal Satisfiability </li><li>Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL </li><li>Tableaux for Temporal Description Logic with Constant Domains </li><li>Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation </li><li>Instructing Equational Set-Reasoning with Otter </li><li>NP-Completeness of Refutability by Literal-Once Resolution </li><li>Ordered Resolution vs. Connection Graph resolution </li><li>A Model-Based Completeness Proof of Extended Narrowing and Resolution </li><li>A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality </li><li>Superposition and Chaining for Totally Ordered Divisible Abelian Groups </li><li>Context Trees </li><li>On the Evaluation of Indexing Techniques for Theorem Proving </li><li>Preferred Extensions of Argumentation Frameworks: Query, Answering, and Computation</li></ul>
First Sentence
Size-change analysis is based on size-change graphs giving local approximations to parameter size changes derivable from program syntax.
Subjects
Topics
Other Editions
- Automated Reasoning: First International Joint Conference, IJCAR 2001 Siena, Italy, June 18-23, 2001 Proceedings (Lecture Notes in Computer Science)
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!