Dipartimento di Informatica e Automazione
Via della Vasca Navale 79, 00146 Roma, Italy
Tel.: +39-06-55173232 Fax: +39-06-5573030

e-mail: cialdea@dia.uniroma3.it

Marta Cialdea Mayer

Publications and Technical Reports

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

Marta 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.

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.

M. Cialdea Mayer, C. Limongelli, A. Orlandini, V. Poggioni: Linear temporal logic as an executable semantics for planning languages.; J. Logic Language and Information (2007) 16:63-89

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.

M. Cialdea, C. Limongelli, A. Orlandini, V. Poggioni.: Pianificare con azioni e fluenti graduati. Intelligenza Artificiale 2005, Anno II, numero 4, pp 66-73.

M. Cialdea, C. Limongelli, A. Orlandini, V. Poggioni.: Pdk: the system and its language. TABLEAUX 2005, Automated Reasoning with Analytic Tableaux and Related Methods. Springer 2005.

V. Poggioni, M. Cialdea, C. Limongelli, A. Orlandini.: Planning with Graded Fluents and Actions. Proceedings of the Nineteenth 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.

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.

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.

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.

M. Cialdea. Quantified Modal Logic and Tableau Methods: Slides for a talk at Methods for Modalities 2001 (M4M-2).

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.

M. Cialdea Mayer, S. Cerrito.: Ground and Free-Variable Tableaux for Variants of Quantified Modal Logics.
Studia Logica 69: 97-131, 2001.

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.

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.

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, 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.: 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.: TabPlan: planning in Linear Temporal Logic.; Technical Report 1141, Universite de Paris Sud, LRI.

S. Cerrito and M. Cialdea Mayer.: A prefixed tableau calculus for plan generation in linear temporal logic.; Technical Report RT-DIA-24-97.

M. Cialdea Mayer, S. Cerrito, and A. Cesta.: Planning as model construction in linear temporal logic.; Technical Report RT-DIA-23-97.; Presented as a poster session at IJCAI-97.

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.

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 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. Carlucci Aiello and M. Cialdea Mayer.: Invito all'Intelligenza Artificiale.; Franco Angeli, 1995.

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.: 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.

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 Grundlag. 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.

Back to Marta's Home Page