F. Belardinelli
ABSTRACT
We investigate quantified interpreted systems, a semantics for multiagent systems in which agents can reason about individuals, their properties, and the relationships among them. We analyse a first-order epistemic language interpreted on this semantics and show soundness and completeness of Q.S5n, an axiomatisation for these structures.
- E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, Cambridge, Massachusetts, 1999. Google Scholar
Digital Library
- P. Cohen and H. Levesque. Intention is choice with commitment. Artificial Intelligence, 42:213--261, 1990. Google ScholarDigital Library
- P. R. Cohen and H. J. Levesque. Rational interaction as the basis for communication. In P. R. Cohen, J. Morgan, and M. E. Pollack, editors, Intentions in Communication. MIT Press, Cambridge, MA, 1990.Google Scholar
- R. Fagin, J. Halpern, Y. Moses, and M. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, 1995. Google ScholarDigital Library
- P. Gammie and R. van der Meyden. Mck: Model checking the logic of knowledge. In R. Alur and D. Peled, editors, CAV, volume 3114 of Lecture Notes in Computer Science, pages 479--483. Springer, 2004.Google Scholar
- J. Garson. Quantification in modal logic. In Handbook of Philosophical Logic, volume 2, pages 249--307. D. Gabbay and F. Guenthner Eds., 1984.Google ScholarCross Ref
- I. M. Hodkinson, F. Wolter, and M. Zakharyaschev. Decidable fragment of first-order temporal logics. Ann. Pure Appl. Logic, 106(1--3):85--134, 2000.Google Scholar
- W. Hoek and M. Wooldridge. Tractable multiagent planning for epistemic goals. In M. Gini, T. Ishida, C. Castelfranchi, and W. L. Johnson, editors, Proceedings of AAMAS'02, pages 1167--1174. ACM Press, 2002. Google ScholarDigital Library
- G. E. Hughes and M. J. Cresswell. A New Introduction to Modal Logic. Routledge, New York, 1996.Google ScholarCross Ref
- A. Lomuscio and M. Colombetti. QLB: a quantified logic for belief. In J. Müller, M. Wooldridge, and N. Jennings, editors, Proceedings of ATAL-96, volume 1193 of Lecture Notes in AI. Springer-Verlag, Heidelberg, 1996. Google ScholarDigital Library
- A. Lomuscio and M. Ryan. On the relation between interpreted systems and kripke models. In Springer lecture notes in AI, volume 1441, 1997. Google ScholarDigital Library
- J.-J. C. Meyer and W. Hoek. Epistemic Logic for AI and Computer Science, volume 41 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1995. Google ScholarDigital Library
- F. Raimondi and A. Lomuscio. Automatic verification of multiagent systems by model checking via OBDDs. Journal of Applied Logic, 2005. To appear in Special issue on Logic-based agent verification.Google Scholar
- M. Wooldridge. The logical modelling of computational multiagent systems. PhD thesis, University of Manchester, Faculy of Technology, 1992.Google Scholar
- M. Wooldridge. Computationally grounded theories of agency. In E. Durfee, editor, Proceedings of ICMAS, International Conference of Multiagent Systems, pages 13--22. IEEE Press, 2000. Google ScholarDigital Library
Index Terms
- A quantified epistemic logic for reasoning about multiagent systems
Recommendations
Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic
Logical Foundations of Computer ScienceAbstractArtemov and Protopopescu proposed intuitionistic epistemic logic (IEL) to capture an intuitionistic conception of knowledge. By establishing completeness, they provided the base for a meta-theoretic investigation of IEL, which was continued by ...
Formalization of the Resolution Calculus for First-Order Logic
I present a formalization in Isabelle/HOL of the resolution calculus for first-order logic with formal soundness and completeness proofs. To prove the calculus sound, I use the substitution lemma, and to prove it complete, I use Herbrand interpretations ...
Formalized Soundness and Completeness of Epistemic Logic
Logic, Language, Information, and ComputationAbstractWe strengthen the foundations of epistemic logic by formalizing the family of normal modal logics in the proof assistant Isabelle/HOL. We define an abstract canonical model and prove a truth lemma for any logic in the family. We then instantiate ...
Comments