Improving On-Demand Strategy Annotations -- First-Order Logic as a Constraint Programming Language -- Maintenance of Formal Software Developments by Stratified Verification -- A Note on Universal Measures for Weak Implicit Computational Complexity -- Extending Compositional Message Sequence Graphs -- Searching for Invariants Using Temporal Resolution -- Proof Planning for Feature Interactions: A Preliminary Report -- An Extension of BDICTL with Functional Dependencies and Components -- Binding Logic: Proofs and Models -- Directed Automated Theorem Proving -- A Framework for Splitting BDI Agents -- On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics -- Using BDDs with Combinations of Theories -- On Expressive Description Logics with Composition of Roles in Number Restrictions -- Query Optimization of Disjunctive Databases with Constraints through Binding Propagation -- A Non-commutative Extension of MELL -- Procedural Semantics for Fuzzy Disjunctive Programs -- Pushdown Specifications -- Theorem Proving with Sequence Variables and Flexible Arity Symbols -- Games, Probability, and the Quantitative ?-Calculus qM? -- Parallelism and Tree Regular Constraints -- Gödel Logics and Cantor-Bendixon Analysis -- A Semantics for Proof Plans with Applications to Interactive Proof Planning -- An Isomorphism between a Fragment of Sequent Calculus and an Extension of Natural Deduction -- Proof Development with ?MEGA: ?2 Is Irrational -- A Local System for Linear Logic -- Investigating Type-Certifying Compilation with Isabelle -- Automating Type Soundness Proofs via Decision Procedures and Guided Reductions -- Abox Satisfiability Reduced to Terminological Reasoning in Expressive Description Logics -- Fuzzy Prolog: A Simple General Implementation Using (R).