×

zbMATH — the first resource for mathematics

Cerrito, Serenella

Compute Distance To:
Author ID: cerrito.serenella Recent zbMATH articles by "Cerrito, Serenella"
Published as: Cerrito, S.; Cerrito, Serenella
Documents Indexed: 24 Publications since 1992, including 1 Book

Publications by Year

Citations contained in zbMATH Open

18 Publications have been cited 47 times in 40 Documents Cited by Year
First order linear temporal logic over finite time structures. Zbl 0939.03022
Cerrito, Serenella; Cialdea Mayer, Marta; Praud, Sébastien
8
1999
A first step towards modeling semistructured data in hybrid multimodal logic. Zbl 1185.68290
Bidoit, Nicole; Cerrito, Serenella; Thion, Virginie
6
2004
Pattern matching as cut elimination. Zbl 1078.68135
Cerrito, Serenella; Kesner, Delia
5
2004
Nominal substitution at work with the global and converse modalities. Zbl 1254.03030
Cerrito, Serenella; Cialdea Mayer, Marta
4
2010
Optimal tableaux-based decision procedure for testing satisfiability in the alternating-time temporal logic \(\mathrm{ATL}^+\). Zbl 1423.68410
Cerrito, Serenella; David, Amélie; Goranko, Valentin
3
2014
A tableaux based decision procedure for a broad class of hybrid formulae with binders. Zbl 1331.68200
Cerrito, Serenella; Cialdea Mayer, Marta
3
2011
Using linear temporal logic to model and solve planning problems. Zbl 0927.03049
Cerrito, Serenella; Cialdea Mayer, Marta
3
1998
A tableau based decision procedure for an expressive fragment of hybrid logic with binders, converse and global modalities. Zbl 1314.03018
Cerrito, Serenella; Mayer, Marta Cialdea
2
2013
An efficient approach to nominal equalities in hybrid logic tableaux. Zbl 1242.03029
Cerrito, Serenella; Mayer, Marta Cialdea
2
2010
Bounded model search in linear temporal logic and its application to planning. Zbl 0903.03016
Cerrito, Serenella; Cialdea Mayer, Marta
2
1998
A linear axiomatization of negation as failure. Zbl 0754.68025
Cerrito, Serenella
2
1992
Optimal tableau method for constructive satisfiability testing and model synthesis in the alternating-time temporal logic \(\mathrm{ATL}^+\). Zbl 1367.68246
Cerrito, Serenella; David, Amélie; Goranko, Valentin
1
2015
Herod and Pilate: two tableau provers for basic hybrid logic. Zbl 1291.68333
Cialdea Mayer, Marta; Cerrito, Serenella
1
2010
A general theorem prover for quantified modal logics. Zbl 1016.68106
Thion, V.; Cerrito, S.; Cialdea Mayer, Marta
1
2002
Free-variable tableaux for constant-domain quantified modal logics with rigid and non-rigid designation. Zbl 0988.03032
Cerrito, Serenella; Cialdea Mayer, Marta
1
2001
Labelled tableaux for propositional linear time logic over finite frames. Zbl 0966.03018
Cerrito, Serenella; Cialdea Mayer, Marta
1
2000
Hintikka multiplicities in matrix decision methods for some propositional modal logics. Zbl 1415.03035
Cerrito, Serenella; Cialdea Mayer, Marta
1
1997
A polynomial translation of \(\text{S}4\) into \(\text{T}\) and contraction-free tableaux for \(\text{S}4\). Zbl 0869.03011
Cerrito, Serenella; Cialdea Mayer, Marta
1
1997
Optimal tableau method for constructive satisfiability testing and model synthesis in the alternating-time temporal logic \(\mathrm{ATL}^+\). Zbl 1367.68246
Cerrito, Serenella; David, Amélie; Goranko, Valentin
1
2015
Optimal tableaux-based decision procedure for testing satisfiability in the alternating-time temporal logic \(\mathrm{ATL}^+\). Zbl 1423.68410
Cerrito, Serenella; David, Amélie; Goranko, Valentin
3
2014
A tableau based decision procedure for an expressive fragment of hybrid logic with binders, converse and global modalities. Zbl 1314.03018
Cerrito, Serenella; Mayer, Marta Cialdea
2
2013
A tableaux based decision procedure for a broad class of hybrid formulae with binders. Zbl 1331.68200
Cerrito, Serenella; Cialdea Mayer, Marta
3
2011
Nominal substitution at work with the global and converse modalities. Zbl 1254.03030
Cerrito, Serenella; Cialdea Mayer, Marta
4
2010
An efficient approach to nominal equalities in hybrid logic tableaux. Zbl 1242.03029
Cerrito, Serenella; Mayer, Marta Cialdea
2
2010
Herod and Pilate: two tableau provers for basic hybrid logic. Zbl 1291.68333
Cialdea Mayer, Marta; Cerrito, Serenella
1
2010
A first step towards modeling semistructured data in hybrid multimodal logic. Zbl 1185.68290
Bidoit, Nicole; Cerrito, Serenella; Thion, Virginie
6
2004
Pattern matching as cut elimination. Zbl 1078.68135
Cerrito, Serenella; Kesner, Delia
5
2004
A general theorem prover for quantified modal logics. Zbl 1016.68106
Thion, V.; Cerrito, S.; Cialdea Mayer, Marta
1
2002
Free-variable tableaux for constant-domain quantified modal logics with rigid and non-rigid designation. Zbl 0988.03032
Cerrito, Serenella; Cialdea Mayer, Marta
1
2001
Labelled tableaux for propositional linear time logic over finite frames. Zbl 0966.03018
Cerrito, Serenella; Cialdea Mayer, Marta
1
2000
First order linear temporal logic over finite time structures. Zbl 0939.03022
Cerrito, Serenella; Cialdea Mayer, Marta; Praud, Sébastien
8
1999
Using linear temporal logic to model and solve planning problems. Zbl 0927.03049
Cerrito, Serenella; Cialdea Mayer, Marta
3
1998
Bounded model search in linear temporal logic and its application to planning. Zbl 0903.03016
Cerrito, Serenella; Cialdea Mayer, Marta
2
1998
Hintikka multiplicities in matrix decision methods for some propositional modal logics. Zbl 1415.03035
Cerrito, Serenella; Cialdea Mayer, Marta
1
1997
A polynomial translation of \(\text{S}4\) into \(\text{T}\) and contraction-free tableaux for \(\text{S}4\). Zbl 0869.03011
Cerrito, Serenella; Cialdea Mayer, Marta
1
1997
A linear axiomatization of negation as failure. Zbl 0754.68025
Cerrito, Serenella
2
1992

Citations by Year