Marco Schaerf

Angela Di Iorio, Marco Schaerf, Matteo Bertazzo: Establishing a Digital Library in Wide-Ranging University's Context - The Sapienza Digital Library Experience. IRCDL 2012: 172-183

Paolo Liberatore, Marco Schaerf: On the Complexity of Finding Second-Best Abductive Explanations. CoRR abs/1204.5859 (2012)

Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman: Monte-Carlo Style UCT Search for Boolean Satisfiability. AI*IA 2011: 177-188

Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman: Applying UCT to Boolean Satisfiability. SAT 2011: 373-374

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Space Efficiency of Propositional Knowledge Representation Formalisms. CoRR abs/1106.0233 (2011)

Paolo Liberatore, Marco Schaerf: On the size of data structures used in symbolic model checking. CoRR abs/1012.3018 (2010)

Marco Schaerf: Obituary: Marco Cadoli (1965-2006) Dipartimento di Informatica e Sistemistica, Antonio Ruberti Sapienza Universitá di Roma. AI Commun. 20(2): 69-70 (2007)

Marco Fratarcangeli, Marco Schaerf, Robert Forchheimer: Facial motion cloning with radial basis functions in MPEG-4 FBA. Graphical Models 69(2): 106-118 (2007)

Paolo Liberatore, Marco Schaerf: Compilability of propositional abduction. ACM Trans. Comput. Log. 8(1) (2007)

Andrea Ferrara, Paolo Liberatore, Marco Schaerf: Model Checking and Preprocessing. AI*IA 2007: 48-59

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: k-Approximating Circuits. IEEE Trans. Computers 55(7): 913-917 (2006)

Marco Cadoli, Marco Schaerf: Partial Solutions with Unique Completion. Reasoning, Action and Interaction in AI Theories and Systems 2006: 101-115

Oliviero Stock, Marco Schaerf (Eds.): Reasoning, Action and Interaction in AI Theories and Systems, Essays Dedicated to Luigia Carlucci Aiello. Lecture Notes in Computer Science 4155, Springer 2006, isbn 3-540-37901-0

Paolo Liberatore, Marco Schaerf: The complexity of model checking for propositional default logics. Data Knowl. Eng. 55(2): 189-202 (2005)

Andrea Ferrara, Paolo Liberatore, Marco Schaerf: The Complexity of Action Redundancy. AI*IA 2005: 1-12

Paolo Liberatore, Marco Schaerf: The Compactness of Belief Revision and Update Operators. Fundam. Inform. 62(3-4): 377-393 (2004)

Gwen Salaün, Lucas Bordeaux, Marco Schaerf: Describing and Reasoning on Web Services using Process Algebra. ICWS 2004: 43-

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Preprocessing of Intractable Problems. Inf. Comput. 176(2): 89-120 (2002)

Marco Cadoli, Marco Schaerf, Andrea Giovanardi, Massimo Giovanardi: An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation. J. Autom. Reasoning 28(2): 101-142 (2002)

Francesco M. Donini, Paolo Liberatore, Fabio Massacci, Marco Schaerf: Solving QBF by SMV. KR 2002: 578-592

Paolo Liberatore, Marco Schaerf: Compilability of Abduction. CoRR cs.AI/0210007 (2002)

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: k-Approximating Circuits. Electronic Colloquium on Computational Complexity (ECCC)(067) (2002)

Paolo Liberatore, Marco Schaerf: Belief Revision and Update: Complexity of Model Checking. J. Comput. Syst. Sci. 62(1): 43-72 (2001)

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Space Efficiency of Propositional Knowledge Representation Formalisms. J. Artif. Intell. Res. (JAIR) 13: 1-31 (2000)

Paolo Liberatore, Marco Schaerf: Compilability of Abduction. AAAI/IAAI 2000: 349-354

Raffaella Colaci, Marco Schaerf: ICARUS: Intelligent Content-Based Retrieval of 3D Scene. AAAI/IAAI 2000: 996-1001

Paolo Liberatore, Marco Schaerf: BReLS: A System for the Integration of Knowledge Bases. KR 2000: 145-152

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: The Size of a Revised Knowledge Base. Artif. Intell. 115(1): 25-64 (1999)

Emilio Domenicucci, Francesco M. Donini, Marco Schaerf: ICARUS: Intelligent Classification And Retrieval of Unlabelled Scenes. Description Logics 1999

Marco Schaerf, Alessandro Tessicini: JubilEasy: Build a Personalized 3D Visit of Rome. VRML 1999: 105-112

Paolo Liberatore, Marco Schaerf: Arbitration (or How to Merge Knowledge Bases). IEEE Trans. Knowl. Data Eng. 10(1): 76-90 (1998)

Marco Cadoli, Andrea Giovanardi, Marco Schaerf: An Algorithm to Evaluate Quantified Boolean Formulae. AAAI/IAAI 1998: 262-267

Paolo Liberatore, Marco Schaerf: The Complexity of Model Checking for Propositional Default Logics. ECAI 1998: 18-22

Paolo Liberatore, Marco Schaerf: Reducing Belief Revision to Circumscription (and Vice Versa). Artif. Intell. 93: 261-296 (1997)

Marco Cadoli, Francesco M. Donini, Marco Schaerf, Riccardo Silvestri: On Compact Representations of Propositional Circumscription. Theor. Comput. Sci. 182(1-2): 183-202 (1997)

Marco Cadoli, Andrea Giovanardi, Marco Schaerf: Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae. AI*IA 1997: 207-218

Marco Cadoli, Francesco M. Donini, Marco Schaerf: Is Intractability of Nonmonotonic Reasoning a Real Drawback? Artif. Intell. 88(1-2): 215-251 (1996)

Marco Cadoli, Marco Schaerf: On the complexity of Entailment in Propositional Multivalued Logics. Ann. Math. Artif. Intell. 18(1): 29-50 (1996)

Paolo Liberatore, Marco Schaerf: The Complexity of Model Checking for Belief Revision and Update. AAAI/IAAI, Vol. 1 1996: 556-561

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Feasibility and Unfeasibility of Off-Line Processing. ISTCS 1996: 100-109

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Comparing Space Efficiency of Propositional Knowledge Representation Formalisms. KR 1996: 364-373

Marco Schaerf, Marco Cadoli: Tractable Reasoning via Approximation. Artif. Intell. 74(2): 249-310 (1995)

Marco Cadoli, Marco Schaerf: Approximate Inference in Default Logic and Circumscription. Fundam. Inform. 23(1): 123-143 (1995)

Marco Schaerf: Negation and Minimality in Disjunctive Databases. J. Log. Program. 23(1): 63-86 (1995)

Paolo Liberatore, Marco Schaerf: Relating Belief Revision and Circumscription. IJCAI 1995: 1557-1566

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: The Size of a Revised Knowledge Base. PODS 1995: 151-162

Marco Cadoli, Francesco M. Donini, Marco Schaerf: On Compact Representations of Propositional Circumscription. STACS 1995: 205-216

Paolo Liberatore, Marco Schaerf: Arbitration: A Commutative Operator for Belief Revision. WOCFAI 1995: 217-228

Marco Cadoli, Marco Schaerf: Approximate Inference in Default Logic and Circumscription. Fundam. Inform. 21(1/2): 103-112 (1994)

Marco Cadoli, Francesco M. Donini, Marco Schaerf: Is Intractability of Non-Monotonic Reasoning a Real Drawback? AAAI 1994: 946-951

Marco Cadoli, Marco Schaerf: A Survey of Complexity Results for Nonmonotonic Logics. J. Log. Program. 17(2/3&4): 127-160 (1993)

Marco Schaerf: Logic Programming and Autoepistemic Logics: New Relations and Complexity Results. AI*IA 1993: 132-141

Marco Schaerf: Negation and Minimality in Non-Horn Databases. PODS 1993: 147-157

Marco Cadoli, Marco Schaerf: Approximate Inference in Default Logic and Circumscription. ECAI 1992: 319-323

Marco Cadoli, Marco Schaerf: Approximation in Concept Description Languages. KR 1992: 330-341

Marco Cadoli, Marco Schaerf: Approximate Reasoning and Non-Omniscient Agents. TARK 1992: 169-183

Luigia Carlucci Aiello, Daniele Nardi, Marco Schaerf: Reasoning about reasoning in a meta-level architecture. Appl. Intell. 1(1): 55-67 (1991)

Marco Schaerf: Notes on Ginsberg's multivalued logics. Computational Intelligence 7: 154-159 (1991)

Marco Cadoli, Marco Schaerf: Approximate Entailment. AI*IA 1991: 68-77

Luigia Carlucci Aiello, Daniele Nardi, Marco Schaerf: Reasoning about Knowledge: The Meta-Level Approach. SCAI 1991: 4-18

Luigia Carlucci Aiello, Daniele Nardi, Marco Schaerf: Reasoning About Knowledge and Ignorance. FGCS 1988: 618-627

Luigia Carlucci Aiello, Daniele Nardi, Marco Schaerf: Yet Another Solution to the Three Wisemen Puzzle. ISMIS 1988: 398-407