AI Marco Schaerf's Recent Publications

Last Updated: December 1996.
Below you find a list of most of my recent papers (from 1993 on and most recent first). They are divided into Journal Articles, Conference Proceedings, Paper Collections, Technical Reports and Working Papers. If the title is highlighted you can download an electronic version by clicking on it. Note that the electronic version is not always identical to the printed one .

Journal Articles

  1. M. Cadoli, F. M. Donini, M. Schaerf , "Is Intractability of Nonmonotonic Reasoning a Real Drawback ?", Artificial Intelligence Journal , Vol. 88 (1-2), 1996, 215-251.

  2. M. Cadoli, F. M. Donini, M. Schaerf , R. Silvestri, "On Compact Representations of Propositional Circumscription", to appear in Theoretical Computer Science . Download the Tech Rep.

  3. P. Liberatore, M. Schaerf , "Arbitration: (or how to merge knowledge bases)", to appear in IEEE Transactions on Knowledge and Data Engineering

  4. M. Schaerf , M. Cadoli, "Tractable Reasoning via Approximation", Artificial Intelligence Journal , Vol. 74, 1995, 249-310.

  5. M. Schaerf , "Negation and Minimality in Disjunctive Databases", Journal of Logic Programming , Vol. 23 (1), 1995, 63-83.

  6. M. Cadoli, M. Schaerf , "Approximate Inference in Default Logic and Circumscription", Fundamenta Informaticae , Vol. 23, 1995, 123-143.

  7. M. Cadoli, M. Schaerf , "The Complexity of Entailment in Propositional Multivalued Logics, Annals of Mathematics and Artificial Intelligence , Vol. 18 (1), 1996, 29-50.

  8. M. Cadoli, M. Schaerf , "A Survey on Complexity Results for Non-monotonic Logics, Journal of Logic Programming , Vol. 17, 1993, 127-160.

Conference Proceedings and Paper Collections

  1. M. Cadoli, F. M. Donini, P. Liberatore, M. Schaerf , "Comparing Space Efficiency of Propositional Knowledge Representation Formalisms", Proc. of KR-96.

  2. P. Liberatore, M. Schaerf , "The Complexity of Model Checking for Belief Revision and Update", Proc. of AAAI-96.

  3. M. Cadoli, F. M. Donini, P. Liberatore, M. Schaerf , "Feasibility and Unfeasibility of Off-line Processing", Proc. of ISTCS-96.

  4. P. Liberatore, M. Schaerf , "Relating Belief Revision and Circumscription" Proc. of IJCAI-95.

  5. P. Liberatore, M. Schaerf , "Arbitration: A Commutative Operator for Belief Revision" Proc. of WOCFAI-95.

  6. M. Cadoli, F. M. Donini, P. Liberatore, M. Schaerf , "The Size of a Revised Knowledge Base", Proc. of PODS-95.

  7. M. Cadoli, F. M. Donini, M. Schaerf , "On Compact Representations of Propositional Circumscription", Proc. of STACS-95.

  8. L. Carlucci Aiello, M. Cialdea, D. Nardi, and M. Schaerf , "Modal and Meta Languages: Consistency and Expressiveness", In "Meta-Logics and Logic Programming (K. Apt, F. Turini eds)", MIT Press. Pages 243-265, 1995.

  9. M. Cadoli, F. M. Donini, M. Schaerf , "Is Intractability of Nonmonotonic Reasoning a Real Drawback ?", Proc. of AAAI-94.

  10. M. Schaerf , "Logic Programming and Autoepistemic Logics: New Relations and Complexity Results",AI*IA-93.

Technical Reports and Working Papers

  1. M. Cadoli, F. M. Donini, P. Liberatore, M. Schaerf , "The Size of a Revised Knowledge Base", Tech Report 34-96, November 1996. Extended version of PODS-95.