default search action
Marta Cialdea Mayer
Person information
- affiliation: Roma Tre University, Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j21]Marta Cialdea Mayer
, Luis Fariñas del Cerro
Logical connectives for two-state semantics. J. Appl. Non Class. Logics 33(3-4): 520-536 (2023) - 2022
- [i4]Gabriele Sartor, Davide Zollo, Marta Cialdea Mayer, Angelo Oddi
Option Discovery for Autonomous Generation of Symbolic Knowledge. CoRR abs/2206.01815 (2022) - 2021
- [j20]Jean-Marc Alliot, Marta Cialdea Mayer, Robert Demolombe, Martín Diéguez, Luis Fariñas del Cerro:
A Framework for Modelling Molecular Interaction Maps. FLAP 8(7): 1917-1952 (2021) - [c34]Gabriele Sartor, Davide Zollo, Marta Cialdea Mayer, Angelo Oddi, Riccardo Rasconi, Vieri Giuliano Santucci:
Autonomous Generation of Symbolic Knowledge via Option Discovery. IPS-RCRA@AI*IA 2021 - [c33]Gabriele Sartor
Option Discovery for Autonomous Generation of Symbolic Knowledge. AI*IA 2021: 153-167 - 2020
- [j19]Marta Cialdea Mayer
A Prover Dealing with Nominals, Binders, Transitivity and Relation Hierarchies. J. Autom. Reason. 64(1): 135-165 (2020) - [j18]Nicola Gigante
On timeline-based games and their complexity. Theor. Comput. Sci. 815: 247-269 (2020) - [c32]Elio Strollo, Giuseppe Sansonetti, Marta Cialdea Mayer, Carla Limongelli, Alessandro Micarelli:
An AI-Based Approach to Automatic Waste Sorting. HCI (38) 2020: 662-669 - [c31]Giulio Bernardi, Amedeo Cesta, Andrea Orlandini, Alessandro Umbrico, Marta Cialdea Mayer:
A Language for Timeline-based Planning. OVERLAY 2020: 53-58 - [p1]Andrea Orlandini
Design of Timeline-Based Planning Systems for Safe Human-Robot Collaboration. Knowledge Engineering Tools and Techniques for AI Planning 2020: 231-248 - [i3]Jean-Marc Alliot, Marta Cialdea Mayer, Robert Demolombe, Martín Diéguez, Luis Fariñas del Cerro:
A framework for modelling Molecular Interaction Maps. CoRR abs/2008.09546 (2020)
2010 – 2019
- 2019
- [c30]Annarita Lanzilli, Marta Cialdea Mayer, Amedeo Cesta, Andrea Orlandini, Alessandro Umbrico:
A Prototype for the Robust Execution of Flexible Plans. OVERLAY@AI*IA 2019: 89-93 - [c29]Alessandro Umbrico
Evaluating Robustness of an Acting Framework over Temporally Uncertain Domains. AI*IA 2019: 250-263 - 2018
- [c28]Alessandro Umbrico, Amedeo Cesta, Marta Cialdea Mayer, Andrea Orlandini:
Integrating Resource Management and Timeline-Based Planning. ICAPS 2018: 264-272 - [c27]Nicola Gigante
A Game-Theoretic Approach to Timeline-Based Planning with Uncertainty. TIME 2018: 13:1-13:17 - [i2]Nicola Gigante, Angelo Montanari, Marta Cialdea Mayer, Andrea Orlandini, Mark Reynolds:
A game-theoretic approach to timeline-based planning with uncertainty. CoRR abs/1807.04837 (2018) - 2017
- [j17]Serenella Cerrito, Marta Cialdea Mayer
Temporal abductive reasoning about biochemical reactions. J. Appl. Non Class. Logics 27(3-4): 269-291 (2017) - [c26]Alessandro Umbrico
PLATINUm: A New Framework for Planning and Acting. AI*IA 2017: 498-512 - [c25]Nicola Gigante, Angelo Montanari, Marta Cialdea Mayer, Andrea Orlandini:
Complexity of Timeline-Based Planning. ICAPS 2017: 116-124 - 2016
- [j16]Marta Cialdea Mayer
Planning and execution with flexible timelines: a formal account. Acta Informatica 53(6-8): 649-680 (2016) - [c24]Alessandro Umbrico
Steps in Assessing a Timeline-Based Planner. AI*IA 2016: 508-522 - [c23]Nicola Gigante
Timelines Are Expressive Enough to Capture Action-Based Temporal Planning. TIME 2016: 100-109 - 2015
- [j15]Marta Cialdea Mayer:
Erratum to: Extension of a Decision Procedure for a Fragment of Hybrid Logic with Binders. J. Autom. Reason. 55(2): 185 (2015) - [c22]Alessandro Umbrico, Andrea Orlandini, Marta Cialdea Mayer:
Quality Metrics to Evaluate Flexible Timeline-Based Plans. IPS@AI*IA 2015: 17-32 - [c21]Alessandro Umbrico
Enriching a Temporal Planner with Resources and a Hierarchy-Based Heuristic. AI*IA 2015: 410-423 - [c20]Marta Cialdea Mayer, Andrea Orlandini
An Executable Semantics of Flexible Plans in Terms of Timed Game Automata. TIME 2015: 160-169 - 2014
- [j14]Marta Cialdea Mayer
Extended Decision Procedure for a Fragment of HL with Binders. J. Autom. Reason. 53(3): 305-315 (2014) - [c19]Marta Cialdea Mayer
A Formal Account of Planning with Flexible Timelines. TIME 2014: 37-46 - 2013
- [j13]Serenella Cerrito, Marta Cialdea Mayer
A Tableau Based Decision Procedure for an Expressive Fragment of Hybrid Logic with Binders, Converse and Global Modalities. J. Autom. Reason. 51(2): 197-239 (2013) - [c18]Marta Cialdea Mayer
A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies. CADE 2013: 76-90 - [i1]Marta Cialdea Mayer:
A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies (extended version). CoRR abs/1312.2894 (2013) - 2011
- [c17]Serenella Cerrito, Marta Cialdea Mayer
A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders. TABLEAUX 2011: 104-118 - 2010
- [j12]Serenella Cerrito, Marta Cialdea Mayer
An efficient approach to nominal equalities in hybrid logic tableaux. J. Appl. Non Class. Logics 20(1-2): 39-61 (2010) - [c16]Serenella Cerrito, Marta Cialdea Mayer:
Nominal Substitution at Work with the Global and Converse Modalities. Advances in Modal Logic 2010: 59-76 - [c15]Marta Cialdea Mayer
Herod and Pilate: Two Tableau Provers for Basic Hybrid Logic. IJCAR 2010: 255-262
2000 – 2009
- 2009
- [c14]Marta Cialdea Mayer
Abduction and Consequence Generation in a Support System for the Design of Logical Multiple-Choice Questions. TABLEAUX 2009: 167-172 - 2007
- [j11]Marta Cialdea Mayer
Linear temporal logic as an executable semantics for planning languages. J. Log. Lang. Inf. 16(1): 63-89 (2007) - 2005
- [j10]Marta Cialdea Mayer, Carla Limongelli, Andrea Orlandini, Valentina Poggioni:
A Proposal for Planning with Graded Fluents and Actions. Intelligenza Artificiale 2(4): 66-73 (2005) - [c13]Marta Cialdea Mayer, Carla Limongelli, Andrea Orlandini, Valentina Poggioni:
Planning with graded fluents and actions. IJCAI 2005: 1711-1712 - [c12]Marta Cialdea Mayer
Pdk: The System and Its Language. TABLEAUX 2005: 307-311 - 2003
- [c11]Marta Cialdea Mayer, Carla Limongelli, Andrea Orlandini, Valentina Poggioni:
Planning under Uncertainty in Linear Time Logic. AI*IA 2003: 324-335 - [e1]Marta Cialdea Mayer, Fiora Pirri:
Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2003, Rome, Italy, September 9-12, 2003. Proceedings. Lecture Notes in Computer Science 2796, Springer 2003, ISBN 3-540-40787-1 [contents] - 2002
- [c10]Marta Cialdea Mayer, Carla Limongelli:
Linear Time Logic, Conditioned Models, and Planning with Incomplete Knowledge. TABLEAUX 2002: 70-84 - [c9]Virginie Thion, Serenella Cerrito, Marta Cialdea Mayer:
A General Theorem Prover for Quantified Modal Logics. TABLEAUX 2002: 266-280 - 2001
- [j9]Marta Cialdea Mayer, Serenella Cerrito:
Ground and Free-Variable Tableaux for Variants of Quantified Modal Logics. Stud Logica 69(1): 97-131 (2001) - [c8]Serenella Cerrito, Marta Cialdea Mayer:
Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation. IJCAR 2001: 137-151 - 2000
- [c7]Marta Cialdea Mayer, Andrea Orlandini, Giulio Balestreri, Carla Limongelli:
A Planning Fully Based on Linear Time Logic. AIPS 2000: 347-354 - [c6]Marta Cialdea Mayer
Variants of First-Order Modal Logics. TABLEAUX 2000: 175-189
1990 – 1999
- 1999
- [c5]Serenella Cerrito, Marta Cialdea Mayer, Sébastien Praud:
First Order Linear Temporal Logic over Finite Time Structures. LPAR 1999: 62-76 - 1998
- [c4]Serenella Cerrito, Marta Cialdea Mayer:
Using Linear Temporal Logic to Model and Solve Planning Problems. AIMSA 1998: 141-152 - [c3]Serenella Cerrito, Marta Cialdea Mayer:
Bounded Model Search in Linear Temporal Logic and Its Application to Planning. TABLEAUX 1998: 124-140 - 1997
- [j8]Serenella Cerrito, Marta Cialdea Mayer:
A Polynomial Translation of S4 into T and Contraction-Free Tableaux for S4. Log. J. IGPL 5(2): 287-300 (1997) - [c2]Serenella Cerrito, Marta Cialdea Mayer:
Hintikka Multiplicities in Matrix Decision Methods for Some Propositional Modal Logics. TABLEAUX 1997: 138-152 - 1996
- [j7]Marta Cialdea Mayer, Fiora Pirri:
Abduction is not Deduction-in-Reverse. Log. J. IGPL 4(1): 95-108 (1996) - [c1]Marta Cialdea Mayer, Fiora Pirri:
A Study on the Logic of Abduction. ECAI 1996: 18-22 - 1995
- [j6]Marta Cialdea Mayer, Fiora Pirri:
Propositional Abduction in Modal Logic. Log. J. IGPL 3(6): 907-919 (1995) - 1993
- [j5]Marta Cialdea Mayer, Fiora Pirri:
First order abduction via tableau and sequent calculi. Log. J. IGPL 1(1): 99-117 (1993) - [j4]Marta Cialdea:
Herbrand style proof procedures for modal logic. J. Appl. Non Class. Logics 3(2): 205-223 (1993) - 1991
- [j3]Marta Cialdea
Resolution for Some First-Order Modal Systems. Theor. Comput. Sci. 85(2): 213-229 (1991)
1980 – 1989
- 1986
- [j2]Marta Cialdea
Some Remarks on the Possibility of Extending Resolution Proof Procedures to Intuitionistic Logic. Inf. Process. Lett. 22(2): 87-90 (1986) - [j1]Marta Cialdea, Luis Fariñas del Cerro:
A Modal Herbrand's Property. Math. Log. Q. 32(31-34): 523-530 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: