Journal of Logic and Computation, Volume 5

Volume 5, Number 1, February 1995

• William C. Rounds, Guo-Qiang Zhang: Domain Theory Meets Default Logic. 1-25
• Paul Spruit, Roel Wieringa, John-Jules Ch. Meyer: Aziomatization, Declarative Semantics and Operational Semantics of Passive and Active Updates in Logic Databases. 27-70
• Johann A. Makowsky, Abraham Sharell: On Average Case Complexity of SAT for Symmetric Distribution. 71-92
• Marcus Kracht: Highway to the Danger Zone. 93-109
• Yuri Kaluzhny, Daniel J. Lehmann: Deductive Nonmonotonic Inference Operations: Antitonic Representations. 111-122

Volume 5, Number 2, April 1995

• Maurizio Gabbrielli, Giovanna M. Dore, Giorgio Levi: Observable Semantics for Constraint Logic Programs. 133-171
• Piero A. Bonatti: A Three-Valued Formalization of Provability. 173-201
• Michael L. Tiomkin, Michael Kaminski: Semantical Analysis of Logic of Actions. 203-212
• Anuj Dawar: Generalized Quantifiers and Logical Reducibilities. 213-226
• Dov Dori: Object-Process Analysis: Maintaining the Balance Between System Structure and Behaviour. 227-249

Volume 5, Number 3, June 1995

• Chiaki Sakama, Katsumi Inoue: Paraconsistent Stable Semantics for Extended Disjunctive Programs. 265-285
• Alexander V. Chagrov, Michael Zakharyaschev: On the Independent Axiomatizability of Modal and Intermediate Logics. 287-302
• Anastasia Analyti, Sakti Pramanik: Reliable Semantics for Extended Logic Programs with Rule Prioritization. 303-324
• Wiebe van der Hoek, Maarten de Rijke: Counting Objects. 325-345
• John Pais: Exterior Topology and Revision Spaces. 347-366
• Ines Margaria, Maddalena Zacchi: Principal Typing in a forall-and-Discipline. 367-381

Volume 5, Number 4, August 1995

• Thomas P. Jensen: Conjunctive Type Systems and Abstract Interpretation of Higher-Order Functional Programs. 397-421
• Martin C. Henson: An intensional semantics for elementary program transformations. 423-447
• Tanel Tammet: Completeness of Resolution for Definite Answers. 449-471
• Karl Schlechta: Defaults as Generalized Quantifiers. 473-494
• David Sands: A Naïve Time Analysis and its Theory of Cost Equivalence. 495-541

Volume 5, Number 5, October 1995

• Marc Denecker, Danny De Schreye: Representing Incomplete Knowledge in Abductive Logic Programming. 553-577
• Lode Missiaen, Maurice Bruynooghe, Marc Denecker: CHICA, an Abductive Planning System Based on Event Calculus. 579-602
• Amílcar Sernadas, Cristina Sernadas, José Félix Costa: Object Specification Logic. 603-630
• Adel Bouhoula, Emmanuel Kounalis, Michaël Rusinowitch: Automated Mathematical Induction. 631-668
• James T. Sasaki: Efficient Verified Programs in a Typed Theory with Mixed Constructivity. 669-689

Volume 5, Number 6, December 1995

• Joachim Posegga, Peter H. Schmitt: Automated Deduction with Shannon Graphs. 697-729
• David E. Wilkins, Karen L. Myers: A Common Knowledge Representation for Plan Generation and Reactive Execution. 731-761
• Richard Goodwin: Formalizing Properties of Agents. 763-781
• Karl Schlechta: Preferential Choice Representation Theorems for Branching Time Structures. 783-800