Share on TelegramAutomated reasoning : First International Joint Conference, IJCAR 2001, Siena, Italy, June 18 23, 2001 : proce
User Rating: Be the first one!
Author: IJCAR 2001 (2001 : Siena, Italy), Goré, Rajeev, Leitsch, Alexander, 1952-, Nipkow, Tobias, 1958-
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Automatic theorem proving, Computer logic
Publishers: Berlin ; New York : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540422544
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 385.33 MB
PDF Size: 4.79 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Edition: [Elektronische Ressource]
No download statistics available.
Views: 573
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 3 540 45744 5 archive t...torrent
Last Modified: 2022-03-09 09:18:53
Download
Size: 19.16 KB
Description
Automated Reasoning: First International Joint Conference, IJCAR 2001 Siena, Italy, June 18–22, 2001 Proceedings
Author: Rajeev Goré, Alexander Leitsch, Tobias Nipkow
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42254-9
DOI: 10.1007/3-540-45744-5
Table of Contents:
Includes index
Author: Rajeev Goré, Alexander Leitsch, Tobias Nipkow
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42254-9
DOI: 10.1007/3-540-45744-5
Table of Contents:
- Program Termination Analysis by Size-Change Graphs (Abstract)
- SET Cardholder Registration: The Secrecy Proofs
- Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
- The Description Logic ALCNH
- NExpTime-Complete Description Logics with Concrete Domains
- Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics
- The Hybrid μ-Calculus
- The Inverse Method Implements the Automata Approach for Modal Satisfiability
- Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL
- Tableaux for Temporal Description Logic with Constant Domains
- Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation
- Instructing Equational Set-Reasoning with Otter
- NP-Completeness of Refutability by Literal-Once Resolution
- Ordered Resolution vs. Connection Graph resolution
- A Model-Based Completeness Proof of Extended Narrowing and Resolution
- A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality
- Superposition and Chaining for Totally Ordered Divisible Abelian Groups
- Context Trees
- On the Evaluation of Indexing Techniques for Theorem Proving
- Preferred Extensions of Argumentation Frameworks: Query, Answering, and Computation
Includes index
You May Also Like
We will be happy to hear your thoughts
