Abstract
Many powerful logics exist today for reasoning about multi-agent systems, but in most of these it is hard to reason about an infinite or indeterminate number of agents. Also the naming schemes used in the logics often lack expressiveness to name agents in an intuitive way.
To obtain a more expressive language for multi-agent reasoning and a better naming scheme for agents, we introduce a family of logics called term-modal logics . A main feature of our logics is the use of modal operators indexed by the terms of the logics. Thus, one can quantify over variables occurring in modal operators . In term-modal logics agents can be represented by terms, and knowledge of agents is expressed with formulas within the scope of modal operators.
This gives us a flexible and uniform language for reasoning about the agents themselves and their knowledge. This paper gives examples of the expressiveness of the languages and provides sequent-style and tableau-based proof systems for the logics. Furthermore we give proofs of soundness and completeness with respect to the possible world semantics.
This is a preview of subscription content, log in via an institution to check access.
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
Eder, E.: Properties of substitutions and unifications. Journal of Symbolic Computations 1(1), 31–48 (1985)
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. The MIT Press, Cambridge (1995)
Fitting, M.: Proof methods for modal and intuitionistic logics. Synthese Library, vol. 169. Reidel Publ. Comp., Dordrechtz (1983)
Fitting, M.: First-order modal tableaux. Journal of Automated Reasoning 4, 191–213 (1988)
Fitting, M., Thalmann, L., Voronkov, A.: Term-modal logics. Technical Report UMCS-2000-6-4, Department of Computer Science, University of Manchester (January 2000)
Garson, J.W.: Quantification in modal logic. In: Gabbay, D., Guenther, F. (eds.) Handbook in Philosophical Logic, vol. II, ch. II.5, pp. 249–307. D. Reidel Publishing Company, Dordrechtz (1984)
Gentzen, G.: Untersuchungen über das logische Schließen. Mathematical Zeitschrift 39, 176–210, 405–431 (1934); Translated as [8]
Gentzen, G.: Investigations into logical deduction. In: Szabo, M.E. (ed.) The Collected Papers of Gerhard Gentzen, pp. 68–131. North Holland, Amsterdam (1969); Originally appeared as [7]
Grove, A.J.: Naming and identity in epistemic logics part II: A first-order logic for naming. Artificial Intelligence 74, 311–350 (1995)
Grove, A.J., Halpern, J.Y.: Naming and identity in a multi-agent epistemic logic. In: Allen, J., Fikes, R., Sandewall, E. (eds.) KR 1991. Proc. of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, Massachusets, pp. 301–312. Morgan Kaufmann, San Francisco (1991)
Hintikka, J.: Knowledge and Belief. Cornell University Press, Ithaca (1962)
Schütte, K.: Beweistheorie (in German). Springer, Heidelberg (1960)
Smullyan, R.M.: A unifying principle in quantification theory. In: Proc. Nat. Acad. Sci. U.S.A., vol. 49, pp. 828–832 (1963)
Voronkov, A.: Proof search in intuitionistic logic based on constraint satisfaction. In: Miglioli, P., Moscato, U., Mundici, D., Ornaghi, M. (eds.) TABLEAUX 1996. LNCS (LNAI), vol. 1071, pp. 312–329. Springer, Heidelberg (1996)
Wallen, L.A.: Automated Deduction in Nonclassical Logics. The MIT Press, Cambridge (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fitting, M., Thalmann, L., Voronkov, A. (2000). Term-Modal Logics. In: Dyckhoff, R. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2000. Lecture Notes in Computer Science(), vol 1847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722086_19
Download citation
DOI: https://doi.org/10.1007/10722086_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67697-3
Online ISBN: 978-3-540-45008-5
eBook Packages: Springer Book Archive