ICCCI 2013: Computational Collective Intelligence. Technologies and Applications pp 143-153 | Cite as
Horn-TeamLog: A Horn Fragment of TeamLog with PTime Data Complexity
Conference paper
Abstract
The logic TeamLog proposed by Dunin-Kęplicz and Verbrugge is used to express properties of agents’ cooperation in terms of individual, bilateral and collective informational and motivational attitudes like beliefs, goals and intentions. In this paper we isolate a Horn fragment of TeamLog, called Horn-TeamLog, and we show that it has PTime data complexity.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Chen, C.C., Lin, I.P.: The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics. Theoretical Computer Science 129, 95–121 (1994)MathSciNetCrossRefMATHGoogle Scholar
- 2.Dunin-Kęplicz, B., Nguyen, L.A., Szałas, A.: A framework for graded beliefs, goals and intentions. Fundamenta Informaticae 100(1-4), 53–76 (2010)MathSciNetGoogle Scholar
- 3.Dunin-Kęplicz, B., Nguyen, L.A., Szałas, A.: Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic. Int. J. Approx. Reasoning 51(3), 346–362 (2010)CrossRefGoogle Scholar
- 4.Dunin-Kęplicz, B., Nguyen, L.A., Szałas, A.: A long version of the current paper (2013), http://www.mimuw.edu.pl/~nguyen/HornTeamLog-long.pdf
- 5.Dunin-Kęplicz, B., Verbrugge, R.: Collective intentions. Fundam. Inform. 51(3), 271–295 (2002)Google Scholar
- 6.Dunin-Keplicz, B., Verbrugge, R.: Teamwork in Multi-Agent Systems: A Formal Approach. John Wiley & Sons, Ltd. (2010)Google Scholar
- 7.Dziubiński, M., Verbrugge, R., Dunin-Kęplicz, B.: Complexity issues in multiagent logics. Fundam. Inform. 75(1-4), 239–262 (2007)MATHGoogle Scholar
- 8.Fariñas del Cerro, L., Penttonen, M.: A note on the complexity of the satisfiability of modal Horn clauses. Logic Programming 4, 1–10 (1987)MathSciNetCrossRefMATHGoogle Scholar
- 9.Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press (2000)Google Scholar
- 10.Nguyen, L.A.: Constructing the least models for positive modal logic programs. Fundamenta Informaticae 42(1), 29–60 (2000)MathSciNetMATHGoogle Scholar
- 11.Nguyen, L.A.: A bottom-up method for the deterministic horn fragment of the description logic \(\mathcal{ALC}\). In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 346–358. Springer, Heidelberg (2006)CrossRefGoogle Scholar
- 12.Nguyen, L.A.: On the deterministic Horn fragment of test-free PDL. In: Hodkinson, I., Venema, Y. (eds.) Advances in Modal Logic, vol. 6, pp. 373–392. King’s College Publications (2006)Google Scholar
- 13.Nguyen, L.A.: Constructing finite least Kripke models for positive logic programs in serial regular grammar logics. Logic Journal of the IGPL 16(2), 175–193 (2008)MathSciNetCrossRefMATHGoogle Scholar
- 14.Nguyen, L.A.: Horn knowledge bases in regular description logics with PTime data complexity. Fundamenta Informaticae 104(4), 349–384 (2010)MathSciNetMATHGoogle Scholar
- 15.Nguyen, L.A., Nguyen, T.-B.-L., Szałas, A.: Horn-DL: An expressive Horn description logic with PTime data complexity. In: Faber, W. (ed.) RR 2013. LNCS, vol. 7994, pp. 259–264. Springer, Heidelberg (2013)Google Scholar
- 16.Nguyen, L.A., Szałas, A.: On the Horn fragments of serial regular grammar logics with converse. In: Proceedings of KES-AMSTA. Frontiers of Artificial Intelligence and Applications, vol. 252, pp. 225–234. IOS Press (2013)Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2013