Abstract is missing.
- On the Complexity of Theory CurbingThomas Eiter, Georg Gottlob. 1-19 [doi]
- Graph Operations and Monadic Second-Order Logic: A SurveyBruno Courcelle. 20-24 [doi]
- Efficient First Order Functional Program Interpreter with Time Bound CertificationsJean-Yves Marion, Jean-Yves Moyen. 25-42 [doi]
- Encoding Temporal Logics in Executable Z: A Case Study for the ZETA SystemWolfgang Grieskamp, Markus Lepper. 43-53 [doi]
- Behavioural Constructor Implementation for Regular AlgebrasSlawomir Lasota. 54-69 [doi]
- An Extensible Proof Text EditorThomas Hallgren, Aarne Ranta. 70-84 [doi]
- A Tactic Language for the System CoqDavid Delahaye. 85-95 [doi]
- Proof Simplification for Model Generation and Its ApplicationsMiyuki Koshimura, Ryuzo Hasegawa. 96-113 [doi]
- Have Spass with OCC1N::g:::::=:::Christian G. Fermüller, Georg Moser. 114-130 [doi]
- Compiling and Verifying Security ProtocolsFlorent Jacquemard, Michaël Rusinowitch, Laurent Vigneron. 131-160 [doi]
- Equational Binary Decision DiagramsJan Friso Groote, Jaco van de Pol. 161-178 [doi]
- A PVS Proof Obligation Generator for Lustre ProgramsCécile Canovas-Dumas, Paul Caspi. 179-188 [doi]
- Efficient Structural Information Analysis for Real CLP LanguagesRoberto Bagnara, Patricia M. Hill, Enea Zaffanella. 189-206 [doi]
- Playing Logic Programs with the Alpha-Beta AlgorithmJean-Vincent Loddo, Roberto Di Cosmo. 207-224 [doi]
- Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A ComparisonNikolay Pelov, Emmanuel De Mot, Marc Denecker. 225-239 [doi]
- Quantified Propositional Gödel LogicsMatthias Baaz, Agata Ciabattoni, Richard Zach. 240-256 [doi]
- Proof-Search in Implicative Linear Logic as a Matching ProblemPhilippe de Groote. 257-274 [doi]
- A New Model Construction for the Polymorphic Lambda CalculusDieter Spreen. 275-292 [doi]
- Church s Lambda Delta CalculusRichard Statman. 293-307 [doi]
- Querying Inconsistent DatabasesSergio Greco, Ester Zumpano. 308-325 [doi]
- How to Decide Query Containment Under Constraints Using a Description LogicIan Horrocks, Ulrike Sattler, Sergio Tessaris, Stephan Tobies. 326-343 [doi]
- Static Reduction Analysis for Imperative Object Oriented LanguagesGilles Barthe, Bernard P. Serpette. 344-361 [doi]
- An Abstract Interpretation Approach to Termination of Logic ProgramsRoberta Gori. 362-380 [doi]
- Using an Abstract Representation to Specialize Functional Logic ProgramsElvira Albert, Michael Hanus, Germán Vidal. 381-398 [doi]
- Binding-Time Analysis by Constraint Solving. A Modular and Higher-Order Approach for MercuryWim Vanhoof. 399-416 [doi]
- Efficient Evaluation Methods for Guarded Logics and Datalog LITEErich Grädel. 417 [doi]
- On the Alternation-Free Horn Mu-calculusJean-Marc Talbot. 418-435 [doi]
- The Boundary between Decidable and Undecidable Fragments of the Fluent CalculusSteffen Hölldobler, Dietrich Kuske. 436-450 [doi]
- Solving Planning Problems by Partial DeductionHelko Lehmann, Michael Leuschel. 451-468 [doi]
- A Kripkean Semantics for Dynamic Logic ProgrammingJán Sefránek. 469-486 [doi]