Journal of Logic and Computation, Volume 8

Volume 8, Number 1, February 1998

Dov M. Gabbay: Editorial. 3
Robert Harper, Frank Pfenning: A Module System for a Programming Language Based on the LF Logical Framework. 5-31
Melvin Fitting: leanTAP Revisited. 33-47
Seyed-Hassan Mirian-Hosseinabadi, Raymond Turner: Constructive Z. 49-70
Lauri Hella, Henrik Imhof: Enhancing Fixed Point Logic with Cardinality Quantifiers. 71-86
Gösta Grahne: Updates and Counterfactuals. 87-117
David Gries, Fred B. Schneider: Adding the Everywhere Operator to Propositional Logic. 119-129

A. K. Shiny, Arun K. Pujari: Computation of Prime Implicants Using Matrix and Paths. 135-145
Michael Freund: Preferential Orders and Plausibility Measures. 147-158
Wilfried Buchholz: A Note on SLDNF-Resolution. 159-167
Michael Kaminski, Johann A. Makowsky, Michael L. Tiomkin: Extensions for Open Default Theories via the Domain Closure Assumption. 169-187
Arnaud Durand, Clemens Lautemann, Thomas Schwentick: Subclasses of Binary NP. 189-207
Gopalan Nadathur: Uniform Provability in Classical Logic. 209-229

Nicholas R. Jennings, Michael Wooldridge, Fausto Giunchiglia: Editorial. 231-232
Mark d'Inverno, Michael Luck: Engineering AgentSpeak(L): A Formal Computational Model. 233-260
Simon Parsons, Carles Sierra, Nicholas R. Jennings: Agents That Reason and Negotiate by Arguing. 261-292
Anand S. Rao, Michael P. Georgeff: Decision Procedures for BDI Logics. 293-342
Clare Dixon, Michael Fisher, Michael Wooldridge: Resolution for Temporal Logics of Knowledge. 345-372
Fabio Massacci: Tableau Methods for Formal Verification of Multi-Agent Distributed Systems. 373-400
Massimo Benerecetti, Fausto Giunchiglia, Luciano Serafini: Model Checking Multiagent Systems. 401-423
Munindar P. Singh: Applying the Mu-Calculus in Planning and Reasoning about Action. 425-445

Roberto Giacobazzi: Abductive Analysis of Modular Logic Programs. 457-483
Hans Hüttel, Colin Stirling: Actions Speak Louder Than Words: Proving Bisimilarity for Context-Free Processes. 485-509
Nicolas Peltier: A New Method for Automated Finite Model Building Exploiting Failures and Symmetries. 511-543
Rachel Cardell-Oliver: An Equivalence Theorem for the Operational and Temporal Semantics of Real-Time, Concurrent Programs. 545-567
Bernhard Beckert, Reiner Hähnle, Gonzalo Escalada-Imaz: Simplification of Many-Valued Logic Formulas Using Anti-Links. 569-587
Lex Hendriks: Intuitionistic Propositional Logic with Only Equivalence Has No Interpolation. 589-593

Matteo Baldoni, Laura Giordano, Alberto Martelli: A Modal Extension of Logic Programming: Modularity, Beliefs and Hypothetical Reasoning. 597-635
A. D. Yashin: New Solutions to Novikov's Problem for Intuitionistic Connectives. 637-664
Maurizio Castellan, Mario Piazza: Saturated Formulas in Full Linear Logic. 665-668
Alexander Moshe Rabinovich: On the Decidability of Continuous Time Specification Formalisms. 669-678
Kevin Lano: Logical Specification of Reactive and Real-Time Systems. 679-711

Tanel Tammet, Jan M. Smith: Optimized Encodings of Fragments of Type Theory in First-Order Logic. 713-744
Mirian Halfeld Ferrari Alves, Dominique Laurent, Nicolas Spyratos: Update Rules in Datalog Programs. 745-775
Javier Pinto: Occurrences and Narratives as Constraints in the Branching Structure of the Situation Calculus. 777-808
Samin S. Ishtiaq, David J. Pym: A Relevant Analysis of Natural Deduction. 809-838
Stefano Baratella, Stefano Berardi: Approximating Classical Theorems. 839-854
Thomas Drakengren, Peter Jonsson: Reasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic. 855-875