Marco Schaerf

According to our database1, Marco Schaerf authored at least 70 papers between 1988 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
On the Shapley value and its application to the Italian VQR research assessment exercise.
J. Informetrics, 2019

2018
Accuracy of author names in bibliographic data sources: an Italian case study.
Scientometrics, 2018

2016
The Size of BDDs and Other Data Structures in Temporal Logics Model Checking.
IEEE Trans. Computers, 2016

Computing the Shapley Value in Allocation Problems: Approximations and Bounds, with an Application to the Italian VQR Research Assessment Program.
Proceedings of the 23rd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion 2016 (RCRA 2016) A workshop of the XV International Conference of the Italian Association for Artificial Intelligence (AI*IA 2016), 2016

2015
On the complexity of second-best abductive explanations.
Int. J. Approx. Reasoning, 2015

Collision detection for articulated deformable characters.
Proceedings of the 8th ACM SIGGRAPH Conference on Motion in Games, 2015

A Semantic Model for Content Description in the Sapienza Digital Library.
Proceedings of the Digital Libraries on the Move, 2015

2014
Providing Proof of Trustworthiness Reconstructing Digital Objects' Custody Chain.
Proceedings of the On the Move to Meaningful Internet Systems: OTM 2014 Workshops, 2014

The Organization information integration in the management of a Digital Library System.
Proceedings of the IEEE/ACM Joint Conference on Digital Libraries, 2014

The Sapienza Digital Library from the Holistic Vision to the Actual Implementation.
Proceedings of the Pushing the Boundaries of the Digital Libraries Field, 2014

Identification Semantics for an Organization Establishing a Digital Library System.
Proceedings of the 4th International Workshop on Semantic Digital Archives (SDA 2014) co-located with the International Digital Libraries Conference (DL 2014), 2014

2013
The compilability framework.
Intelligenza Artificiale, 2013

The scientific legacy of Marco Cadoli in Artificial Intelligence.
Intelligenza Artificiale, 2013

A Digital Infrastructure for Trustworthiness - The Sapienza Digital Library Experience.
Proceedings of the Bridging Between Cultural Heritage Institutions, 2013

Applicability of Digital Library Descriptive Metadata to the Contemporary Artworks - The Sapienza Digital Library Case Study.
Proceedings of the Information Technologies for Performing Arts, Media Access, and Entertainment, 2013

2012
Establishing a Digital Library in Wide-Ranging University's Context - The Sapienza Digital Library Experience.
Proceedings of the Digital Libraries and Archives - 8th Italian Research Conference, 2012

2011
Applying UCT to Boolean Satisfiability.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Monte-Carlo Style UCT Search for Boolean Satisfiability.
Proceedings of the AI*IA 2011: Artificial Intelligence Around Man and Beyond, 2011

2007
Compilability of propositional abduction.
ACM Trans. Comput. Log., 2007

Facial motion cloning with radial basis functions in MPEG-4 FBA.
Graphical Models, 2007

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

Model Checking and Preprocessing.
Proceedings of the AI*IA 2007: Artificial Intelligence and Human-Oriented Computing, 2007

2006
k-Approximating Circuits.
IEEE Trans. Computers, 2006

Partial Solutions with Unique Completion.
Proceedings of the Reasoning, 2006

2005
Facial Motion Cloning Using Global Shape Deformation.
Proceedings of the Eurographics 2005 - Short Presentations, Dublin, Ireland, August 29, 2005

The Complexity of Action Redundancy.
Proceedings of the AI*IA 2005: Advances in Artificial Intelligence, 2005

2004
The Compactness of Belief Revision and Update Operators.
Fundam. Inform., 2004

Describing and Reasoning on Web Services using Process Algebra.
Proceedings of the IEEE International Conference on Web Services (ICWS'04), 2004

2002
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation.
J. Autom. Reasoning, 2002

Preprocessing of Intractable Problems.
Inf. Comput., 2002

k-Approximating Circuits
Electronic Colloquium on Computational Complexity (ECCC), 2002

Solving QBF by SMV.
Proceedings of the Eights International Conference on Principles and Knowledge Representation and Reasoning (KR-02), 2002

2001
Belief Revision and Update: Complexity of Model Checking.
J. Comput. Syst. Sci., 2001

2000
Space Efficiency of Propositional Knowledge Representation Formalisms.
J. Artif. Intell. Res., 2000

BReLS: A System for the Integration of Knowledge Bases.
Proceedings of the KR 2000, 2000

Compilability of Abduction.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

ICARUS: Intelligent Content-Based Retrieval of 3D Scene.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
JubilEasy: Build a Personalized 3D Visit of Rome.
Proceedings of the Fourth Symposium on The Virtual Reality Modeling Language, 1999

ICARUS: Intelligent Classification And Retrieval of Unlabelled Scenes.
Proceedings of the 1999 International Workshop on Description Logics (DL'99), Linköping, Sweden, July 30, 1999

1998
Arbitration (or How to Merge Knowledge Bases).
IEEE Trans. Knowl. Data Eng., 1998

The Complexity of Model Checking for Propositional Default Logics.
ECAI, 1998

An Algorithm to Evaluate Quantified Boolean Formulae.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997
On Compact Representations of Propositional Circumscription.
Theor. Comput. Sci., 1997

Reducing Belief Revision to Circumscription (and Vice Versa).
Artif. Intell., 1997

Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae.
Proceedings of the AI*IA 97: Advances in Artificial Intelligence, 1997

1996
On the complexity of Entailment in Propositional Multivalued Logics.
Ann. Math. Artif. Intell., 1996

Is Intractability of Nonmonotonic Reasoning a Real Drawback?
Artif. Intell., 1996

Comparing Space Efficiency of Propositional Knowledge Representation Formalisms.
Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

Feasibility and Unfeasibility of Off-Line Processing.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

The Complexity of Model Checking for Belief Revision and Update.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995
Negation and Minimality in Disjunctive Databases.
J. Log. Program., 1995

Tractable Reasoning via Approximation.
Artif. Intell., 1995

Arbitration: A Commutative Operator for Belief Revision.
WOCFAI, 1995

On Compact Representations of Propositional Circumscription.
STACS, 1995

The Size of a Revised Knowledge Base.
Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1995

Relating Belief Revision and Circumscription.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994
Is Intractability of Non-Monotonic Reasoning a Real Drawback?
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1993
A Survey of Complexity Results for Nonmonotonic Logics.
J. Log. Program., 1993

Negation and Minimality in Non-Horn Databases.
Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993

Logic Programming and Autoepistemic Logics: New Relations and Complexity Results.
Proceedings of the Advances in Artificial Intelligence, 1993

1992
Approximate Reasoning and Non-Omniscient Agents.
Proceedings of the 4th Conference on Theoretical Aspects of Reasoning about Knowledge, 1992

Approximation in Concept Description Languages.
Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR'92). Cambridge, 1992

Approximate Inference in Default Logic and Circumscription.
ECAI, 1992

1991
Notes on Ginsberg's multivalued logics.
Computational Intelligence, 1991

Reasoning about reasoning in a meta-level architecture.
Appl. Intell., 1991

Reasoning about Knowledge: The Meta-Level Approach.
SCAI, 1991

Approximate Entailment.
Proceedings of the Trends in Artificial Intelligence, 1991

1990
Nonmonotonic reasoning.
Artif. Intell. Rev., 1990

1988
Yet Another Solution to the Three Wisemen Puzzle.
Proceedings of the Methodologies for Intelligent Systems, 1988

Reasoning About Knowledge and Ignorance.
FGCS, 1988


  Loading...