The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marco Schaerf: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marco Cadoli, Marco Schaerf
    A Survey of Complexity Results for Nonmonotonic Logics. [Citation Graph (3, 0)][DBLP]
    J. Log. Program., 1993, v:17, n:2/3&4, pp:127-160 [Journal]
  2. Paolo Liberatore, Marco Schaerf
    The Complexity of Model Checking for Belief Revision and Update. [Citation Graph (1, 0)][DBLP]
    AAAI/IAAI, Vol. 1, 1996, pp:556-561 [Conf]
  3. Paolo Liberatore, Marco Schaerf
    Relating Belief Revision and Circumscription. [Citation Graph (1, 0)][DBLP]
    IJCAI, 1995, pp:1557-1566 [Conf]
  4. Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
    The Size of a Revised Knowledge Base. [Citation Graph (1, 10)][DBLP]
    PODS, 1995, pp:151-162 [Conf]
  5. Marco Schaerf
    Negation and Minimality in Non-Horn Databases. [Citation Graph (1, 23)][DBLP]
    PODS, 1993, pp:147-157 [Conf]
  6. Marco Cadoli, Francesco M. Donini, Marco Schaerf
    Is Intractability of Non-Monotonic Reasoning a Real Drawback? [Citation Graph (0, 0)][DBLP]
    AAAI, 1994, pp:946-951 [Conf]
  7. Marco Cadoli, Andrea Giovanardi, Marco Schaerf
    An Algorithm to Evaluate Quantified Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1998, pp:262-267 [Conf]
  8. Raffaella Colaci, Marco Schaerf
    ICARUS: Intelligent Content-Based Retrieval of 3D Scene. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:996-1001 [Conf]
  9. Paolo Liberatore, Marco Schaerf
    Compilability of Abduction. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:349-354 [Conf]
  10. Marco Cadoli, Andrea Giovanardi, Marco Schaerf
    Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    AI*IA, 1997, pp:207-218 [Conf]
  11. Marco Cadoli, Marco Schaerf
    Approximate Entailment. [Citation Graph (0, 0)][DBLP]
    AI*IA, 1991, pp:68-77 [Conf]
  12. Andrea Ferrara, Paolo Liberatore, Marco Schaerf
    The Complexity of Action Redundancy. [Citation Graph (0, 0)][DBLP]
    AI*IA, 2005, pp:1-12 [Conf]
  13. Marco Schaerf
    Logic Programming and Autoepistemic Logics: New Relations and Complexity Results. [Citation Graph (0, 0)][DBLP]
    AI*IA, 1993, pp:132-141 [Conf]
  14. Marco Cadoli, Marco Schaerf
    Partial Solutions with Unique Completion. [Citation Graph (0, 0)][DBLP]
    Reasoning, Action and Interaction in AI Theories and Systems, 2006, pp:101-115 [Conf]
  15. Emilio Domenicucci, Francesco M. Donini, Marco Schaerf
    ICARUS: Intelligent Classification And Retrieval of Unlabelled Scenes. [Citation Graph (0, 0)][DBLP]
    Description Logics, 1999, pp:- [Conf]
  16. Marco Cadoli, Marco Schaerf
    Approximate Inference in Default Logic and Circumscription. [Citation Graph (0, 0)][DBLP]
    ECAI, 1992, pp:319-323 [Conf]
  17. Paolo Liberatore, Marco Schaerf
    The Complexity of Model Checking for Propositional Default Logics. [Citation Graph (0, 0)][DBLP]
    ECAI, 1998, pp:18-22 [Conf]
  18. Luigia Carlucci Aiello, Daniele Nardi, Marco Schaerf
    Reasoning About Knowledge and Ignorance. [Citation Graph (0, 0)][DBLP]
    FGCS, 1988, pp:618-627 [Conf]
  19. Gwen Salaün, Lucas Bordeaux, Marco Schaerf
    Describing and Reasoning on Web Services using Process Algebra. [Citation Graph (0, 0)][DBLP]
    ICWS, 2004, pp:43-0 [Conf]
  20. Luigia Carlucci Aiello, Daniele Nardi, Marco Schaerf
    Yet Another Solution to the Three Wisemen Puzzle. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1988, pp:398-407 [Conf]
  21. Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
    Feasibility and Unfeasibility of Off-Line Processing. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:100-109 [Conf]
  22. Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
    Comparing Space Efficiency of Propositional Knowledge Representation Formalisms. [Citation Graph (0, 0)][DBLP]
    KR, 1996, pp:364-373 [Conf]
  23. Marco Cadoli, Marco Schaerf
    Approximation in Concept Description Languages. [Citation Graph (0, 0)][DBLP]
    KR, 1992, pp:330-341 [Conf]
  24. Francesco M. Donini, Paolo Liberatore, Fabio Massacci, Marco Schaerf
    Solving QBF by SMV. [Citation Graph (0, 0)][DBLP]
    KR, 2002, pp:578-592 [Conf]
  25. Paolo Liberatore, Marco Schaerf
    BReLS: A System for the Integration of Knowledge Bases. [Citation Graph (0, 0)][DBLP]
    KR, 2000, pp:145-152 [Conf]
  26. Luigia Carlucci Aiello, Daniele Nardi, Marco Schaerf
    Reasoning about Knowledge: The Meta-Level Approach. [Citation Graph (0, 0)][DBLP]
    SCAI, 1991, pp:4-18 [Conf]
  27. Marco Cadoli, Francesco M. Donini, Marco Schaerf
    On Compact Representations of Propositional Circumscription. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:205-216 [Conf]
  28. Marco Cadoli, Marco Schaerf
    Approximate Reasoning and Non-Omniscient Agents. [Citation Graph (0, 0)][DBLP]
    TARK, 1992, pp:169-183 [Conf]
  29. Marco Schaerf, Alessandro Tessicini
    JubilEasy: Build a Personalized 3D Visit of Rome. [Citation Graph (0, 0)][DBLP]
    VRML, 1999, pp:105-112 [Conf]
  30. Paolo Liberatore, Marco Schaerf
    Arbitration: A Commutative Operator for Belief Revision. [Citation Graph (0, 0)][DBLP]
    WOCFAI, 1995, pp:217-228 [Conf]
  31. Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
    The Size of a Revised Knowledge Base. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:115, n:1, pp:25-64 [Journal]
  32. Marco Cadoli, Francesco M. Donini, Marco Schaerf
    Is Intractability of Nonmonotonic Reasoning a Real Drawback? [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1996, v:88, n:1-2, pp:215-251 [Journal]
  33. Paolo Liberatore, Marco Schaerf
    Reducing Belief Revision to Circumscription (and Vice Versa). [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1997, v:93, n:, pp:261-296 [Journal]
  34. Marco Schaerf, Marco Cadoli
    Tractable Reasoning via Approximation. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1995, v:74, n:2, pp:249-310 [Journal]
  35. Marco Cadoli, Marco Schaerf
    On the complexity of Entailment in Propositional Multivalued Logics. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1996, v:18, n:1, pp:29-50 [Journal]
  36. Marco Schaerf
    Notes on Ginsberg's multivalued logics. [Citation Graph (0, 0)][DBLP]
    Computational Intelligence, 1991, v:7, n:, pp:154-159 [Journal]
  37. Paolo Liberatore, Marco Schaerf
    Compilability of Abduction [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  38. Marco Fratarcangeli, Marco Schaerf, Robert Forchheimer
    Facial motion cloning with radial basis functions in MPEG-4 FBA. [Citation Graph (0, 0)][DBLP]
    Graphical Models, 2007, v:69, n:2, pp:106-118 [Journal]
  39. Paolo Liberatore, Marco Schaerf
    The complexity of model checking for propositional default logics. [Citation Graph (0, 0)][DBLP]
    Data Knowl. Eng., 2005, v:55, n:2, pp:189-202 [Journal]
  40. Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
    k-Approximating Circuits [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:067, pp:- [Journal]
  41. Marco Cadoli, Marco Schaerf
    Approximate Inference in Default Logic and Circumscription. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1994, v:21, n:1/2, pp:103-112 [Journal]
  42. Marco Cadoli, Marco Schaerf
    Approximate Inference in Default Logic and Circumscription. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:23, n:1, pp:123-143 [Journal]
  43. Paolo Liberatore, Marco Schaerf
    The Compactness of Belief Revision and Update Operators. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:62, n:3-4, pp:377-393 [Journal]
  44. Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
    Preprocessing of Intractable Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:176, n:2, pp:89-120 [Journal]
  45. Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
    Space Efficiency of Propositional Knowledge Representation Formalisms. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2000, v:13, n:, pp:1-31 [Journal]
  46. Marco Cadoli, Marco Schaerf, Andrea Giovanardi, Massimo Giovanardi
    An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2002, v:28, n:2, pp:101-142 [Journal]
  47. Paolo Liberatore, Marco Schaerf
    Belief Revision and Update: Complexity of Model Checking. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:1, pp:43-72 [Journal]
  48. Marco Schaerf
    Negation and Minimality in Disjunctive Databases. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1995, v:23, n:1, pp:63-86 [Journal]
  49. Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
    k-Approximating Circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2006, v:55, n:7, pp:913-917 [Journal]
  50. Marco Cadoli, Francesco M. Donini, Marco Schaerf, Riccardo Silvestri
    On Compact Representations of Propositional Circumscription. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:182, n:1-2, pp:183-202 [Journal]
  51. Paolo Liberatore, Marco Schaerf
    Arbitration (or How to Merge Knowledge Bases). [Citation Graph (0, 12)][DBLP]
    IEEE Trans. Knowl. Data Eng., 1998, v:10, n:1, pp:76-90 [Journal]
  52. Paolo Liberatore, Marco Schaerf
    Compilability of propositional abduction. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2007, v:8, n:1, pp:- [Journal]
  53. Andrea Ferrara, Paolo Liberatore, Marco Schaerf
    Model Checking and Preprocessing. [Citation Graph (0, 0)][DBLP]
    AI*IA, 2007, pp:48-59 [Conf]
  54. Marco Schaerf
    Obituary: Marco Cadoli (1965-2006) Dipartimento di Informatica e Sistemistica, Antonio Ruberti Sapienza Universitá di Roma. [Citation Graph (0, 0)][DBLP]
    AI Commun., 2007, v:20, n:2, pp:69-70 [Journal]

  55. Reasoning about reasoning in a meta-level architecture. [Citation Graph (, )][DBLP]


Search in 0.054secs, Finished in 0.057secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002