Abstract is missing.
- Improving On-Demand Strategy AnnotationsMaría Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas. 1-18 [doi]
- First-Order Logic as a Constraint Programming LanguageKrzysztof R. Apt, C. F. M. Vermeulen. 19-35 [doi]
- Maintenance of Formal Software Developments by Stratified VerificationSerge Autexier, Dieter Hutter. 36-52 [doi]
- A Note on Universal Measures for Weak Implicit Computational ComplexityArnold Beckmann. 53-67 [doi]
- Extending Compositional Message Sequence GraphsBenedikt Bollig, Martin Leucker, Philipp Lucas. 68-85 [doi]
- Searching for Invariants Using Temporal ResolutionJames Brotherston, Anatoli Degtyarev, Michael Fisher, Alexei Lisitsa. 86-101 [doi]
- Proof Planning for Feature Interactions: A Preliminary ReportClaudio Castellini, Alan Smaill. 102-114 [doi]
- An Extension of BDI::CTL:: with Functional Dependencies and ComponentsMehdi Dastani, Leendert W. N. van der Torre. 115-129 [doi]
- Binding Logic: Proofs and ModelsGilles Dowek, Thérèse Hardin, Claude Kirchner. 130-144 [doi]
- Directed Automated Theorem ProvingStefan Edelkamp, Peter Leven. 145-159 [doi]
- A Framework for Splitting BDI AgentsXiaocong Fan, John Yen. 160-174 [doi]
- On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate LogicsMauro Ferrari, Camillo Fiorentini, Guido Fiorino. 175-189 [doi]
- Using BDDs with Combinations of TheoriesPascal Fontaine, E. Pascal Gribomont. 190-201 [doi]
- On Expressive Description Logics with Composition of Roles in Number RestrictionsFabio Grandi. 202-215 [doi]
- Query Optimization of Disjunctive Databases with Constraints through Binding PropagationGianluigi Greco, Sergio Greco, Irina Trubitsyna, Ester Zumpano. 216-230 [doi]
- A Non-commutative Extension of MELLAlessio Guglielmi, Lutz Straßburger. 231-246 [doi]
- Procedural Semantics for Fuzzy Disjunctive ProgramsDusan Guller. 247-261 [doi]
- Pushdown SpecificationsOrna Kupferman, Nir Piterman, Moshe Y. Vardi. 262-277 [doi]
- Theorem Proving with Sequence Variables and Flexible Arity SymbolsTemur Kutsia. 278-291 [doi]
- Games, Probability and the Quantitative µ-Calculus qMµAnnabelle McIver, Carroll Morgan. 292-310 [doi]
- Parallelism and Tree Regular ConstraintsJoachim Niehren, Mateu Villaret. 311-326 [doi]
- Gödel Logics and Cantor-Bendixon AnalysisNorbert Preining. 327-336 [doi]
- A Semantics for Proof Plans with Applications to Interactive Proof PlanningJulian Richardson. 337-351 [doi]
- An Isomorphism between a Fragment of Sequent Calculus and an Extension of Natural DeductionJosé Espírito Santo. 352-366 [doi]
- Proof Development with Omega-MEGA: sqrt(2) Is IrrationalJörg H. Siekmann, Christoph Benzmüller, Armin Fiedler, Andreas Meier, Martin Pollet. 367-387 [doi]
- A Local System for Linear LogicLutz Straßburger. 388-402 [doi]
- Investigating Type-Certifying Compilation with IsabelleMartin Strecker. 403-417 [doi]
- Automating Type Soundness Proofs via Decision Procedures and Guided ReductionsDon Syme, Andrew D. Gordon. 418-434 [doi]
- Abox Satisfiability Reduced to Terminological Reasoning in Expressive Description LogicsSergio Tessaris, Ian Horrocks. 435-449 [doi]
- Fuzzy Prolog: A Simple General Implementation Using CLP(R)Claudio Vaucheret, Sergio Guadarrama, Susana Muñoz-Hernández. 450-464 [doi]