- Number 1-2, November 1996

- Number 3-4, December 1996

- Belief Revision in Non-Monotonic Reasoning and Logic Programming
- J. J. ALFERES, L. M. PERREIRA and T. C. PRZYMUSINSKI
- Meta-variables in Logic Programming, or in Praise of Ambivalent Syntax
- K. R. APT and R. BEN-ELIYAHU
- Designing Dependencies
- H. A. BLAIR
- Why Denotational? Remarks on Applied Denotational Semantics
- A. BLIKLE
- Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations
- J. DIX, G. GOTTLOB and W. MAREK
- A Modal Herbrand Theorem
- M. FITTING
- Approximating the Stable Model Semantics is Hard
- G. GOTTLOB, M. TRUSZCZYNSKI
- Automating Algebraic Proofs in Algebraic Logic
- J. HSIANG and A. WASILEWSKA
- The Algebraic Specifications do not have the Tennenbaum Property
- G. MIRKOWSKA and A. SALWICKI
- Logic Programming from the Perspective of Algebraic Semantics
- J. A. PLAZA
- Satisfiability of Inequalities in a Poset
- V. PRATT and J. TIURYN
- On the Power of Compositional Proofs for Nets: Relationships Between Completenesess and Modularity
- B. A. TRAKHTENBROT
- Positive Recursive Type Assignment
- P. URZYCZYN

- Rough Sets Through Algebraic Logic
- M. BANERJEE and M. K. CHAKRABORTY
- On a Logical Basis of Normal Logic Programs
- A. BOCHMAN
- A Method in Linguistic Reasoning on a Knowledge Base Representing by Sentences with Linguistic Belief Degreee
- NGUYEN CAT HO
- A Reduction Result for Circumscribed Semi-Horn Formulas
- P. DOHERTY, W. LUKASIEWICZ and A. SZALAS
- A Rough Set Model of Information Retrieval
- J. GREEEN, N. HORNE, E. ORLOWSKA and P. SIEMERS
- Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis.
- D. GRIGORIEV, M. KARPINSKI and A. M. ODLYZKO
- On Semantics for the Nonmonotonic Modal Formalization of the Logic of Acceptance and Rejection
- A. GOMOLINSKA
- Parallel Communicating Grammar Systems with Negotiation
- G. PAUN, L. POLKOWSKI and A. SKOWRON
- Argumentation Systems
- S. RADEV
- Dynamic Behaviour of Spatial Signal OR-Graphs
- W. SKARBEK
- Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach
- Z. SURAJ
- A Two-Stage Approach to First Order Default Reasoning
- K. SZLECHTA
- Concatenable Weighted Pomsets and Their Applications to Modelling Processes of Petri Nets
- J. WINKOWSKI
- Theoretical Foundations of Order-Based Genetic Algorithms
- J. WROBLEWSKI