1. IJCAR 2001:
Neil D. Jones
: Program Termination Analysis by Size-Change Graphs (Abstract).
: Algorithms, Datastructures, and other Issues in Efficient Automated Deduction.
Description, Modal and Temporal Logics
: NEXPTIME-Complete Description Logics with Concrete Domains.
Saturation Based Theorem Proving, Applications, and Data Structures
: NP-Completeness of Refutability by Literal-Once Resolution.
: A Model-Based Completeness Proof of Extended Narrowing and Resolution.
: Superposition and Chaining for Totally Ordered Divisible Abelian Groups.
Logic Programming and Nonmonotonic Reasoning
: A Top-Down Procedure for Disjunctive Well-Founded Semantics.
: A Second-Order Theorem Prover Applied to Circumscription.
Propositional Satisfiability and Quantified Boolean Logic
Logical Frameworks, Higher-Order Logic, Interactive Theorem Proving
: Termination and Reduction Checking for Higher-Order Logic Programs.
Equational Theorem Proving and Term Rewriting
: Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems.
Tableau, Sequent, Natural Deduction Calculi and Proof Theory
: Incremental Closure of Free Variable Tableaux.
: A General Method for Using Schematizations in Automated Deduction.
Automata, Specification, Verification, and Logics of Programs
: MUSCADET 2.3: A Knowledge-Based Theorem Prover Based on Natural Deduction.
: Hilberticus - A Tool Deciding an Elementary Sublanguage of Set Theory.