Some Remarks on the Possibility of Extending Resolution Proof Procedures to Intuitionistic Logic. - Marta Cialdea (Inf. Process. Lett., 1986)

A Modal Herbrand's Property. - Marta Cialdea; Luis Fariñas del Cerro (Math. Log. Q., 1986)

Resolution for Some First-Order Modal Systems. - Marta Cialdea (Theor. Comput. Sci., 1991)

First order abduction via tableau and sequent calculi. - Marta Cialdea Mayer; Fiora Pirri (Log. J. IGPL, 1993)

Herbrand style proof procedures for modal logic. - Marta Cialdea (J. Appl. Non Class. Logics, 1993)

Propositional Abduction in Modal Logic. - Marta Cialdea Mayer; Fiora Pirri (Log. J. IGPL, 1995)

A Study on the Logic of Abduction. - Marta Cialdea Mayer; Fiora Pirri (ECAI, 1996)

Abduction is not Deduction-in-Reverse. - Marta Cialdea Mayer; Fiora Pirri (Log. J. IGPL, 1996)

Hintikka Multiplicities in Matrix Decision Methods for Some Propositional Modal Logics. - Serenella Cerrito; Marta Cialdea Mayer (TABLEAUX, 1997)

A Polynomial Translation of S4 into T and Contraction-Free Tableaux for S4. - Serenella Cerrito; Marta Cialdea Mayer (Log. J. IGPL, 1997)

Using Linear Temporal Logic to Model and Solve Planning Problems. - Serenella Cerrito; Marta Cialdea Mayer (AIMSA, 1998)

Bounded Model Search in Linear Temporal Logic and Its Application to Planning. - Serenella Cerrito; Marta Cialdea Mayer (TABLEAUX, 1998)

First Order Linear Temporal Logic over Finite Time Structures. - Serenella Cerrito; Marta Cialdea Mayer; Sébastien Praud (LPAR, 1999)

A Planning Fully Based on Linear Time Logic. - Marta Cialdea Mayer; Andrea Orlandini; Giulio Balestreri; Carla Limongelli (AIPS, 2000)

Variants of First-Order Modal Logics. - Marta Cialdea Mayer; Serenella Cerrito (TABLEAUX, 2000)

Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation. - Serenella Cerrito; Marta Cialdea Mayer (IJCAR, 2001)

Ground and Free-Variable Tableaux for Variants of Quantified Modal Logics. - Marta Cialdea Mayer; Serenella Cerrito (Stud Logica, 2001)

Linear Time Logic, Conditioned Models, and Planning with Incomplete Knowledge. - Marta Cialdea Mayer; Carla Limongelli (TABLEAUX, 2002)

A General Theorem Prover for Quantified Modal Logics. - Virginie Thion; Serenella Cerrito; Marta Cialdea Mayer (TABLEAUX, 2002)

Planning under Uncertainty in Linear Time Logic. - Marta Cialdea Mayer; Carla Limongelli; Andrea Orlandini; Valentina Poggioni (AI*IA, 2003)

Planning with graded fluents and actions. - Marta Cialdea Mayer; Carla Limongelli; Andrea Orlandini; Valentina Poggioni (IJCAI, 2005)

Pdk: The System and Its Language. - Marta Cialdea Mayer; Carla Limongelli; Andrea Orlandini; Valentina Poggioni (TABLEAUX, 2005)

A Proposal for Planning with Graded Fluents and Actions. - Marta Cialdea Mayer; Carla Limongelli; Andrea Orlandini; Valentina Poggioni (Intelligenza Artificiale, 2005)

Linear temporal logic as an executable semantics for planning languages. - Marta Cialdea Mayer; Carla Limongelli; Andrea Orlandini; Valentina Poggioni (J. Log. Lang. Inf., 2007)

Abduction and Consequence Generation in a Support System for the Design of Logical Multiple-Choice Questions. - Marta Cialdea Mayer (TABLEAUX, 2009)

Nominal Substitution at Work with the Global and Converse Modalities. - Serenella Cerrito; Marta Cialdea Mayer (Advances in Modal Logic, 2010)

Herod and Pilate: Two Tableau Provers for Basic Hybrid Logic. - Marta Cialdea Mayer; Serenella Cerrito (IJCAR, 2010)

An efficient approach to nominal equalities in hybrid logic tableaux. - Serenella Cerrito; Marta Cialdea Mayer (J. Appl. Non Class. Logics, 2010)

A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders. - Serenella Cerrito; Marta Cialdea Mayer (TABLEAUX, 2011)

A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies. - Marta Cialdea Mayer (CADE, 2013)

A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies (extended version). - Marta Cialdea Mayer (CoRR, 2013)

A Tableau Based Decision Procedure for an Expressive Fragment of Hybrid Logic with Binders, Converse and Global Modalities. - Serenella Cerrito; Marta Cialdea Mayer (J. Autom. Reason., 2013)

A Formal Account of Planning with Flexible Timelines. - Marta Cialdea Mayer; Andrea Orlandini; Alessandro Umbrico (TIME, 2014)

Extended Decision Procedure for a Fragment of HL with Binders. - Marta Cialdea Mayer (J. Autom. Reason., 2014)

Enriching a Temporal Planner with Resources and a Hierarchy-Based Heuristic. - Alessandro Umbrico; Andrea Orlandini; Marta Cialdea Mayer (AI*IA, 2015)

Quality Metrics to Evaluate Flexible Timeline-Based Plans. - Alessandro Umbrico; Andrea Orlandini; Marta Cialdea Mayer (IPS@AI*IA, 2015)

An Executable Semantics of Flexible Plans in Terms of Timed Game Automata. - Marta Cialdea Mayer; Andrea Orlandini (TIME, 2015)

Erratum to: Extension of a Decision Procedure for a Fragment of Hybrid Logic with Binders. - Marta Cialdea Mayer (J. Autom. Reason., 2015)

Steps in Assessing a Timeline-Based Planner. - Alessandro Umbrico; Amedeo Cesta; Marta Cialdea Mayer; Andrea Orlandini (AI*IA, 2016)

Timelines Are Expressive Enough to Capture Action-Based Temporal Planning. - Nicola Gigante; Angelo Montanari; Marta Cialdea Mayer; Andrea Orlandini (TIME, 2016)

Planning and execution with flexible timelines: a formal account. - Marta Cialdea Mayer; Andrea Orlandini; Alessandro Umbrico (Acta Informatica, 2016)

PLATINUm: A New Framework for Planning and Acting. - Alessandro Umbrico; Amedeo Cesta; Marta Cialdea Mayer; Andrea Orlandini (AI*IA, 2017)

Complexity of Timeline-Based Planning. - Nicola Gigante; Angelo Montanari; Marta Cialdea Mayer; Andrea Orlandini (ICAPS, 2017)

Temporal abductive reasoning about biochemical reactions. - Serenella Cerrito; Marta Cialdea Mayer; Robert Demolombe (J. Appl. Non Class. Logics, 2017)

Integrating Resource Management and Timeline-Based Planning. - Alessandro Umbrico; Amedeo Cesta; Marta Cialdea Mayer; Andrea Orlandini (ICAPS, 2018)

A Game-Theoretic Approach to Timeline-Based Planning with Uncertainty. - Nicola Gigante; Angelo Montanari; Marta Cialdea Mayer; Andrea Orlandini; Mark Reynolds 001 (TIME, 2018)

A Prototype for the Robust Execution of Flexible Plans. - Annarita Lanzilli; Marta Cialdea Mayer; Amedeo Cesta; Andrea Orlandini; Alessandro Umbrico (OVERLAY@AI*IA, 2019)

Evaluating Robustness of an Acting Framework over Temporally Uncertain Domains. - Alessandro Umbrico; Amedeo Cesta; Marta Cialdea Mayer; Andrea Orlandini (AI*IA, 2019)

Design of Timeline-Based Planning Systems for Safe Human-Robot Collaboration. - Andrea Orlandini; Marta Cialdea Mayer; Alessandro Umbrico; Amedeo Cesta (Knowledge Engineering Tools and Techniques for AI Planning, 2020)

An AI-Based Approach to Automatic Waste Sorting. - Elio Strollo; Giuseppe Sansonetti; Marta Cialdea Mayer; Carla Limongelli; Alessandro Micarelli (HCI (38), 2020)

A Language for Timeline-based Planning. - Giulio Bernardi 001; Amedeo Cesta; Andrea Orlandini; Alessandro Umbrico; Marta Cialdea Mayer (OVERLAY, 2020)

A Prover Dealing with Nominals, Binders, Transitivity and Relation Hierarchies. - Marta Cialdea Mayer (J. Autom. Reason., 2020)

On timeline-based games and their complexity. - Nicola Gigante; Angelo Montanari; Andrea Orlandini; Marta Cialdea Mayer; Mark Reynolds 001 (Theor. Comput. Sci., 2020)

Autonomous Generation of Symbolic Knowledge via Option Discovery. - Gabriele Sartor; Davide Zollo; Marta Cialdea Mayer; Angelo Oddi; Riccardo Rasconi; Vieri Giuliano Santucci (IPS-RCRA@AI*IA, 2021)

Option Discovery for Autonomous Generation of Symbolic Knowledge. - Gabriele Sartor; Davide Zollo; Marta Cialdea Mayer; Angelo Oddi; Riccardo Rasconi; Vieri Giuliano Santucci (AI*IA, 2021)

A Framework for Modelling Molecular Interaction Maps. - Jean-Marc Alliot; Marta Cialdea Mayer; Robert Demolombe; Martín Diéguez; Luis Fariñas del Cerro (FLAP, 2021)

Logical connectives for two-state semantics. - Marta Cialdea Mayer; Luis Fariñas del Cerro (J. Appl. Non Class. Logics, 2023)