PAPERS ACCEPTED FOR LPNMR'97 ============================ 1. A Study of Przymusinski's Static Semantics A. Bochman 2. Programs with Universally Quantified Embedded Implications V. Petukhin 3. Is Non-Monotonic Reasoning Always Harder? U. Egly, H. Tompits 4. Composing General Logic Programs A. Brogi, S. Contiero, F. Turini 5. Resolution for Skeptical Stable Semantics P.A. Bonatti 6. Complexity of Only Knowing: The Propositional Case R. Rosati 7. Modular Logic Programming and Generalized Quantifiers T. Eiter, G. Gottlob, H. Veith 8. Separating Disbeliefs from Beliefs in Autoepistemic Reasoning T. Janhunen 9. On Conservative Enforced Updates M. Dekhtyar, A. Dikovsky, N. Spyratos 10. Affordable Classes of Normal Logic Programs J. Seitzer, J. Schlipf 11. Generalized Query Answering in Disjunctive Deductive Databases: Procedural and Non-monotonic Aspects A. Yahya 12. Power Defaults G-Q Zhang, W. C. Rounds 13. Strong and Weak Constraints in Disjunctive Datalog F. Buccafurri, N. Leone, P. Rullo 14. Simulations between Programs as Cellular Automata H. Blair, F. Dushan, P. Humenn 15. A General Framework for Revising Nonmonotonic Theories C. Witteveen, W. van der Hoek 16. Computing Non-Ground Representations of Stable Models T. Eiter, J. Lu, V.S. Subrahmanian 17. A Paraconsistent Semantics with Contradiction Support Detection C.V. Damasio, L.M. Pereira 18. Nonmonotonic Reasoning with Quantified Boolean Contraints Ch. Pollett, J. Remmel 19. Improving the Alternating Fixpoint: The Transformation Approach U. Zukowski, B. Freitag, S. Brass