1. IJCAR 2001:
Siena,
Italy
Rajeev Goré, Alexander Leitsch, Tobias Nipkow (Eds.):
Automated Reasoning, First International Joint Conference, IJCAR 2001, Siena, Italy, June 18-23, 2001, Proceedings.
Lecture Notes in Computer Science 2083 Springer 2001, ISBN 3-540-42254-4 BibTeX
@proceedings{DBLP:conf/cade/2001,
editor = {Rajeev Gor{\'e} and
Alexander Leitsch and
Tobias Nipkow},
title = {Automated Reasoning, First International Joint Conference, IJCAR
2001, Siena, Italy, June 18-23, 2001, Proceedings},
booktitle = {IJCAR},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2083},
year = {2001},
isbn = {3-540-42254-4},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Talks
Description,
Modal and Temporal Logics
- Volker Haarslev, Ralf Möller, Michael Wessel:
The Description Logic ALCNHR+ Extended with Concrete Domains: A Practically Motivated Approach.
29-44
Electronic Edition (Springer LINK) BibTeX
- Carsten Lutz:
NEXPTIME-Complete Description Logics with Concrete Domains.
45-60
Electronic Edition (Springer LINK) BibTeX
- Volker Haarslev, Ralf Möller, Anni-Yasmin Turhan:
Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics.
61-75
Electronic Edition (Springer LINK) BibTeX
- Ulrike Sattler, Moshe Y. Vardi:
The Hybrid µ-Calculus.
76-91
Electronic Edition (Springer LINK) BibTeX
- Franz Baader, Stephan Tobies:
The Inverse Method Implements the Automata Approach for Modal Satisfiability.
92-106
Electronic Edition (Springer LINK) BibTeX
- Regimantas Pliuskevicius:
Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL.
107-120
Electronic Edition (Springer LINK) BibTeX
- Carsten Lutz, Holger Sturm, Frank Wolter, Michael Zakharyaschev:
Tableaux for Temporal Description Logic with Constant Domains.
121-136
Electronic Edition (Springer LINK) BibTeX
- Serenella Cerrito, Marta Cialdea Mayer:
Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation.
137-151
Electronic Edition (Springer LINK) BibTeX
Saturation Based Theorem Proving,
Applications,
and Data Structures
- Andrea Formisano, Eugenio G. Omodeo, Marco Temperini:
Instructing Equational Set-Reasoning with Otter.
152-167
Electronic Edition (Springer LINK) BibTeX
- Stefan Szeider:
NP-Completeness of Refutability by Literal-Once Resolution.
168-181
Electronic Edition (Springer LINK) BibTeX
- Reiner Hähnle, Neil V. Murray, Erik Rosenthal:
Ordered Resolution vs. Connection Graph Resolution.
182-194
Electronic Edition (Springer LINK) BibTeX
- Jürgen Stuber:
A Model-Based Completeness Proof of Extended Narrowing and Resolution.
195-210
Electronic Edition (Springer LINK) BibTeX
- Hans de Nivelle, Ian Pratt-Hartmann:
A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality.
211-225
Electronic Edition (Springer LINK) BibTeX
- Uwe Waldmann:
Superposition and Chaining for Totally Ordered Divisible Abelian Groups.
226-241
Electronic Edition (Springer LINK) BibTeX
- Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela:
Context Trees.
242-256
Electronic Edition (Springer LINK) BibTeX
- Robert Nieuwenhuis, Thomas Hillenbrand, Alexandre Riazanov, Andrei Voronkov:
On the Evaluation of Indexing Techniques for Theorem Proving.
257-271
Electronic Edition (Springer LINK) BibTeX
Logic Programming and Nonmonotonic Reasoning
Propositional Satisfiability and Quantified Boolean Logic
Logical Frameworks,
Higher-Order Logic,
Interactive Theorem Proving
Semantic Guidance
Equational Theorem Proving and Term Rewriting
Tableau,
Sequent,
Natural Deduction Calculi and Proof Theory
Automata,
Specification,
Verification,
and Logics of Programs
Nonclassical Logics
Copyright © Sat May 16 23:00:05 2009
by Michael Ley (ley@uni-trier.de)
