Research Report A52:
Proceedings of the Workshop on
Computational Aspects of Nonmonotonic Reasoning
Authors: Ilkka Niemelä and Torsten Schaub (Eds.)
Date: May 1998
Pages: 87
Papers in the proceedings are available in gzipped PostScript:
Accepted Papers
- Farid Benhammadi, Pascal Nicolas, and Torsten Schaub:
Prioritized Default Theories : a New Characterization
- F. Miguel Dionisio, Stefan Brass, Mark Ryan, and Udo Lipeck:
Hypothetical Reasoning with Defaults
- Lionel Forget and Pierre Siegel:
A Proof Procedure for Circumscription
- Peter Fröhlich and Wolfgang Nejdl:
Efficient Diagnosis Based on Incomplete System Descriptions
- Eric Gregoire, Bertrand Mazure, and Lakhdar Sais:
Logically-Complete Local Search for Proposition Nonmonotonic Knowledge
Bases
- A.C. Kakas, A. Michael, and C. Mourlas:
ACLP: A Case for Non-Monotonic Reasoning
- Chiemi Kamakura, Yuka Shimajiri, Hirohisa Seki, and Hidenori Itoh:
A Magic-set Approach to Computing Stable Models on MGTP
- Thomas Linke and Torsten Schaub:
Query-Answering in Reiter's Default Logic
- Ilkka Niemelä:
Logic Programs with Stable Model Semantics as a Constraint
Programming Paradigm
- Riccardo Rosati:
From Query Answering to Satisfiability in Nonmonotonic Logics