default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Schaerf
Person information
- affiliation: Sapienza University of Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j39]Sofia Ceccarelli
, Amedeo Cesta, Gabriella Cortellessa, Riccardo De Benedictis, Francesca Fracasso, Laura Leopardi, Luca Ligios, Ernesto Lombardi, Saverio Giulio Malatesta, Angelo Oddi, Alfonsina Pagano, Augusto Palombini, Gianmauro Romagna, Marta Sanzari, Marco Schaerf:
Evaluating visitors' experience in museum: Comparing artificial intelligence and multi-partitioned analysis. Digit. Appl. Archaeol. Cult. Heritage 33: 00340 (2024)- 2023
- [j38]Irene Finocchi, Andrea Ribichini, Marco Schaerf:
An analysis of international mobility and research productivity in computer science. Scientometrics 128(11): 6147-6175 (2023) - [c46]Sofia Ceccarelli, Amedeo Cesta, Gabriella Cortellessa, Riccardo De Benedictis, Francesca Fracasso, Laura Leopardi, Luca Ligios, Ernesto Lombardi, Saverio Giulio Malatesta, Angelo Oddi, Alfonsina Pagano, Augusto Palombini, Gianmauro Romagna, Marta Sanzari, Marco Schaerf:
Artificial Intelligence Algorithms for the Analysis of User Experience in Palazzo Braschi Museum. GCH 2023: 185-187 - 2022
- [j37]Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf:
Which Conference Is That? A Case Study in Computer Science. ACM J. Data Inf. Qual. 14(3): 18:1-18:13 (2022) - [j36]Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf:
On computer science research and its temporal evolution. Scientometrics 127(8): 4913-4938 (2022) - [c45]Simone Rossetti, Damiano Zappia, Marta Sanzari, Marco Schaerf, Fiora Pirri:
Max Pooling with Vision Transformers Reconciles Class and Shape in Weakly Supervised Semantic Segmentation. ECCV (30) 2022: 446-463 - [i7]Simone Rossetti, Damiano Zappia, Marta Sanzari, Marco Schaerf, Fiora Pirri:
Max Pooling with Vision Transformers reconciles class and shape in weakly supervised semantic segmentation. CoRR abs/2210.17400 (2022) - 2020
- [j35]Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf:
On bibliometrics in academic promotions: a case study in computer science and engineering in Italy. Scientometrics 124(3): 2207-2228 (2020) - [j34]Camil Demetrescu, Andrea Ribichini, Marco Schaerf:
Are Italian research assessment exercises size-biased? Scientometrics 125(1): 533-549 (2020)
2010 – 2019
- 2019
- [j33]Angela Di Iorio, Marco Schaerf:
Expressing the Tacit Knowledge of a Digital Library System as Linked Data. Comput. 8(2): 49 (2019) - [j32]Camil Demetrescu, Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf:
On the Shapley value and its application to the Italian VQR research assessment exercise. J. Informetrics 13(1): 87-104 (2019) - 2018
- [j31]Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf:
Computing the Shapley value in allocation problems: approximations and bounds, with an application to the Italian VQR research assessment program. J. Exp. Theor. Artif. Intell. 30(4): 505-524 (2018) - [j30]Camil Demetrescu, Andrea Ribichini, Marco Schaerf:
Accuracy of author names in bibliographic data sources: an Italian case study. Scientometrics 117(3): 1777-1791 (2018) - [c44]Angela Di Iorio, Marco Schaerf:
Learning PREMIS Knowledge Base: a tool for humans and machines. iPRES 2018 - 2017
- [i6]Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf:
Computing the Shapley Value in Allocation Problems: Approximations and Bounds, with an Application to the Italian VQR Research Assessment Program. CoRR abs/1709.04176 (2017) - 2016
- [j29]Andrea Ferrara, Paolo Liberatore, Marco Schaerf:
The Size of BDDs and Other Data Structures in Temporal Logics Model Checking. IEEE Trans. Computers 65(10): 3148-3156 (2016) - [c43]Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf:
Computing the Shapley Value in Allocation Problems: Approximations and Bounds, with an Application to the Italian VQR Research Assessment Program. RCRA@AI*IA 2016: 27-43 - 2015
- [j28]Paolo Liberatore, Marco Schaerf:
On the complexity of second-best abductive explanations. Int. J. Approx. Reason. 63: 22-31 (2015) - [c42]Angela Di Iorio, Marco Schaerf:
A Semantic Model for Content Description in the Sapienza Digital Library. IRCDL 2015: 36-47 - [c41]Nadine Abu Rumman, Marco Schaerf, Dominique Bechmann:
Collision detection for articulated deformable characters. MIG 2015: 215-220 - 2014
- [c40]Angela Di Iorio, Marco Schaerf:
Identification Semantics for an Organization Establishing a Digital Library System. SDA@JCDL/TPDL 2014: 16-27 - [c39]Tiziana Catarci, Angela Di Iorio, Marco Schaerf:
The Sapienza Digital Library from the Holistic Vision to the Actual Implementation. IRCDL 2014: 4-11 - [c38]Angela Di Iorio, Marco Schaerf:
The Organization information integration in the management of a Digital Library System. JCDL 2014: 461-462 - [c37]Angela Di Iorio, Marco Schaerf:
Providing Proof of Trustworthiness Reconstructing Digital Objects' Custody Chain. OTM Workshops 2014: 43-51 - 2013
- [j27]Maurizio Lenzerini, Marco Schaerf:
The scientific legacy of Marco Cadoli in Artificial Intelligence. Intelligenza Artificiale 7(1): 1-5 (2013) - [j26]Paolo Liberatore, Marco Schaerf:
The compilability framework. Intelligenza Artificiale 7(1): 31-35 (2013) - [c36]Angela Di Iorio, Marco Schaerf:
Applicability of Digital Library Descriptive Metadata to the Contemporary Artworks - The Sapienza Digital Library Case Study. ECLAP 2013: 78-89 - [c35]Angela Di Iorio, Marco Schaerf, Maria Guercio, Silvia Ortolani, Matteo Bertazzo:
A Digital Infrastructure for Trustworthiness - The Sapienza Digital Library Experience. IRCDL 2013: 59-69 - 2012
- [c34]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 - [i5]Paolo Liberatore, Marco Schaerf:
On the Complexity of Finding Second-Best Abductive Explanations. CoRR abs/1204.5859 (2012) - 2011
- [c33]Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman:
Monte-Carlo Style UCT Search for Boolean Satisfiability. AI*IA 2011: 177-188 - [c32]Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman:
Applying UCT to Boolean Satisfiability. SAT 2011: 373-374 - [i4]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
Space Efficiency of Propositional Knowledge Representation Formalisms. CoRR abs/1106.0233 (2011) - 2010
- [i3]Paolo Liberatore, Marco Schaerf:
On the size of data structures used in symbolic model checking. CoRR abs/1012.3018 (2010)
2000 – 2009
- 2007
- [j25]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) - [j24]Marco Fratarcangeli, Marco Schaerf, Robert Forchheimer:
Facial motion cloning with radial basis functions in MPEG-4 FBA. Graph. Model. 69(2): 106-118 (2007) - [j23]Paolo Liberatore, Marco Schaerf:
Compilability of propositional abduction. ACM Trans. Comput. Log. 8(1): 2 (2007) - [c31]Andrea Ferrara, Paolo Liberatore, Marco Schaerf:
Model Checking and Preprocessing. AI*IA 2007: 48-59 - 2006
- [j22]Gwen Salaün, Lucas Bordeaux, Marco Schaerf:
Describing and reasoning on Web Services using Process Algebra. Int. J. Bus. Process. Integr. Manag. 1(2): 116-128 (2006) - [j21]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
k-Approximating Circuits. IEEE Trans. Computers 55(7): 913-917 (2006) - [c30]Marco Cadoli, Marco Schaerf:
Partial Solutions with Unique Completion. Reasoning, Action and Interaction in AI Theories and Systems 2006: 101-115 - [e1]Oliviero Stock, Marco Schaerf:
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 [contents] - 2005
- [j20]Paolo Liberatore, Marco Schaerf:
The complexity of model checking for propositional default logics. Data Knowl. Eng. 55(2): 189-202 (2005) - [c29]Andrea Ferrara, Paolo Liberatore, Marco Schaerf:
The Complexity of Action Redundancy. AI*IA 2005: 1-12 - [c28]Marco Fratarcangeli, Marco Schaerf:
Facial Motion Cloning Using Global Shape Deformation. Eurographics (Short Presentations) 2005: 89-92 - 2004
- [j19]Paolo Liberatore, Marco Schaerf:
The Compactness of Belief Revision and Update Operators. Fundam. Informaticae 62(3-4): 377-393 (2004) - [c27]Gwen Salaün, Lucas Bordeaux, Marco Schaerf:
Describing and Reasoning on Web Services using Process Algebra. ICWS 2004: 43- - 2002
- [j18]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
Preprocessing of Intractable Problems. Inf. Comput. 176(2): 89-120 (2002) - [j17]Marco Cadoli, Marco Schaerf, Andrea Giovanardi, Massimo Giovanardi:
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation. J. Autom. Reason. 28(2): 101-142 (2002) - [c26]Francesco M. Donini, Paolo Liberatore, Fabio Massacci, Marco Schaerf:
Solving QBF by SMV. KR 2002: 578-592 - [i2]Paolo Liberatore, Marco Schaerf:
Compilability of Abduction. CoRR cs.AI/0210007 (2002) - [i1]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
k-Approximating Circuits. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j16]Paolo Liberatore, Marco Schaerf:
Belief Revision and Update: Complexity of Model Checking. J. Comput. Syst. Sci. 62(1): 43-72 (2001) - 2000
- [j15]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
Space Efficiency of Propositional Knowledge Representation Formalisms. J. Artif. Intell. Res. 13: 1-31 (2000) - [c25]Paolo Liberatore, Marco Schaerf:
Compilability of Abduction. AAAI/IAAI 2000: 349-354 - [c24]Raffaella Colaci, Marco Schaerf:
ICARUS: Intelligent Content-Based Retrieval of 3D Scene. AAAI/IAAI 2000: 996-1001 - [c23]Paolo Liberatore, Marco Schaerf:
BReLS: A System for the Integration of Knowledge Bases. KR 2000: 145-152
1990 – 1999
- 1999
- [j14]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
The Size of a Revised Knowledge Base. Artif. Intell. 115(1): 25-64 (1999) - [c22]Emilio Domenicucci, Francesco M. Donini, Marco Schaerf:
ICARUS: Intelligent Classification And Retrieval of Unlabelled Scenes. Description Logics 1999 - [c21]Marco Schaerf, Alessandro Tessicini:
JubilEasy: Build a Personalized 3D Visit of Rome. VRML 1999: 105-112 - 1998
- [j13]Paolo Liberatore, Marco Schaerf:
Arbitration (or How to Merge Knowledge Bases). IEEE Trans. Knowl. Data Eng. 10(1): 76-90 (1998) - [c20]Marco Cadoli, Andrea Giovanardi, Marco Schaerf:
An Algorithm to Evaluate Quantified Boolean Formulae. AAAI/IAAI 1998: 262-267 - [c19]Paolo Liberatore, Marco Schaerf:
The Complexity of Model Checking for Propositional Default Logics. ECAI 1998: 18-22 - 1997
- [j12]Paolo Liberatore, Marco Schaerf:
Reducing Belief Revision to Circumscription (and Vice Versa). Artif. Intell. 93: 261-296 (1997) - [j11]Marco Cadoli, Francesco M. Donini, Marco Schaerf, Riccardo Silvestri:
On Compact Representations of Propositional Circumscription. Theor. Comput. Sci. 182(1-2): 183-202 (1997) - [c18]Marco Cadoli, Andrea Giovanardi, Marco Schaerf:
Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae. AI*IA 1997: 207-218 - 1996
- [j10]Marco Cadoli, Francesco M. Donini, Marco Schaerf:
Is Intractability of Nonmonotonic Reasoning a Real Drawback? Artif. Intell. 88(1-2): 215-251 (1996) - [j9]Marco Cadoli, Marco Schaerf:
On the complexity of Entailment in Propositional Multivalued Logics. Ann. Math. Artif. Intell. 18(1): 29-50 (1996) - [c17]Paolo Liberatore, Marco Schaerf:
The Complexity of Model Checking for Belief Revision and Update. AAAI/IAAI, Vol. 1 1996: 556-561 - [c16]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
Feasibility and Unfeasibility of Off-Line Processing. ISTCS 1996: 100-109 - [c15]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
Comparing Space Efficiency of Propositional Knowledge Representation Formalisms. KR 1996: 364-373 - 1995
- [j8]Marco Schaerf, Marco Cadoli:
Tractable Reasoning via Approximation. Artif. Intell. 74(2): 249-310 (1995) - [j7]Marco Cadoli, Marco Schaerf:
Approximate Inference in Default Logic and Circumscription. Fundam. Informaticae 23(1): 123-143 (1995) - [j6]Marco Schaerf:
Negation and Minimality in Disjunctive Databases. J. Log. Program. 23(1): 63-86 (1995) - [c14]Paolo Liberatore, Marco Schaerf:
Relating Belief Revision and Circumscription. IJCAI 1995: 1557-1566 - [c13]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
The Size of a Revised Knowledge Base. PODS 1995: 151-162 - [c12]Marco Cadoli, Francesco M. Donini, Marco Schaerf:
On Compact Representations of Propositional Circumscription. STACS 1995: 205-216 - [c11]Paolo Liberatore, Marco Schaerf:
Arbitration: A Commutative Operator for Belief Revision. WOCFAI 1995: 217-228 - 1994
- [j5]Marco Cadoli, Marco Schaerf:
Approximate Inference in Default Logic and Circumscription. Fundam. Informaticae 21(1/2): 103-112 (1994) - [c10]Marco Cadoli, Francesco M. Donini, Marco Schaerf:
Is Intractability of Non-Monotonic Reasoning a Real Drawback? AAAI 1994: 946-951 - 1993
- [j4]Marco Cadoli, Marco Schaerf:
A Survey of Complexity Results for Nonmonotonic Logics. J. Log. Program. 17(2/3&4): 127-160 (1993) - [c9]Marco Schaerf:
Logic Programming and Autoepistemic Logics: New Relations and Complexity Results. AI*IA 1993: 132-141 - [c8]Marco Schaerf:
Negation and Minimality in Non-Horn Databases. PODS 1993: 147-157 - 1992
- [c7]Marco Cadoli, Marco Schaerf:
Approximate Inference in Default Logic and Circumscription. ECAI 1992: 319-323 - [c6]Marco Cadoli, Marco Schaerf:
Approximation in Concept Description Languages. KR 1992: 330-341 - [c5]Marco Cadoli, Marco Schaerf:
Approximate Reasoning and Non-Omniscient Agents. TARK 1992: 169-183 - 1991
- [j3]Luigia Carlucci Aiello, Daniele Nardi, Marco Schaerf:
Reasoning about reasoning in a meta-level architecture. Appl. Intell. 1(1): 55-67 (1991) - [j2]Marco Schaerf:
Notes on Ginsberg's multivalued logics. Comput. Intell. 7: 154-159 (1991) - [c4]Marco Cadoli, Marco Schaerf:
Approximate Entailment. AI*IA 1991: 68-77 - [c3]Luigia Carlucci Aiello, Daniele Nardi, Marco Schaerf:
Reasoning about Knowledge: The Meta-Level Approach. SCAI 1991: 4-18 - 1990
- [j1]Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Fiora Pirri, Marco Schaerf:
Nonmonotonic reasoning. Artif. Intell. Rev. 4(3): 163-210 (1990)
1980 – 1989
- 1988
- [c2]Luigia Carlucci Aiello, Daniele Nardi, Marco Schaerf:
Reasoning About Knowledge and Ignorance. FGCS 1988: 618-627 - [c1]Luigia Carlucci Aiello, Daniele Nardi, Marco Schaerf:
Yet Another Solution to the Three Wisemen Puzzle. ISMIS 1988: 398-407
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
