[38] | On timeline-based games and their complexity (Nicola Gigante, Angelo Montanari, Orlandini, Andrea, Cialdea Mayer, Marta and Mark Reynolds), In Theor. Comput. Sci., volume 815, 2020. |
[37] | A Prover Dealing with Nominals, Binders, Transitivity and Relation Hierarchies (Cialdea Mayer, Marta), In J. Autom. Reason., volume 64, 2020. |
[36] | A framework for modelling Molecular Interaction Maps (Jean-Marc Alliot, Cialdea Mayer, Marta, Robert Demolombe and Martín Diéguez), In CoRR, volume abs/2008.09546, 2020. |
[35] | A Language for Timeline-based Planning (Giulio Bernardi, Amedeo Cesta, Orlandini, Andrea, Umbrico, Alessandro and Cialdea Mayer, Marta), In Proceedings of the 2nd Workshop on Artificial Intelligence and Formal Verification, Logic, Automata, and Synthesis hosted by the Bolzano Summer of Knowledge 2020 (BOSK 2020), September 25, 2020 (Riccardo De Benedictis, Luca Geretti, Andrea Micheli, eds.), CEUR-WS.org, volume 2785, 2020. |
[34] | Design of Timeline-Based Planning Systems for Safe Human-Robot Collaboration (Orlandini, Andrea, Cialdea Mayer, Marta, Umbrico, Alessandro and Amedeo Cesta), Chapter in Knowledge Engineering Tools and Techniques for AI Planning (Mauro Vallati, Diane E. Kitchin, eds.), Springer, 2020. |
[33] | An AI-Based Approach to Automatic Waste Sorting (Strollo, Elio, Sansonetti, Giuseppe, Cialdea Mayer, Marta, Limongelli, Carla and Micarelli, Alessandro), In HCI International 2020 - Posters (Stephanidis, Constantine, Antona, Margherita, eds.), Springer International Publishing, 2020. |
[32] | Evaluating Robustness of an Acting Framework over Temporally Uncertain Domains (Umbrico, Alessandro, Amedeo Cesta, Cialdea Mayer, Marta and Orlandini, Andrea), In AI*IA 2019 - Advances in Artificial Intelligence - XVIIIth International Conference of the Italian Association for Artificial Intelligence, Rende, Italy, November 19-22, 2019, Proceedings (Mario Alviano, Gianluigi Greco, Francesco Scarcello, eds.), Springer, volume 11946, 2019. |
[31] | A Prototype for the Robust Execution of Flexible Plans (Annarita Lanzilli, Cialdea Mayer, Marta, Amedeo Cesta, Orlandini, Andrea and Umbrico, Alessandro), In Proceedings of the 1st Workshop on Artificial Intelligence and Formal Verification, Logic, Automata, and Synthesis, co-located with the 18th International Conference of the Italian Association for Artificial Intelligence, OVERLAY@AI*IA 2019, Rende, Italy, November 19-20, 2019 (Nicola Gigante, Federico Mari, Orlandini, Andrea, eds.), CEUR-WS.org, volume 2509, 2019. |
[30] | Integrating resource management and timeline-based planning (Umbrico, Alessandro, Cesta, Amedeo, Cialdea Mayer, Marta and Orlandini, Andrea), In Proceedings International Conference on Automated Planning and Scheduling, ICAPS, volume 2018-June, 2018. |
[29] | A game-theoretic approach to timeline-based planning with uncertainty (Gigante, N., Montanari, A., Cialdea Mayer, Marta, Orlandini, Andrea and Reynolds, M.), In 25th International Symposium on Temporal Representation and Reasoning, TIME 2018, Warsaw, Poland, October 15-17, 2018, volume 120, 2018. |
[28] | Complexity of timeline-based planning (Gigante, N., Montanari, A., Cialdea Mayer, Marta and Orlandini, Andrea), In Proceedings International Conference on Automated Planning and Scheduling, ICAPS, 2017. |
[27] | Steps in assessing a timeline-based planner (Umbrico, Alessandro, Cesta, Amedeo, Cialdea Mayer, Marta and Orlandini, Andrea), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 10037 LNAI, 2016. |
[26] | An executable semantics of flexible plans in terms of timed game automata (Cialdea Mayer, Marta and Orlandini, Andrea), In Proceedings of the International Workshop on Temporal Representation and Reasoning, volume 2016-January, 2016. |
[25] | Timelines Are Expressive Enough to Capture Action-Based Temporal Planning (Gigante, N., Montanari, A., Cialdea Mayer, Marta and Orlandini, Andrea), In Proceedings of the International Workshop on Temporal Representation and Reasoning, volume 2016-December, 2016. |
[24] | Planning and execution with flexible timelines: a formal account (Cialdea Mayer, Marta, Orlandini, Andrea and Umbrico, Alessandro), In Acta Informatica, volume 53, 2016. |
[23] | Enriching a temporal planner with resources and a Hierarchy-based Heuristic (Umbrico, Alessandro, Orlandini, Andrea and Cialdea Mayer, Marta), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 9336 LNCS, 2015. |
[22] | Quality metrics to evaluate flexible timeline-based plans (Umbrico, Alessandro, Orlandini, Andrea and Cialdea Mayer, Marta), In Proceedings of the 6th Italian Workshop on Planning and Scheduling, volume 1493, 2015. |
[21] | Erratum to: Extension of a Decision Procedure for a Fragment of Hybrid Logic with Binders [Journal of Automated Reasoning, DOI 10.1007/s10817-014-9307-z] (Cialdea Mayer, Marta), In Journal of Automated Reasoning, volume 55, 2015. |
[20] | A formal account of planning with flexible timelines (Cialdea Mayer, Marta, Orlandini, Andrea and Umbrico, Alessandro), In Proceedings of the International Workshop on Temporal Representation and Reasoning, 2014. |
[19] | Extended Decision Procedure for a Fragment of HL with Binders (Cialdea Mayer, Marta), In Journal of Automated Reasoning, volume 53, 2014. |
[18] | A proof procedure for hybrid logic with binders, transitivity and relation hierarchies (Cialdea Mayer, Marta), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 7898 LNAI, 2013. |
[17] | A tableau based decision procedure for an expressive fragment of hybrid logic with binders, converse and global modalities (S. Cerrito and Cialdea Mayer, Marta), In Journal of Automated Reasoning, volume 51, 2013. |
[16] | A tableaux based decision procedure for a broad class of hybrid formulae with binders (S. Cerrito and Cialdea Mayer, Marta), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 6793 LNAI, 2011. |
[15] | Herod and pilate: Two tableau provers for basic hybrid logic (Cialdea Mayer, Marta and Cerrito, Serenella), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 6173 LNAI, 2010. |
[14] | Nominal substitution at work with the global and converse modalities (Cerrito, Serenella and Cialdea Mayer, Marta), In Advances in Modal Logic 2006, volume 8, 2010. |
[13] | An efficient approach to nominal equalities in hybrid logic tableaux (Cerrito, Serenella and Cialdea Mayer, Marta), In Journal of Applied Non-Classical Logics, volume 20, 2010. |
[12] | Abduction and consequence generation in a support system for the design of logical multiple-choice questions (Cialdea Mayer, Marta), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 5607 LNAI, 2009. |
[11] | Linear temporal logic as an executable semantics for planning languages (Cialdea Mayer, Marta, Limongelli, Carla, Orlandini, Andrea and Poggioni, Valentina), In Journal of Logic, Language and Information, volume 16, 2007. |
[10] | Pdk: The system and its language (Cialdea Mayer, Marta, Limongelli, Carla, Orlandini, Andrea and Poggioni, Valentina), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 3702 LNAI, 2005. |
[9] | Planning under uncertainty in linear time logic (Cialdea Mayer, Marta, Limongelli, Carla, Orlandini, Andrea and Poggioni, Valentina), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 2829, 2003. |
[8] | A general theorem prover for quantified modal logics (Thion, V., Cerrito, Serenella and Cialdea Mayer, Marta), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 2381 LNAI, 2002. |
[7] | Ground and free-variable tableaux for variants of quantified modal logics (Cialdea Mayer, Marta and Cerrito, Serenella), In Studia Logica, volume 69, 2001. |
[6] | Free-variable tableaux for constant-domain quantified modal logics with rigid and non-rigid designation (Cerrito, Serenella and Cialdea Mayer, Marta), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 2083 LNAI, 2001. |
[5] | Variants of first-order modal logics (Cialdea Mayer, Marta and Cerrito, Serenella), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 1847 LNAI, 2000. |
[4] | First order linear temporal logic over finite time structures (Cerrito, Serenella, Cialdea Mayer, Marta and Praud, S.), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 1705 LNAI, 1999. |
[3] | Using linear temporal logic to model and solve planning problems (Cerrito, Serenella and Cialdea Mayer, Marta), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 1480 LNAI, 1998. |
[2] | Bounded model search in linear temporal logic and its application to planning (Cerrito, Serenella and Cialdea Mayer, Marta), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 1397 LNAI, 1998. |
[1] | Hintikka multiplicities in matrix decision methods for some propositional modal logics (Cerrito, Serenella and Cialdea Mayer, Marta), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 1227, 1997. |