SIMO

Publications

[GLM06] E. Giunchiglia, Yu. Lierler, M. Maratea - Answer Set Programming based on Propositional Satisfiability.
Accepted for publication to the Journal of Automated Reasoning (JAR).
[M05] M. Maratea - Efficient Decision Procedures for the Integration of Planning and Formal Verification in Advanced Systems.
AI Communications Journal. (PhD summary). Vol. 19(1), pgg. 87-89. 2006.
[GM05d] E. Giunchiglia, M. Maratea On the relation between Answer Set and SAT procedures (or, between smodels and cmodels).
In Proc. ICLP 2005 21th International Conference on Logic Programming. October 2 - 5, 2005, Sitges (Barcelona) Spain. LNCS 3668. pgg. 37-51.
[GM05c] E. Giunchiglia, M. Maratea Evaluating Search Strategies and Heuristics for Efficient Answer Set Programming.
In Proc. AI*IA 2005 9th Congress of the Italian Association for Artificial Intelligence. September 21-23, 2005, Milan, Italy, EU. LNCS/LNAI 3673. pgg 122-134.
[GM05b] E. Giunchiglia, M. Maratea An Experimental Study of Search Strategies and Heuristics in Answer Set Programming.
Accepted to ASP05 Answer Set Programming: Advances in Theory and Implementation. July 27-29, 2005 Bath, UK.
[ACGM05] A. Armando, C. Castellini, E. Giunchiglia, M. Maratea - The SAT-based Approach to Separation Logic.
Accepted for publication to the Journal of Automated Reasoning (JAR).
[GM05a] E. Giunchiglia, M. Maratea An Analysis of Search Strategies and Heuristics in Answer Set Programming.
Accepted to AI*IA Workshop on "Experimental analysis and benchmarks for Artificial Intelligence algorithms". 10 June 2005. Ferrara, Italy, EU.
[ACGI+04] A. Armando, C. Castellini, E. Giunchiglia, M. Idini, M. Maratea TSAT++: An Open Reasoning Platform for Satisfiability Modulo Theory.
Accepted to PDPAR 2004. 2nd Workshop on Pragmatics of Decision Procedures in Automated Reasoning. 5 July 2004, Cork, Ireland. ENTCS Volume 125(3), pgg. 25-36.
[GLM04b] E. Giunchiglia, Yu. Lierler, M. Maratea A SAT-Based Polinomial Space Algorithm for Answer Set Programming. Accepted to NMR 2004 10th International Workshop on Non-Monotonic Reasoning. 6-8 June, Whister BC, Canada.
[ACG+04] A. Armando, C. Castellini, E. Giunchiglia, M. Maratea A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints.
Accepted to SAT 2004. 10-13 May, Vancouver, Canada.
[GLM04a] E. Giunchiglia, Yu. Lierler, M. Maratea SAT-Based Answer Set Programming.
Accepted to AAAI 2004 Nineteenth National Conference on Artificial Intelligence. 25-29 July, S. Jose, CA.
[ACG+03] A. Armando, C. Castellini, E. Giunchiglia, M. Maratea Effective reasoning techniques for temporal reasoning. First Robocare Workshop. 30 October, Rome, Italy (EU).
[LM03b] Yu. Lierler, M. Maratea Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs. Accepted to LPNMR-7 7th International Conference on Logic Programming and Nonmonotonic Reasoning.System description. January 6-8, 2004 Miami, Florida. System description.
[LM03a] Yu. Lierler, M. Maratea Computing Answer Sets of a Logic Program via enumeration of SAT certificates. Accepted to ASP03 Answer Set Programming: Advances in Theory and Implementation. September 26-29, 2003 Messina, Sicily, Italy (EU).
[GMT03b] E. Giunchiglia, M. Maratea, A. Tacchella (In)Effectiveness of Look-ahead Techniques in a Modern SAT Solver. Accepted to CP 2003 Ninth International Conference on Principles and Practice of Constraint Programming . Poster paper.

[GMT03a] E. Giunchiglia, M. Maratea and A. Tacchella Look-Ahead vs. Look-Back techniques in a modern SAT solver. Accepted to SAT2003 Sixth International Conference on Theory and Applications of Satisfiability Testing. May 5-8 2003. Portofino, Italy (EU).

[CFG+01] F. Copty, L. Fix, E. Giunchiglia, G. Kamhi, A. Tacchella and M. Vardi. Benefits of Bounded Model Checking at an Industrial Setting. in Proc. of CAV, LNCS. Springer Verlag, (2001).

[GLM06]	E. Giunchiglia, Yu. Lierler, M. Maratea - Answer Set Programming based on Propositional Satisfiability. Accepted for publication to the Journal of Automated Reasoning (JAR).
[M05]	M. Maratea - Efficient Decision Procedures for the Integration of Planning and Formal Verification in Advanced Systems. AI Communications Journal. (PhD summary). Vol. 19(1), pgg. 87-89. 2006.
[GM05d]	E. Giunchiglia, M. Maratea On the relation between Answer Set and SAT procedures (or, between smodels and cmodels). In Proc. ICLP 2005 21th International Conference on Logic Programming. October 2 - 5, 2005, Sitges (Barcelona) Spain. LNCS 3668. pgg. 37-51.
[GM05c]	E. Giunchiglia, M. Maratea Evaluating Search Strategies and Heuristics for Efficient Answer Set Programming. In Proc. AI*IA 2005 9th Congress of the Italian Association for Artificial Intelligence. September 21-23, 2005, Milan, Italy, EU. LNCS/LNAI 3673. pgg 122-134.
[GM05b]	E. Giunchiglia, M. Maratea An Experimental Study of Search Strategies and Heuristics in Answer Set Programming. Accepted to ASP05 Answer Set Programming: Advances in Theory and Implementation. July 27-29, 2005 Bath, UK.
[ACGM05]	A. Armando, C. Castellini, E. Giunchiglia, M. Maratea - The SAT-based Approach to Separation Logic. Accepted for publication to the Journal of Automated Reasoning (JAR).
[GM05a]	E. Giunchiglia, M. Maratea An Analysis of Search Strategies and Heuristics in Answer Set Programming. Accepted to AI*IA Workshop on "Experimental analysis and benchmarks for Artificial Intelligence algorithms". 10 June 2005. Ferrara, Italy, EU.
[ACGI+04]	A. Armando, C. Castellini, E. Giunchiglia, M. Idini, M. Maratea TSAT++: An Open Reasoning Platform for Satisfiability Modulo Theory. Accepted to PDPAR 2004. 2nd Workshop on Pragmatics of Decision Procedures in Automated Reasoning. 5 July 2004, Cork, Ireland. ENTCS Volume 125(3), pgg. 25-36.
[GLM04b]	E. Giunchiglia, Yu. Lierler, M. Maratea *A SAT-Based Polinomial Space Algorithm for Answer Set Programming.* Accepted to NMR 2004 10th International Workshop on Non-Monotonic Reasoning. 6-8 June, Whister BC, Canada.
[ACG+04]	A. Armando, C. Castellini, E. Giunchiglia, M. Maratea A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints. Accepted to SAT 2004. 10-13 May, Vancouver, Canada.
[GLM04a]	E. Giunchiglia, Yu. Lierler, M. Maratea SAT-Based Answer Set Programming. Accepted to AAAI 2004 Nineteenth National Conference on Artificial Intelligence. 25-29 July, S. Jose, CA.
[ACG+03]	A. Armando, C. Castellini, E. Giunchiglia, M. Maratea *Effective reasoning techniques for temporal reasoning.* First Robocare Workshop. 30 October, Rome, Italy (EU).
[LM03b]	Yu. Lierler, M. Maratea *Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs.* Accepted to LPNMR-7 7th International Conference on Logic Programming and Nonmonotonic Reasoning.System description. January 6-8, 2004 Miami, Florida. System description.
[LM03a]	Yu. Lierler, M. Maratea *Computing Answer Sets of a Logic Program via enumeration of SAT certificates.* Accepted to ASP03 Answer Set Programming: Advances in Theory and Implementation. September 26-29, 2003 Messina, Sicily, Italy (EU).
[GMT03b]	E. Giunchiglia, M. Maratea, A. Tacchella *(In)Effectiveness of Look-ahead Techniques in a Modern SAT Solver.* Accepted to CP 2003 Ninth International Conference on Principles and Practice of Constraint Programming . Poster paper.
[GMT03a]	E. Giunchiglia, M. Maratea and A. Tacchella *Look-Ahead vs. Look-Back techniques in a modern SAT solver.* Accepted to SAT2003 Sixth International Conference on Theory and Applications of Satisfiability Testing. May 5-8 2003. Portofino, Italy (EU).
[CFG+01]	F. Copty, L. Fix, E. Giunchiglia, G. Kamhi, A. Tacchella and M. Vardi. *Benefits of Bounded Model Checking at an Industrial Setting.* in Proc. of CAV, LNCS. Springer Verlag, (2001).