Marta Cialdea Mayer

Orcid: 0000-0003-4692-4922

Affiliations:
  • Roma Tre University, Rome, Italy


According to our database1, Marta Cialdea Mayer authored at least 57 papers between 1986 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Logical connectives for two-state semantics.
J. Appl. Non Class. Logics, October, 2023

2021
A Framework for Modelling Molecular Interaction Maps.
FLAP, 2021

Option Discovery for Autonomous Generation of Symbolic Knowledge.
Proceedings of the AIxIA 2021 - Advances in Artificial Intelligence, 2021

Autonomous Generation of Symbolic Knowledge via Option Discovery.
Proceedings of the 9th Italian workshop on Planning and Scheduling (IPS'21) and the 28th International Workshop on "Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion" (RCRA'21) with CEUR-WS co-located with 20th International Conference of the Italian Association for Artificial Intelligence (AIxIA 2021), 2021

2020
On timeline-based games and their complexity.
Theor. Comput. Sci., 2020

A Prover Dealing with Nominals, Binders, Transitivity and Relation Hierarchies.
J. Autom. Reason., 2020

A Language for Timeline-based Planning.
Proceedings of the 2nd Workshop on Artificial Intelligence and Formal Verification, 2020

An AI-Based Approach to Automatic Waste Sorting.
Proceedings of the HCI International 2020 - Posters - 22nd International Conference, 2020

Design of Timeline-Based Planning Systems for Safe Human-Robot Collaboration.
Proceedings of the Knowledge Engineering Tools and Techniques for AI Planning, 2020

2019
Evaluating Robustness of an Acting Framework over Temporally Uncertain Domains.
Proceedings of the AI*IA 2019 - Advances in Artificial Intelligence, 2019

A Prototype for the Robust Execution of Flexible Plans.
Proceedings of the 1st Workshop on Artificial Intelligence and Formal Verification, 2019

2018
A Game-Theoretic Approach to Timeline-Based Planning with Uncertainty.
Proceedings of the 25th International Symposium on Temporal Representation and Reasoning, 2018

Integrating Resource Management and Timeline-Based Planning.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

2017
Temporal abductive reasoning about biochemical reactions.
J. Appl. Non Class. Logics, 2017

Complexity of Timeline-Based Planning.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

PLATINUm: A New Framework for Planning and Acting.
Proceedings of the AI*IA 2017 Advances in Artificial Intelligence, 2017

2016
Planning and execution with flexible timelines: a formal account.
Acta Informatica, 2016

Timelines Are Expressive Enough to Capture Action-Based Temporal Planning.
Proceedings of the 23rd International Symposium on Temporal Representation and Reasoning, 2016

Steps in Assessing a Timeline-Based Planner.
Proceedings of the AI*IA 2016: Advances in Artificial Intelligence - XVth International Conference of the Italian Association for Artificial Intelligence, Genova, Italy, November 29, 2016

2015
Erratum to: Extension of a Decision Procedure for a Fragment of Hybrid Logic with Binders.
J. Autom. Reason., 2015

An Executable Semantics of Flexible Plans in Terms of Timed Game Automata.
Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

Quality Metrics to Evaluate Flexible Timeline-Based Plans.
Proceedings of the 6th Italian Workshop on Planning and Scheduling A workshop of the XIV International Conference of the Italian Association for Artificial Intelligence (AI*IA 2015), 2015

Enriching a Temporal Planner with Resources and a Hierarchy-Based Heuristic.
Proceedings of the AI*IA 2015, Advances in Artificial Intelligence, 2015

2014
Extended Decision Procedure for a Fragment of HL with Binders.
J. Autom. Reason., 2014

A Formal Account of Planning with Flexible Timelines.
Proceedings of the 21st International Symposium on Temporal Representation and Reasoning, 2014

2013
A Tableau Based Decision Procedure for an Expressive Fragment of Hybrid Logic with Binders, Converse and Global Modalities.
J. Autom. Reason., 2013

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

A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies.
Proceedings of the Automated Deduction - CADE-24, 2013

2011
A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2011

2010
An efficient approach to nominal equalities in hybrid logic tableaux.
J. Appl. Non Class. Logics, 2010

Herod and Pilate: Two Tableau Provers for Basic Hybrid Logic.
Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

Nominal Substitution at Work with the Global and Converse Modalities.
Proceedings of the Advances in Modal Logic 8, 2010

2009
Abduction and Consequence Generation in a Support System for the Design of Logical Multiple-Choice Questions.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2009

2007
Linear temporal logic as an executable semantics for planning languages.
J. Log. Lang. Inf., 2007

2005
A Proposal for Planning with Graded Fluents and Actions.
Intelligenza Artificiale, 2005

Pdk: The System and Its Language.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2005

Planning with graded fluents and actions.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

2003
Planning under Uncertainty in Linear Time Logic.
Proceedings of the AI*IA 2003: Advances in Artificial Intelligence, 2003

2002
A General Theorem Prover for Quantified Modal Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2002

Linear Time Logic, Conditioned Models, and Planning with Incomplete Knowledge.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2002

2001
Ground and Free-Variable Tableaux for Variants of Quantified Modal Logics.
Stud Logica, 2001

Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation.
Proceedings of the Automated Reasoning, First International Joint Conference, 2001

2000
Variants of First-Order Modal Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

A Planning Fully Based on Linear Time Logic.
Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 2000

1999
First Order Linear Temporal Logic over Finite Time Structures.
Proceedings of the Logic Programming and Automated Reasoning, 6th International Conference, 1999

1998
Bounded Model Search in Linear Temporal Logic and Its Application to Planning.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1998

Using Linear Temporal Logic to Model and Solve Planning Problems.
Proceedings of the Artificial Intelligence: Methodology, 1998

1997
A Polynomial Translation of S4 into T and Contraction-Free Tableaux for S4.
Log. J. IGPL, 1997

Hintikka Multiplicities in Matrix Decision Methods for Some Propositional Modal Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1997

1996
Abduction is not Deduction-in-Reverse.
Log. J. IGPL, 1996

A Study on the Logic of Abduction.
Proceedings of the 12th European Conference on Artificial Intelligence, 1996

1995
Propositional Abduction in Modal Logic.
Log. J. IGPL, 1995

1993
Herbrand style proof procedures for modal logic.
J. Appl. Non Class. Logics, 1993

First order abduction via tableau and sequent calculi.
Log. J. IGPL, 1993

1991
Resolution for Some First-Order Modal Systems.
Theor. Comput. Sci., 1991

1986
A Modal Herbrand's Property.
Math. Log. Q., 1986

Some Remarks on the Possibility of Extending Resolution Proof Procedures to Intuitionistic Logic.
Inf. Process. Lett., 1986


  Loading...