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 article 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.
Similar content being viewed by others
References
Areces, C., P. Blackburn, and M. Marx: 2000, 'The computational complexity of hybrid temporal logics', Logic Journal of the IGPL 8(5), 653-679.
Blackburn, P.: 1993, 'Nominal tense logic', Notre Dame Journal of Formal Logic 34(1), 56-83.
Blackburn, P. and J. Seligman: 1993, 'Hybrid languages'. Journal of Logic, Language, and Information 4(3), 251-272.
Blackburn, P. and M. Tzakova: 1998, 'Hybrid completeness'. Logic Journal of the IGPL 6(4), 625-650.
Eder, E.: 1985, 'Properties of substitutions and unifications'. Journal of Symbolic Computations 1(1), 31-48.
Fagin, R., J. Halpern, Y. Moses, and M. Vardi: 1995, Reasoning about Knowledge, Cambridge: The MIT Press.
Fischer, M. J., and R. E. Ladner: 1977, 'Propositional modal logic of programs', in: Ninth Annual ACM Symposium on Theory of Computing, New York, N.Y., pp. 286-294, ACM.
Fischer, M.J., and R.E. Ladner: 1979, 'Propositional dynamic logic of regular programs', Journal of Computer and System Sciences 18(2), 194-211.
Fitting, M.: 1983, Proof methods for modal and intuitionistic logics, Vol. 169 of Synthese Library, Reidel Publ. Comp.
Fitting, M.: 1988, 'First-order modal tableaux', Journal of Automated Reasoning 4, 191-213.
Fitting, M., L. Thalmann, and A. Voronkov: 2000, 'Term-Modal Logics', in: R. Dyckhoff (ed.): Tableaux 2000, Vol. 1847 of Lecture Notes in Artificial Intelligence, Berlin Heidelberg, pp.220-236, Springer-Verlag.
Gargov, G., and V. Goranko: 1993, 'Modal logic with names'. Journal of Philosophical Logic 22(6), 607-636.
Garson, J.: 1984, 'Quantification in modal logic', in: D. Gabbay and F. Guenther (eds.): Handbook in Philosophical Logic, Vol. II, D. Reidel Publishing Company, Chapt. II.5, pp. 249-307.
Gentzen, G.: 1934, 'Untersuchungen ¨uber das logische Schließ en', Mathematical Zeitschrift 39, 176-210, 405-431. Translated as (Gentzen, 1969).
Gentzen, G.: 1969, 'Investigations into logical deduction', in: M. Szabo (ed.): The Collected Papers of Gerhard Gentzen, Amsterdam: North Holland, pp. 68-131. Originally appeared as (Gentzen, 1934).
Grove, A.: 1995, 'Naming and identity in epistemic logics. Part II: A first-order logic for naming', Artificial Intelligence 74, 311-350.
Grove, A., and J. Halpern: 1991,' Naming and identity in a multi-agent epistemic logic', in: J. Allen, R. Fikes, and E. Sandewall (eds.): KR'91. Proc. of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, Massachusets, pp. 301-312, Morgan Kaufmann.
Halpern, J.Y.: 1993, 'Reasoning about knowledge: a survey circa 1991', in: A. Kent and J.G. Williams (eds.), Encyclopedia of Computer Science and Technology, Volume 27 (Supplement 12), New York: Marcel Dekker.
Harel, D.: 1979, First-order dynamic logic, Vol. 68 of LNCS, Springer.
Hintikka, J.: 1962, Knowledge and Belief, Ithaca, New York: Cornell University Press.
Kozen, D., and J. Tiuryn: 1989, 'Logics of programs', in: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Amsterdam: North Holland.
Lenzen, W.: 1978, Recent work in epistemic logic, Vol. 30 of Acta Philosophica Fennica, Amsterdam: North-Holland.
Meyer, J.J.C., and W. Van der Hoek: 1995, Epistemic Logic for AI and Computer Science, No. 41 in Cambridge Tracts in Theoretical Computer Science, Cambridge University Press.
Passay, S., and T. Tinchev: 1991, 'An essay in combinatory dynamic logic', Information and Computation 93(2), 263-332.
Passy, S., and T. Tinchev: 1985, 'Quantifiers in combinatory PDL: completeness, definability, incompleteness', in: L. Budach (ed.): 5th International Conference on Fundamentals of Computation Theory, Vol. 199 of Lecture notes in computer science, Cottbus, GDR, pp. 512-519, Springer-Verlag.
Pratt, V.R.: 1976, 'Semantical considerations on Floyd-Hoare Logic', in: 17th Annual Symposium on Foundations of Computer Science, pp. 109-121.
Ryan, M., J. Fiadeiro, and T. Maibaum: 1991, 'Sharing actions and attributes in modal action logic', in: T. Ito and A.R. Meyer (eds.), Theoretical Aspects of Computer Software, Vol. 526 of Lecture Notes in Computer Science. pp. 569-593, Springer-Verlag.
SchÑtte, K.: 1960, Beweistheorie (in German), Springer Verlag.
Smullyan, R.: 1963, 'A unifying principle in quantification theory', in: Proc. Nat. Acad. Sci. U.S.A., Vol. 49. pp. 828-832.
Tzakova, M.: 1999, 'Tableau calculi for hybrid logics', in: N.V. Murray (ed.): Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-99), Vol. 1617 of LNAI, Berlin, pp. 278-292, Springer.
van der Hoek, W., and J.J.C. Meyer: 1997, 'A complete epistemic logic for multiple agents-Combining Distributed and Common Knowledge', in: M. Bacharach, L. Gerard-Varet, P. Mongin, and H. Shin (eds.), Epistemic Logic and the Theory of Games and Decisions, Dordrecht: Kluwer Academic Publishers, pp. 35-68.
Voronkov, A.: 1996, 'Proof search in intuitionistic logic based on constraint satisfaction', in: P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi (eds.): Theorem Proving with Analytic Tableaux and Related Methods. 5th International Workshop, TABLEAUX '96, Vol. 1071 of Lecture Notes in Artificial Intelligence, Terrasini, Palermo Italy, pp. 312-329.
Wallen, L.: 1990, Automated Deduction in Nonclassical Logics, The MIT Press.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fitting, M., Thalmann, L. & Voronkov, A. Term-Modal Logics. Studia Logica 69, 133–169 (2001). https://doi.org/10.1023/A:1013842612702
Issue Date:
DOI: https://doi.org/10.1023/A:1013842612702