Abstract
We introduce a stepwise approach for computing symbolic diagrams. Such logical diagrams display formulas and connections between them and they are useful tools for visualizing connections between formulas as well as for reasoning about them. This incremental approach is modular: it starts from small diagrams and expands them. We explain the method and justify it. We also comment on the application of these ideas and illustrate them with some examples.
Research partly sponsored by CNPq (Brazilian National Research Council) and FAPERJ (Rio de Janeiro State Research Foundation).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Areces, C., Nivelle, H., de Rijke, M.: Resolution in Modal, Description and Hybrid Logic. J. Logic and Computation 11(5), 717–736 (2001)
Baader, F., Calvanese, D., McGuiness, D.L., Nardi, D., Pattel-Schneider, P.F.: The Description Logic Handbook: Theory, Implementations, Applications. Cambridge Univ. Press, Cambridge (2003)
Benevides, M.R.F., Delgado, C.A.D., de Freitas, R.P., Veloso, P.A.S., Veloso, S.R.M.: On Modalities for Vague Notions. In: Bazzan, A.L.C., Labidi, S. (eds.) SBIA 2004. LNCS (LNAI), vol. 3171, pp. 1–10. Springer, Heidelberg (2004)
Béziau, J.-Y.: From Consequence Operator to Universal Logic: a Survey of General Abstract Logic. In: Béziau, J.-Y. (ed.) Logica Universalis, vol. 1, pp. 3–17 (2005)
Burris, S., Sankappanavar, G.: A Course in Universal Algebra. Springer, New York (1980)
Chellas, B.: Modal Logic: an Introduction. Cambridge Univ. Press, Cambridge (1980)
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press, Cambridge (1995)
Kozen, D., Tuiryn, J.: Logics of Programs. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 789–840. Elsevier, Amsterdam (1980)
Meyer, J.J.C., van der Hoek, W.: Epistemic Logic for Computer Science and Artificial Intelligence. Cambridge Univ. Press, Cambridge (1995)
Moore, R.C.: Logic and Representation. Cambridge Univ. Press, Cambridge (1995)
Moretti, A.: Geometry for Modalities? Yes: through n-opposition Theory. In: Béziau, J.-Y., Costa-Leite, A., Facchini, A. (eds.) Aspects of Universal Logic, pp. 102–145. Univ. Neuchâtel, Neuchâtel (2004)
van Dalen, D.: Logic and Structure, 4th edn. Springer, Berlin (2004)
Pequeno, T.H.C., Veloso, P.A.S.: Do not Write more Axioms than you Have to. In: Proc. Int. Computing Symp., Taipei, pp. 487–498 (1978)
Rounds, W.C.: Feature Logics. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of Logic and Language. Elsevier, Amsterdam (1997)
Veloso, P.A.S., Carnielli, W.A.: Logics for Qualitative Reasoning. In: Gabbay, D., Rahman, S., Symons, J., van Bendegem, J.P. (eds.) Logic, Epistemology and the Unity of Science, pp. 487–526. Kluwer, Dordretch (2004)
Veloso, S.R.M., Veloso, P.A.S.: On Special Functions and Theorem Proving in Logics for Generally. In: Bittencourt, G., Ramalho, G.L. (eds.) SBIA 2002. LNCS (LNAI), vol. 2507, pp. 1–10. Springer, Heidelberg (2002)
Veloso, P.A.S., Veloso, S.R.M.: On Modulated Logics for Generally: Some Metamathematical Issues. In: Béziau, J.-Y., Costa-Leite, A., Facchini, A. (eds.) Aspects of Universal Logic, pp. 146–168. Univ. Neuchâtel, Neuchâtel (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Veloso, P.A.S., Veloso, S.R.M. (2008). Methodical Construction of Symbolic Diagrams. In: Zaverucha, G., da Costa, A.L. (eds) Advances in Artificial Intelligence - SBIA 2008. SBIA 2008. Lecture Notes in Computer Science(), vol 5249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88190-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-88190-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88189-6
Online ISBN: 978-3-540-88190-2
eBook Packages: Computer ScienceComputer Science (R0)