On Composing Finite Forests with Modal Logics.
Bednarczyk, B.; Demri, S.; Fervari, R.; and Mansutti, A.
ACM Trans. Comput. Log., 24(2): 12:1–12:46. 2023.
Paper
doi
link
bibtex
@article{DBLP:journals/tocl/BednarczykDFM23,
author = {Bartosz Bednarczyk and
St{\'{e}}phane Demri and
Raul Fervari and
Alessio Mansutti},
title = {On Composing Finite Forests with Modal Logics},
journal = {{ACM} Trans. Comput. Log.},
volume = {24},
number = {2},
pages = {12:1--12:46},
year = {2023},
url = {https://doi.org/10.1145/3569954},
doi = {10.1145/3569954},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/BednarczykDFM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Model-Checking for Ability-Based Logics with Constrained Plans.
Demri, S.; and Fervari, R.
In Williams, B.; Chen, Y.; and Neville, J., editor(s),
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023, pages 6305–6312, 2023. AAAI Press
Paper
doi
link
bibtex
@inproceedings{DBLP:conf/aaai/DemriF23,
author = {St{\'{e}}phane Demri and
Raul Fervari},
editor = {Brian Williams and
Yiling Chen and
Jennifer Neville},
title = {Model-Checking for Ability-Based Logics with Constrained Plans},
booktitle = {Thirty-Seventh {AAAI} Conference on Artificial Intelligence, {AAAI}
2023, Thirty-Fifth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2023, Thirteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2023, Washington, DC, USA, February
7-14, 2023},
pages = {6305--6312},
publisher = {{AAAI} Press},
year = {2023},
url = {https://doi.org/10.1609/aaai.v37i5.25776},
doi = {10.1609/AAAI.V37I5.25776},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/DemriF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
A Deontic Logic of Knowingly Complying.
Areces, C.; Cassano, V.; Castro, P. F.; Fervari, R.; and Saravia, A. R.
In Agmon, N.; An, B.; Ricci, A.; and Yeoh, W., editor(s),
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2023, London, United Kingdom, 29 May 2023 - 2 June 2023, pages 364–372, 2023. ACM
Paper
doi
link
bibtex
@inproceedings{DBLP:conf/atal/ArecesCCFS23,
author = {Carlos Areces and
Valentin Cassano and
Pablo F. Castro and
Raul Fervari and
Andr{\'{e}}s R. Saravia},
editor = {Noa Agmon and
Bo An and
Alessandro Ricci and
William Yeoh},
title = {A Deontic Logic of Knowingly Complying},
booktitle = {Proceedings of the 2023 International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS} 2023, London, United Kingdom, 29 May
2023 - 2 June 2023},
pages = {364--372},
publisher = {{ACM}},
year = {2023},
url = {https://dl.acm.org/doi/10.5555/3545946.3598659},
doi = {10.5555/3545946.3598659},
timestamp = {Tue, 23 May 2023 14:27:14 +0200},
biburl = {https://dblp.org/rec/conf/atal/ArecesCCFS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
How Easy it is to Know How: An Upper Bound for the Satisfiability Problem.
Areces, C.; Cassano, V.; Castro, P. F.; Fervari, R.; and Saravia, A. R.
In Gaggl, S. A.; Martinez, M. V.; and Ortiz, M., editor(s),
Logics in Artificial Intelligence - 18th European Conference, JELIA 2023, Dresden, Germany, September 20-22, 2023, Proceedings, volume 14281, of
Lecture Notes in Computer Science, pages 405–419, 2023. Springer
Paper
doi
link
bibtex
@inproceedings{DBLP:conf/jelia/ArecesCCFS23,
author = {Carlos Areces and
Valentin Cassano and
Pablo F. Castro and
Raul Fervari and
Andr{\'{e}}s R. Saravia},
editor = {Sarah Alice Gaggl and
Maria Vanina Martinez and
Magdalena Ortiz},
title = {How Easy it is to Know How: An Upper Bound for the Satisfiability
Problem},
booktitle = {Logics in Artificial Intelligence - 18th European Conference, {JELIA}
2023, Dresden, Germany, September 20-22, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14281},
pages = {405--419},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43619-2\_28},
doi = {10.1007/978-3-031-43619-2\_28},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/jelia/ArecesCCFS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
DefTab : A Tableaux System for Sceptical Consequence in Default Modal Logics.
Areces, C.; Cassano, V.; Fervari, R.; and Hoffmann, G.
In Ramanayake, R.; and Urban, J., editor(s),
Automated Reasoning with Analytic Tableaux and Related Methods - 32nd International Conference, TABLEAUX 2023, Prague, Czech Republic, September 18-21, 2023, Proceedings, volume 14278, of
Lecture Notes in Computer Science, pages 37–48, 2023. Springer
Paper
doi
link
bibtex
@inproceedings{DBLP:conf/tableaux/ArecesCFH23,
author = {Carlos Areces and
Valentin Cassano and
Raul Fervari and
Guillaume Hoffmann},
editor = {Revantha Ramanayake and
Josef Urban},
title = {DefTab : {A} Tableaux System for Sceptical Consequence in Default
Modal Logics},
booktitle = {Automated Reasoning with Analytic Tableaux and Related Methods - 32nd
International Conference, {TABLEAUX} 2023, Prague, Czech Republic,
September 18-21, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14278},
pages = {37--48},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43513-3\_3},
doi = {10.1007/978-3-031-43513-3\_3},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tableaux/ArecesCFH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Uncertainty-Based Knowing How Logic.
Areces, C.; Fervari, R.; Saravia, A. R.; and Velázquez-Quesada, F. R.
CoRR, abs/2304.01022. 2023.
Paper
doi
link
bibtex
@article{DBLP:journals/corr/abs-2304-01022,
author = {Carlos Areces and
Raul Fervari and
Andr{\'{e}}s R. Saravia and
Fernando R. Vel{\'{a}}zquez{-}Quesada},
title = {Uncertainty-Based Knowing How Logic},
journal = {CoRR},
volume = {abs/2304.01022},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.01022},
doi = {10.48550/ARXIV.2304.01022},
eprinttype = {arXiv},
eprint = {2304.01022},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-01022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
How Easy it is to Know How: An Upper Bound for the Satisfiability Problem.
Areces, C.; Cassano, V.; Fervari, R.; Castro, P. F.; and Saravia, A. R.
CoRR, abs/2309.17094. 2023.
Paper
doi
link
bibtex
@article{DBLP:journals/corr/abs-2309-17094,
author = {Carlos Areces and
Valentin Cassano and
Raul Fervari and
Pablo F. Castro and
Andr{\'{e}}s R. Saravia},
title = {How Easy it is to Know How: An Upper Bound for the Satisfiability
Problem},
journal = {CoRR},
volume = {abs/2309.17094},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.17094},
doi = {10.48550/ARXIV.2309.17094},
eprinttype = {arXiv},
eprint = {2309.17094},
timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-17094.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}