Kein Profilbild | No profile picture | Utilisateur n'as pas d'image
https://philosophie.ch/profil/schaerf-m

Marco Schaerf (schaerf-m)

Beiträge zu Philosophie.ch

No contributions yet

Bibliography

    Cadoli, Marco, Donini, Francesco M., Liberatore, Paolo and Schaerf, Marco. 1996. Comparing Space Efficiency of Propositional Knowledge Representation Formalisms.” in KR’96: Principles of Knowledge Representation and Reasoning, edited by Luigia Carlucci Aiello, Jon Doyle, and Stuart C. Shapiro, pp. 364–374. San Francisco, California: Morgan Kaufmann Publishers.
    Cadoli, Marco, Donini, Francesco M., Liberatore, Paolo and Schaerf, Marco. 1999. The Size of a revised Knowledge Base.” Artificial Intelligence 115(1): 25–64.
    Cadoli, Marco, Donini, Francesco M. and Schaerf, Marco. 1994. Is Intractability of Non-Monotonic Logic a Real Drawback? in AAAI-94. Proceedings of the Twelfth National Conference on Artificial Intelligence, edited by Barbara Hayes-Roth and Richard E. Korf, pp. 946–951. Menlo Park, California: The AAAI Press.
    Cadoli, Marco, Donini, Francesco M. and Schaerf, Marco. 1996. Is Intractability of Nonmonotonic Reasoning a Real Drawback? Artificial Intelligence 88(1–2): 215–251.
    Cadoli, Marco and Schaerf, Marco. 1992a. Approximate Reasoning and Non-Omniscient Agents.” in TARK 1992. Theoretical Aspects of Reasoning about Knowledge: Proceedings of the Fourth Conference, edited by Yoram Moses, pp. 169–183. San Francisco, California: Morgan Kaufmann Publishers.
    Cadoli, Marco and Schaerf, Marco. 1992b. Approximation in Concept Description Languages.” in KR’92: Principles of Knowledge Representation and Reasoning, edited by Bernhard Nebel, Charles Rich, and William R. Swartout, pp. 330–341. San Francisco, California: Morgan Kaufmann Publishers.
    Cadoli, Marco and Schaerf, Marco. 1996. On the Complexity of Entailment in Propositional Multivalued Logics.” Annals of Mathematics and Artificial Intelligence 18(1): 29–50.
    Donini, Francesco M., Liberatore, Paolo, Massacci, Fabio and Schaerf, Marco. 2002. Solving QBF with SMV.” in KR’02: Principles of Knowledge Representation and Reasoning, edited by Dieter Fensel, Fausto Giunchiglia, Deborah L. McGuinness, and Mary-Anne Williams, pp. 578–589. San Francisco, California: Morgan Kaufmann Publishers.
    Liberatore, Paolo and Schaerf, Marco. 1995. Relating Belief Revision to Circumscription.” in IJCAI-95. Proceedings of the 14th International Joint Conference on Artificial Intelligence, edited by Christopher S. Mellish and C. Raymond Perrault, pp. 1557–1563. San Francisco, California: Morgan Kaufmann Publishers.
    Liberatore, Paolo and Schaerf, Marco. 1997. Reducing Belief Revision to Circumscription (and Vice Versa).” Artificial Intelligence 93(1–2): 261–296.
    Liberatore, Paolo and Schaerf, Marco. 1998. The Complexity of Model Checking for Propositional Default Logicss.” in ECAI-98. Proceedings of the Thirteenth European Conference on Artificial Intelligence, edited by Henri Prade, pp. 18–22. Hoboken, New Jersey: John Wiley; Sons, Inc.
    Liberatore, Paolo and Schaerf, Marco. 2000. Brels: A System for the Integration of Knowledge Bases.” in KR’00: Principles of Knowledge Representation and Reasoning, edited by Anthony G. Cohn, Fausto Giunchiglia, and Bart Selman, pp. 145–152. San Francisco, California: Morgan Kaufmann Publishers.
    Liberatore, Paolo and Schaerf, Marco. n.d. The Complexity of Model Checking for Belief Revision and Update.” Unpublished manuscript.
    Schaerf, Marco and Cadoli, Marco. 1995. Tractable Reasoning Via Approximation.” Artificial Intelligence 74(2): 249–310.