Horn-TeamLog: A Horn Fragment of TeamLog with PTime Data Complexity

* Final gross prices may vary according to local VAT.

Get Access

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.