| Nusmv 2: An opensource tool for symbolic model checking A Cimatti, E Clarke, E Giunchiglia, F Giunchiglia, M Pistore, M Roveri, ... Computer Aided Verification: 14th International Conference, CAV 2002 …, 2002 | 2628 | 2002 |
| Nonmonotonic causal theories E Giunchiglia, J Lee, V Lifschitz, N McCain, H Turner Artificial Intelligence 153 (1-2), 49-104, 2004 | 581 | 2004 |
| An action language based on causal explanation: Preliminary report E Giunchiglia, V Lifschitz AAAI/IAAI, 623-630, 1998 | 290 | 1998 |
| Benefits of bounded model checking at an industrial setting F Copty, L Fix, R Fraer, E Giunchiglia, G Kamhi, A Tacchella, MY Vardi International Conference on Computer Aided Verification, 436-453, 2001 | 282 | 2001 |
| Answer set programming based on propositional satisfiability E Giunchiglia, Y Lierler, M Maratea Journal of Automated reasoning 36, 345-377, 2006 | 214 | 2006 |
| Planning via model checking: A decision procedure for AR A Cimatti, E Giunchiglia, F Giunchiglia, P Traverso Proceedings of the 4th European Conference on Planning (ECP’97), 130-142, 0 | 213* | |
| QUBE: A system for deciding quantified boolean formulas satisfiability E Giunchiglia, M Narizzano, A Tacchella Automated Reasoning: First International Joint Conference, IJCAR 2001 Siena …, 2001 | 177 | 2001 |
| SAT-based procedures for temporal reasoning A Armando, C Castellini, E Giunchiglia European Conference on Planning, 97-108, 1999 | 175 | 1999 |
| Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas E Giunchiglia, M Narizzano, A Tacchella arXiv e-prints, arXiv: 1111.0860, 2011 | 144* | 2011 |
| Backjumping for quantified Boolean logic satisfiability E Giunchiglia, M Narizzano, A Tacchella Artificial Intelligence 145 (1-2), 99-120, 2003 | 141 | 2003 |
| Representing action: Indeterminacy and ramifications E Giunchiglia, GN Kartha, V Lifschitz Artificial Intelligence 95 (2), 409-438, 1997 | 139 | 1997 |
| Learning for quantified Boolean logic satisfiability E Giunchiglia, M Narizzano, A Tacchella AAAI/IAAI, 649-654, 2002 | 127 | 2002 |
| SAT-based planning in complex domains: Concurrency, constraints and nondeterminism C Castellini, E Giunchiglia, A Tacchella Artificial Intelligence 147 (1-2), 85-117, 2003 | 117 | 2003 |
| SAT-based decision procedures for classical modal logics E Giunchiglia, A Tacchella, F Giunchiglia Journal of automated reasoning 28, 143-171, 2002 | 112 | 2002 |
| Non-omniscient belief as context-based reasoning F Giunchiglia, L Serafini, E Giunchiglia, M Frixione IJCAI 93, 548-554, 1993 | 101 | 1993 |
| SAT-based answer set programming E Giunchiglia, Y Lierler, M Maratea AAAI 4, 61-66, 2004 | 94 | 2004 |
| Efficient semantic matching F Giunchiglia, M Yatskevich, E Giunchiglia European Semantic Web Conference, 272-289, 2005 | 93 | 2005 |
| Constraints and AI planning A Nareyek, EC Freuder, R Fourer, E Giunchiglia, RP Goldman, H Kautz, ... IEEE Intelligent Systems 20 (2), 62-72, 2005 | 93 | 2005 |
| Act, and the rest will follow: Exploiting determinism in planning as satisfiability E Giunchiglia, A Massarotto, R Sebastiani AAAI/IAAI, 948-953, 1998 | 87 | 1998 |
| Solving satisfiability problems with preferences E Di Rosa, E Giunchiglia, M Maratea Constraints 15, 485-515, 2010 | 86 | 2010 |
Armando TacchellaProfessor, Information Processing Systems, University of GenoaEmail được xác minh tại unige.it
