Describing and reasoning on web services using process algebra G Salaun, L Bordeaux, M Schaerf International Journal of Business Process Integration and Management 1 (2 …, 2006 | 464 | 2006 |
An algorithm to evaluate quantified Boolean formulae M Cadoli, A Giovanardi, M Schaerf AAAI/IAAI 98, 262-267, 1998 | 304* | 1998 |
Tractable reasoning via approximation M Schaerf, M Cadoli Artificial Intelligence 74 (2), 249-310, 1995 | 258 | 1995 |
Arbitration (or how to merge knowledge bases) P Liberatore, M Schaerf IEEE Transactions on Knowledge and Data Engineering 10 (1), 76-90, 1998 | 236 | 1998 |
A survey of complexity results for non-monotonic logics M Cadoli, M Schaerf The Journal of Logic Programming 17 (2-4), 127-160, 1993 | 202 | 1993 |
An algorithm to evaluate quantified boolean formulae and its experimental evaluation M Cadoli, M Schaerf, A Giovanardi, M Giovanardi Journal of Automated Reasoning 28, 101-142, 2002 | 186 | 2002 |
Is intractability of nonmonotonic reasoning a real drawback? M Cadoli, FM Donini, M Schaerf Artificial intelligence 88 (1-2), 215-251, 1996 | 98 | 1996 |
Preprocessing of intractable problems M Cadoli, FM Donini, P Liberatore, M Schaerf Information and Computation 176 (2), 89-120, 2002 | 86 | 2002 |
Towards intelligent decision support systems for emergency managers: the IDA approach AM Gadomski, S Bologna, GD Costanzo, A Perini, M Schaerf International Journal of Risk Assessment and Management 2 (3-4), 224-242, 2001 | 72 | 2001 |
On the complexity of entailment in propositional multivalued logics M Cadoli, M Schaerf Annals of Mathematics and Artificial Intelligence 18, 29-50, 1996 | 67 | 1996 |
Arbitration: A Commutative Operator for Belief Revision. P Liberatore, M Schaerf WOCFAI, 217-228, 1995 | 65 | 1995 |
BReLS: A system for the integration of knowledge bases P Liberatore, M Schaerf KR, 145-152, 2000 | 60 | 2000 |
Space efficiency of propositional knowledge representation formalisms M Cadoli, FM Donini, P Liberatore, M Schaerf Journal of Artificial Intelligence Research 13, 1-31, 2000 | 59 | 2000 |
Experimental analysis of the computational cost of evaluating quantified boolean formulae M Cadoli, A Giovanardi, M Schaerf AI* IA 97: Advances in Artificial Intelligence: 5th Congress of the Italian …, 1997 | 52 | 1997 |
The complexity of model checking for belief revision and update P Liberatore, M Schaerf AAAI/IAAI, Vol. 1, 556-561, 1996 | 50 | 1996 |
Approximate inference in default logic and circumscription M Cadoli, M Schaerf Fundamenta Informaticae 23 (1), 123-143, 1995 | 45 | 1995 |
On compact representations of propositional circumscription M Cadoli, FM Donini, M Schaerf, R Silvestri Theoretical Computer Science 182 (1-2), 183-202, 1997 | 43 | 1997 |
Belief revision and update: Complexity of model checking P Liberatore, M Schaerf Journal of Computer and System Sciences 62 (1), 43-72, 2001 | 42 | 2001 |
The size of a revised knowledge base M Cadoli, FM Donini, P Liberatore, M Schaerf Artificial Intelligence 115 (1), 25-64, 1999 | 42 | 1999 |
Max pooling with vision transformers reconciles class and shape in weakly supervised semantic segmentation S Rossetti, D Zappia, M Sanzari, M Schaerf, F Pirri European conference on computer vision, 446-463, 2022 | 39 | 2022 |