Publications

Here you can find references to my works since 1992/93 (approx.), and a selection of previous works: papers, books and technical reports.

Journal, Conference and Workshop Papers

• Marta Cialdea Mayer, Luis Fariñas del Cerro.
  Logical Connectives for two-state Semantics.
  Journal of Applied Non-classical Logics, 8 (3-4):520-536, 2023.
  
  
• Gabriele Sartor, Davide Zollo, Marta Cialdea Mayer, Angelo Oddi, Riccardo Rasconi, Vieri Giuliano Santucci.
  Autonomous Generation of Symbolic Knowledge via Option Discovery.
  9th Italian Workshop on Planning and Scheduling (IPS-2021), 2021.
  
  
• Jean-Marc Alliot, Marta Cialdea Mayer, Robert Demolombe, Martín Diéguez, Luis Fariñas del Cerro.
  A Framework for Modelling Molecular Interaction Maps.
  Journal of Applied Logics — IfCoLog Journal of Logics and their Applications, 8(7):1917-1951, 2021.
  
  
• Giulio Bernardi, Amedeo Cesta, Andrea Orlandini, Alessandro Umbrico, Marta Cialdea Mayer.
  A Language for Timeline-based Planning.
  The 2nd Workshop on Artificial Intelligence and Formal Verification, Logics, Automata and Synthesis (OVERLAY), 2020.
  
  
• N. Gigante, A. Montanari, A. Orlandini, M. Cialdea Mayer, M. Reynolds
  On timeline-based games and their complexity.
  Theoretical Computer Science (2020).
  Presented also at the Journal Presentation Track of the 30th International Conference on Automated Planning and Scheduling (ICAPS), 2020.
  
  
• A. Orlandini, M. Cialdea Mayer, A. Umbrico, A. Cesta
  Design of Timeline-Based Planning Systems for Safe Human-Robot Collaboration.
  In: Vallati M., Kitchin D. (eds) Knowledge Engineering Tools and Techniques for AI Planning. Springer, 2020.
  
  
• M. Cialdea Mayer.
  A Prover Dealing with Nominals, Binders, Transitivity and Relation Hierarchies.
  Journal of Automated Reasoning 64:135-165, 2020.
  Abstract. Springer Nature SharedIt full-text.
  
  
• E. Strollo, G. Sansonetti, M. Cialdea Mayer, C. Limongelli, A. Micarelli.
  An AI-Based Approach to Automatic Waste Sorting.
  International Conference on Human-Computer Interaction. HCII 2020: HCI International 2020 - Posters, pp 662-669, Springer 2020.
  
  
• A. Lanzilli, M. Cialdea Mayer, A. Cesta, A. Orlandini, A. Umbrico.
  A prototype for the robust execution of flexible plans.
  The First Workshop on Artificial Intelligence and Formal Verification, Logics, Automata and Synthesis (OVERLAY), 2019.
  
  
• A. Umbrico, A. Cesta, M. Cialdea Mayer, A. Orlandini
  Evaluating Robustness of an Acting Framework over Temporally Uncertain Domains.
  International Conference of the Italian Association for Artificial Intelligence (AIxIA 2019), pp. 250-263, Springer 2019, LNAI 11946.
  
  
• J.M. Alliot, M. Cialdea, R. Demolombe, M. Dieguez, L. Fariñas, G. Favre, J. C. Faye, O. Sordet
  P3M: une plate-forme logicielle pour la modélisation et la manipulation des cartes d'interactions moléculaires.
  Conférence Nationale sur les Applications Pratiques de l"Intelligence Artificielle (APIA 2019), pp. 6-13.
  
  
• N.Gigante, A. Montanari, M. Cialdea Mayer, A. Orlandini, M. Reynolds.
  A game-theoretic approach to timeline-based planning with uncertainty.
  25th International Symposium on Temporal Representation and Reasoning (TIME 2018), Leibniz International Proceedings in Informatics, 2018.
  ArXiv extended version with proofs.
  
  
• A. Umbrico, A. Cesta, M. Cialdea Mayer, A. Orlandini.
  Integrating Resource Management and Timeline-based Planning.
  28th International Conference on Automated Planning and Scheduling (ICAPS 2018), AAAI Publications, 2018, pp. 264-272.
  
  
• S. Cerrito, M. Cialdea Mayer, R. Demolombe.
  Temporal Abductive Reasoning about Biochemical Reactions.
  Journal of Applied Non-Classical Logics, 27(3-4):269-291, 2017.
  Abstract. Draft.
  DOI: 10.1080/11663081.2018.1427986
  
  
• A. Umbrico, A. Cesta, M. Cialdea Mayer, A. Orlandini.
  PLATINUm: A New Framework for Planning and Acting.
  AI*IA 2017 Advances in Artificial Intelligence (AI*IA 2017), pp. 498-512, Springer 2017, volume 10640 of LNCS.
  DOI: 10.1007/978-3-319-70169-1_37
  
  
• N. Gigante, A. Montanari, M. Cialdea Mayer, A. Orlandini.
  Complexity of Timeline-based Planning.
  Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS 2017), pp. 116-124, AAAI Press.
  
  
• N. Gigante, A. Montanari, M. Cialdea Mayer, A. Orlandini.
  Timelines are Expressive Enough to Capture Action-Based Temporal Planning.
  23rd International Symposium on Temporal Representation and Reasoning (TIME 2016), pp. 100-109, IEEE 2016.
  DOI: 10.1109/TIME.2016.18.
  
  
• A. Umbrico, A. Cesta, M. Cialdea Mayer, A. Orlandini.
  Steps in Assessing a Timeline-Based Planner.
  AI* IA 2016 Advances in Artificial Intelligence, pages 508-522. Springer 2016, volume 10037 of LNCS.
  DOI: 10.1007/978-3-319-49130-1_37.
  
  
• M. Cialdea Mayer, A. Orlandini, A. Umbrico
  Planning and execution with flexible timelines: a formal account.
  Acta Informatica, 53 (6):649–680, 2016.
  DOI: 10.1007/s00236-015-0252-z.
  Abstract. Accepted manuscript version.
  
  
• M. Cialdea Mayer, A. Orlandini.
  An executable semantics of flexible plans in terms of Timed Game Automata.
  Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning (TIME 2015), pages 160-169, IEEE 2015.
  DOI: 10.1109/TIME.2015.16.
  Abstract. Draft.
  
  
• A. Umbrico, A. Orlandini, M. Cialdea Mayer,
  Enriching a Temporal Planner with Resources and a Hierarchy-based Heuristic.
  AI*IA 2015 Advances in Artificial Intelligence (14th Conference of the Italian Association for Artificial Intelligence), pages 410-423, Springer 2015.
  DOI: 10.1007/978-3-319-24309-2_31.
  
  
• A. Umbrico, A. Orlandini, M. Cialdea Mayer,
  Quality Metrics to Evaluate Flexible Timeline-based Plans.
  Proc. of the 6th Italian Workshop on Planning and Scheduling (IPS 2015).
  
  
• M. Cialdea Mayer, A. Orlandini, A. Umbrico
  A Formal Account of Planning with Flexible Timelines
  21st International Symposium on Temporal Representation and Reasoning (TIME 2014), pages 37-46, 2014
  DOI: 10.1109/TIME.2014.27.
  Abstract.
  
  
• M. Cialdea Mayer.
  Extended Decision Procedure for a Fragment of HL with Binders
  Journal of Automated Reasoning, 53(3):305-315, 2014.
  DOI: 10.1007/s10817-014-9307-z.
  Abstract. Draft. Erratum.
  
  
• M. Cialdea Mayer.
  A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies
  24th Conference on Automated Deduction (CADE 2013), LNCS 7898, Springer Verlag, pp. 76-90, 2013.
  DOI: 10.1007/978-3-642-38574-2_5
  Abstract. Draft. Errata Corrige. Slides illustrating the calculus in action. Extended version.
  
  
• S. Cerrito, M. Cialdea Mayer.
  A Tableau Based Decision Procedure for an Expressive Fragment of Hybrid Logic with Binders, Converse and Global Modalities
  Journal of Automated Reasoning, 51(2):197-239, 2013.
  DOI: 10.1007/s10817-012-9257-2.
  Abstract. Draft.
  
  
• S. Cerrito, M. Cialdea Mayer.
  A Tableau Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders.
  K. Brünnler and G. Metcalfe (Eds.): Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2011), LNAI 6793, Springer Verlag, pp. 104-118, 2011.
  DOI: 10.1007/978-3-642-22119-4_10.
  Abstract. Draft.
  
  
• M. Cialdea Mayer, S. Cerrito.
  Nominal Substitution at work with the Global and Converse Modalities.
  Lev Beklemishev, Valentin Goranko and Valentin Shehtman (Eds.): Advances in Modal Logic, volume 8, College Publications, pp. 57-74, 2010.
  Abstract. Draft.
  
  
• M. Cialdea Mayer, S. Cerrito.
  Herod and Pilate: two tableau provers for basic hybrid logic.
  J. Giesl and R. Haehnle (Eds.): IJCAR 2010, LNAI 6173, pp. 255-262, 2010.
  DOI: 10.1007/978-3-642-14203-1_22.
  Abstract. Draft.
  
  
• S. Cerrito, M. Cialdea Mayer.
  An efficient approach to nominal equalities in hybrid logic tableaux.
  Journal of Applied Non-Classical Logics, 20(1-2):39-61, 2010.
  DOI: 10.3166/jancl.20.39-61.
  Abstract. Draft.
  
  
• M. Cialdea Mayer.
  Abduction and consequence generation in a support system for the design of logical multiple-choice questions.
  In M. Giese and A. Waaler (eds.), Automated Resoning with Analytic Tableaux and Related Methods (TABLEAUX 2009). LNAI 5607, pages 167-172, Springer, 2009.
  DOI: 10.1007/978-3-642-02716-1_13.
  Abstract. Draft.
  
  
• M. Cialdea Mayer, C. Limongelli, A. Orlandini, V. Poggioni
  Linear temporal logic as an executable semantics for planning languages.
  Journal of Logic Language and Information (2007) 16:63-89.
  DOI: 10.1007/s10849-006-9022-1.
  Abstract. Draft.
  
  
• M. Cialdea, C. Limongelli, A. Orlandini, V. Poggioni.
  A Proposal for Planning with graded fluents and actions (Pianificare con azioni e fluenti graduati).
  Intelligenza Artificiale, 2(4):66-73, 2005.
  
  
• M. Cialdea, C. Limongelli, A. Orlandini, V. Poggioni.
  Pdk: the system and its language.
  Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2005), pages 307-311. Springer 2005.
  DOI: 10.1007/11554554_23
  Abstract. Draft.
  
  
• V. Poggioni, M. Cialdea, C. Limongelli, A. Orlandini.
  Planning with Graded Fluents and Actions.
  Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05) p. 1711-1712.
  
  
• M. Bordegoni, M. Cialdea, D. Nardi, F. Pirri.
  Simulation and robotic systems for operations in emergency scenarios. IEEE International Workshop on Safety, Security and Rescue Robotics (SSRR 04), 2004.
  
  
• M. Cialdea, C. Limongelli, A. Orlandini, V. Poggioni.
  Towards a Parallel Search Engine for Planning Systems Based on Linear Time Logic. 9 Convegno Italiano di Intelligenza Artificiale AI*IA, Perugia, settembre 2004.
  
  
• M. Cialdea, C. Limongelli, A. Orlandini, V. Poggioni.
  Planning under Uncertainty in Linear Time Logic.
  In A. Cappelli, F. Turini (eds.), AI*IA 2003: Advances in Artificial Intelligence. LNAI 2829, pages 324-335, Springer, 2003.
  DOI: 10.1007/978-3-540-39853-0_27.
  
  
• M. Cialdea, C. Limongelli.
  Linear Time Logic, Conditioned Models and Planning with Incomplete Knowledge.
  In U. Egly and C. G. Fermüller (eds.), Automated Resoning with Analytic Tableaux and Related Methods (Tableaux 2002).LNAI 2381, pages 70-84, Springer, 2002.
  DOI: 10.1007/3-540-45616-3_6.
  Draft.
  
  
• V. Thion, S. Cerrito, M. Cialdea.
  A General Theorem Prover for Quantified Modal Logics.
  In U. Egly and C. G. Fermüller (eds.), Automated Resoning with Analytic Tableaux and Related Methods (Tableaux 2002). LNAI 2381, pages 266-280, Springer, 2002.
  DOI: 10.1007/3-540-45616-3_19
  Draft.
  
  
• M. Cialdea Mayer, S. Cerrito.
  Free-Variable Tableaux for Constant-Domain Quantified Modal Logic with Rigid and Non-rigid Designation.
  In R. Gore, A. Leitsch, T. Nipkow (eds.), Automated Reasoning. First International Joint Conference, IJCAR 2001. Springer-Verlag, LNAI 2083, pages 137-151.
  DOI: 10.1007/3-540-45744-5_11.
  Abstract. Draft.
  
  
• M. Cialdea Mayer, S. Cerrito.
  Ground and Free-Variable Tableaux for Variants of Quantified Modal Logics.
  Studia Logica 69: 97-131, 2001.
  DOI: 10.1023/A:1013838528631
  Abstract. Draft.
  
  
• M. Cialdea Mayer, C. Limongelli, A. Orlandini. G. Balestreri.
  The main features of a planner fully based on LTL.
  AIPS-2000 Workshop on Model-Theoretic Approaches to Planning, April 2000.
  
  
• M. Cialdea Mayer, A. Orlandini. G. Balestreri, C. Limongelli.
  A Planner Fully Based on Linear Time Logic.
  In Proc. of the 5th Int. Conf. on Artificial Intelligence Planning and Scheduling (AIPS-2000), pages 347-354. AAAI Press, 2000.
  
  
• M. Cialdea Mayer, S. Cerrito.
  Variants of First-Order Modal Logics.
  In R. Dyckhoff (ed.), Automated Resoning with Analytic Tableaux and Related Methods (Tableaux 2000). LNAI 1847, pages 175-189, Springer, 2000.
  DOI: 10.1007/10722086_16.
  Draft.
  
  
• S. Cerrito, M. Cialdea Mayer.
  Labelled Tableaux for Propositional Linear Time Logic over Finite Frames.
  In D. Basin, M. D'Agostino, D. M. Gabbay, S. Matthews, L. Viganò (eds.), Labelled Deduction, pages 135-159, Kluwer, 2000. ISBN O978-0-7923-6237-1
  
  
• S. Cerrito, M. Cialdea Mayer, S. Praud.
  First Order Linear Temporal Logic over Finite Time Structures.
  In Ganzinger, H. and McAllester, D. and Voronkov, A. (editors), Proc. of the 6th Int. Conf. on Logic for Programming and Automated Reasoning (LPAR'99), pages 62-76. LNAI 1705, Springer 1999.
  
  
• S. Cerrito and M. Cialdea Mayer.
  Using Linear Temporal Logic to Model and Solve Planning Problems, in F. Giunghiglia (ed.), Proceedings of the 8th International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA'98), pages 141-152. Springer, 1998.
  
  
• S. Cerrito and M. Cialdea Mayer.
  Bounded Model Search in Linear Temporal Logic and its Application to Planning, in H. De Swart (ed.), Automated Resoning with Analytic Tableaux and Related Methods (Proc. of TABLEAUX'98), pages 124-140. LNAI 1397, Springer 1998.
  
  
• S. Cerrito and M. Cialdea Mayer.
  Hintikka multiplicities in matrix decision methods for some propositional modal logics. In D. Galmiche, ed., Automated Reasoning with Analytic Tableaux and Related Methods (Proc. of TABLEAUX'97), pages 138-152. LNAI 1227, Springer 1997.
  
  
• S. Cerrito and M. Cialdea Mayer.
  A polynomial translation of S4 into T and contraction free tableaux for S4.
  Logic Journal of the IGPL 5(2):287-300, 1997.
  
  
• M. Cialdea Mayer and F. Pirri.
  A study on the logic of abduction.
  Proc. of the 12th European Conference on Artificial Intelligence (ECAI-96), pages 18-27.
  
  
• M. Cialdea Mayer and F. Pirri.
  Abduction is not Deduction-in-Reverse.
  Journal of the Interest Group in Pure and Applied Logics (IGPL), 4(1):1-14, 1996.
  
  
• L. Aiello, M. Cialdea, D. Nardi, and M. Shaerf.
  Modal and meta-languages: consistency and expressiveness.
  In K. Apt and F. Turini, editors, Meta-Logics and Logic Programming, pages 243-265. MIT Press, 1995.
  
  
• M. Cialdea Mayer and F. Pirri.
  Propositional abduction in modal logic.
  Journal of the Interest Group in Pure and Applied Logics (IGPL), 3:907-919, 1995.
  
  
• M. Cialdea Mayer and F. Pirri.
  First order abduction via tableau and sequent calculi.
  Bulletin of the Interest Group in Pure and Applied Logics (IGPL), 1:99-117, 1993.
  
  
• M. Cialdea Mayer, F. Pirri, and C. Pizzuti.
  Natural properties of abductive hypotheses in three-valued logic.
  In ICLP '93 Postconference Workshop on Abductive Reasoning, 1993.
  
  
• M. Cialdea Mayer.
  Herbrand style proof procedures for modal logics.
  Journal of Applied Non-Classical Logics, 3:205-223, 1993.
  
  
• L. Aiello, M. Cialdea, D. Nardi.
  Reasoning about student knowledge and reasoning.
  Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI'91), pages 1087--1093, 1991.
  Also in the Journal of Artificial Intelligence in Education, 3:397-413, 1993.
  
  
• L. Aiello,M. Cialdea, D. Nardi.
  A Meta-Level Abstract Description of Diagnosis in Intelligent Educational Systems.
  In Proceedings of the Sixth International Annual PEG Conference - Knowledge Based Environments for Teaching and Learning, pages 437-442, 1991.
  
  
• M. Cialdea.
  Meta reasoning and student modelling.
  In E. Costa, editor, New Directions for Intelligent Tutoring Systems, pages 71-90. Springer, 1991.
  
  
• M. Cialdea.
  Resolution for some first order modal systems.
  Theoretical Computer Science, 85:213-229, 1991.
  
  
• M. Cialdea, L. Farinas del Cerro.
  A modal Herbrand's property.
  Z. Math. Logik Grunliag. Math., 32:523-530, 1986.
  
  
• M. Cialdea.
  Some remarks on the possibility of extending resolution proof procedures to intuitionistic logic.
  Information Processing Letters, 22:87-90, 1986.
  
  

Books (in Italian)

• M. Cialdea Mayer.
  Logica - Linguaggio, Ragionamento, Calcolo. Progetto Leonardo. Società Editrice Esculapio, 2002.
  
  
• M. Cialdea Mayer, C. Limongelli.
  Introduzione alla Programmazione Funzionale. Progetto Leonardo. Società Editrice Esculapio, 2002.
  
  
• L. Carlucci Aiello, M. Cialdea Mayer.
  Invito all'Intelligenza Artificiale. Franco Angeli, 1995.
  
  

Technical Reports and Slides

• Jean-Marc Alliot, Marta Cialdea Mayer, Robert Demolombe, Martín Diéguez, Luis Fariñas del Cerro.
  A Framework for Modelling Molecular Interaction Maps.
  arXiv:2008.09546, 2020.
  
  
• M. Cialdea Mayer.
  A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies (extended version)
  arXiv:1312.2894, 2013.
  
  
• M. Cialdea Mayer.
  Tableaux for Multi-modal Hybrid Logic with Binders, Transitive Relations and Relation Hierarchies.
  Technical Report RT-DIA-199-2012, Dipartimento di Informatica e Automazione, Università di Roma Tre, 2012.
  
  
• S. Cerrito, M. Cialdea Mayer.
  A Tableaux Based Decision Procedure for a Broad Fragment of Full Hybrid Logic.
  Technical Report RT-DIA-191-2011, Dipartimento di Informatica e Automazione, Università di Roma Tre, 2011.
  
  
• S. Cerrito, M. Cialdea Mayer.
  A calculus for a decidable fragment of hybrid logic with binders.
  Technical Report RT-DIA-181-2011, Dipartimento di Informatica e Automazione, Università di Roma Tre, 2011.
  
  
• S. Cerrito, M. Cialdea Mayer.
  Tableaux with Substitution for Hybrid Logic with the Global and Converse Modalities.
  Technical Report RT-DIA-155-2009, Dipartimento di Informatica e Automazione, Università di Roma Tre, 2009.
  
  
• M. Cialdea Mayer, S. Cerrito, E. Benassi, F. Giammarinaro, C. Varani.
  Two tableau provers for basic hybrid logic.
  Technical Report RT-DIA-145-2009, Dipartimento di Informatica e Automazione, Università di Roma Tre, 2009.
  
  
• M. Cialdea Mayer.
  The abduction and consequence generation algorithm used by Logitest, a support system for logical MCQs designers.
  Technical Report RT-DIA-142-2009, Dipartimento di Informatica e Automazione, Università di Roma Tre, 2009.
  
  
• S. Cerrito, M. Cialdea Mayer
  Terminating tableaux for HL(@) without loop-cheking.
  Technical Report IBISC-RR2007-07, Laboratoire IBISC (Informatique, Biologie Intégrative et Systèmes Complexes) Université d'Evry Val d'Essonne, 2007.
  
  
• M. Cialdea, C. Limongelli .
  A Description Language for Planning with Domain and Control Knowledge. Technical Report RT-DIA-68-2001, Dipartimento di Informatica e Automazione, Università di Roma Tre, 2001.
  
  
• M. Cialdea. Quantified Modal Logic and Tableau Methods: Slides for a talk at Methods for Modalities 2001 (M4M-2).
  
  
• S. Cerrito, M. Cialdea Mayer, S. Praud.
  First Order Linear Temporal Logic over Finite Time Structures is not semi-decidable. Technical Report LRI n. 1208, 1999. Presented at the Workshop Methods for Modalities 1 - M4M (Amsterdam, May 1999).
  
  
• S. Cerrito, M. Cialdea Mayer, S. Praud.
  A Tableau Calculus for First Order Linear Temporal Logic over Bounded Time Structures. Technical Report LRI n. 1207, 1999.
  
  
• S. Cerrito and M. Cialdea Mayer.
  TabPlan: planning in Linear Temporal Logic.
  Technical Report 1141, Universite de Paris Sud, LRI, 1997.
  
  
• S. Cerrito and M. Cialdea Mayer.
  A prefixed tableau calculus for plan generation in linear temporal logic.
  Technical Report RT-DIA-24-97, 1997.
  
  
• M. Cialdea Mayer, S. Cerrito, and A. Cesta.
  Planning as model construction in linear temporal logic.
  Technical Report RT-DIA-23-97, 1997.
  Presented as a poster session at IJCAI-97.
  
  
• S. Cerrito and M. Cialdea Mayer.
  A study on transitive modal logics.
  Technical Report Universite de Paris Sud, LRI, 1996.
  
  
• M. Cialdea Mayer and F. Pirri.
  A study on the relation between explanans and explanandum: a modal approach.
  Technical report, Dipartimento di Informatica e Sistemistica. Universita` di Roma "La Sapienza", 1995.