Dual tableau for a multimodal logic for order of magnitude qualitative reasoning with bidirectional negligibility
Abstract
Abstract We present a relational proof system in the style of dual tableaux for the relational logic associated with a multimodal propositional logic for order of magnitude qualitative reasoning with a bidirectional relation of negligibility. We study soundness and completeness of the proof system and we show how it can be used for verification of validity of formulas of the logic. Keywords: relational logicsdual tableau systemsmultimodal propositional logicorder-of-magnitude qualitative reasoning 2000 AMS Subject Classifications : 03F0368T2768T1503B45 Acknowledgements We thank Prof. Ewa Orłowska for suggesting the subject of the paper and for her helpful remarks on the first version of this article. The first author of the paper is a recipient of the 2007 and 2008 Grant for Young Scientists of the Foundation for Polish Science and is partially supported by the Polish Ministry of Science and Higher Education grant N N206 399134. Both authors are partially supported by the Spanish research project TIN2006-15455-C03-01 and the second author is partially supported also by project P6-FQM-02049. Notes As usual in modal logic, we use , , ◊ N , as abbreviations of , , , and , respectively. Note that in standard models m′(<) is a strict linear ordering on U′.
Citation
Please, cite this work as:
[GM09] J. Golinska-Pilarek and E. Mu~noz-Velasco. “Dual tableau for a multimodal logic for order of magnitude qualitative reasoning with bidirectional negligibility”. In: Int. J. Comput. Math. 86.10&11 (2009), pp. 1707-1718. DOI: 10.1080/00207160902930752. URL: https://doi.org/10.1080/00207160902930752.
Bibliometric data
The following data has been extracted from resources such as OpenAlex, Dimensions, PlumX or Altmetric.
Cites
The following graph plots the number of cites received by this work from its publication, on a yearly basis.
Papers citing this work
The following is a non-exhaustive list of papers that cite this work:
[1] A. Burrieza, E. Muñoz-Velasco, and M. Ojeda-Aciego. “Closeness and Distance Relations in Order of Magnitude Qualitative Reasoning via PDL”. In: Current Topics in Artificial Intelligence. Springer Berlin Heidelberg, 2010, p. 71–80. ISBN: 9783642142642. DOI: 10.1007/978-3-642-14264-2_8. URL: http://dx.doi.org/10.1007/978-3-642-14264-2_8.
[2] A. Burrieza, E. Muñoz-Velasco, and M. Ojeda-Aciego. “Logics for Order-of-Magnitude Qualitative Reasoning: Formalizing Negligibility”. In: Ewa Orłowska on Relational Methods in Logic and Computer Science. Springer International Publishing, 2018, p. 203–231. ISBN: 9783319978796. DOI: 10.1007/978-3-319-97879-6_8. URL: http://dx.doi.org/10.1007/978-3-319-97879-6_8.
[3] J. Goli ska-Pilarek and E. Munoz-Velasco. “A hybrid qualitative approach for relative movements”. In: Logic Journal of IGPL 23.3 (Apr. 2015), p. 410–420. ISSN: 1368-9894. DOI: 10.1093/jigpal/jzv012. URL: http://dx.doi.org/10.1093/jigpal/jzv012.
[4] J. Golińska-Pilarek. “On Decidability of a Logic for Order of Magnitude Qualitative Reasoning with Bidirectional Negligibility”. In: Logics in Artificial Intelligence. Springer Berlin Heidelberg, 2012, p. 255–266. ISBN: 9783642333538. DOI: 10.1007/978-3-642-33353-8_20. URL: http://dx.doi.org/10.1007/978-3-642-33353-8_20.
[5] J. Golinska-Pilarek and E. Munoz-Velasco. “Relational approach for a logic for order of magnitude qualitative reasoning with negligibility, non-closeness and distance”. In: Logic Journal of IGPL 17.4 (Jun. 2009), p. 375–394. ISSN: 1368-9894. DOI: 10.1093/jigpal/jzp016. URL: http://dx.doi.org/10.1093/jigpal/jzp016.
[6] J. Golińska-Pilarek and E. Muñoz-Velasco. “Reasoning with Qualitative Velocity: Towards a Hybrid Approach”. In: Hybrid Artificial Intelligent Systems. Springer Berlin Heidelberg, 2012, p. 635–646. ISBN: 9783642289422. DOI: 10.1007/978-3-642-28942-2_57. URL: http://dx.doi.org/10.1007/978-3-642-28942-2_57.
[7] N. Madrid and M. Ojeda-Aciego. “On the existence and unicity of stable models in normal residuated logic programs”. In: International Journal of Computer Mathematics 89.3 (Feb. 2012), p. 310–324. ISSN: 1029-0265. DOI: 10.1080/00207160.2011.580842. URL: http://dx.doi.org/10.1080/00207160.2011.580842.
[8] A. Mora, E. Muñoz-Velasco, and J. Golińska-Pilarek. “Implementing a relational theorem prover for modal logic”. In: International Journal of Computer Mathematics 88.9 (Jun. 2011), p. 1869–1884. ISSN: 1029-0265. DOI: 10.1080/00207160.2010.493211. URL: http://dx.doi.org/10.1080/00207160.2010.493211.
