LiU Electronic Press
Full-text not available in DiVA
Author:
Dunin-Keplicz, Barbara (Institute of Informatics, Warsaw University)
Nguyen, Anh Linh (Institute of Informatics, Warsaw University)
Szalas, Andrzej (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Title:
Converse-PDL with Regular Inclusion Axioms: A Framework for MAS Logics
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Article in journal (Refereed)
Language:
English
Place of publ.: Cachan, France Publisher: Lavoisier
Status:
Published
In:
Journal of Applied Non-Classical Logics(ISSN 1166-3081)
Volume:
21
Issue:
1
Pages:
61-81
Year of publ.:
2011
URI:
urn:nbn:se:liu:diva-72695
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-72695
Subject category:
Computer Science
Keywords(en) :
multimodal logics, multi-agent systems, automated reasoning, tableaux
Abstract(en) :

In this paper we study automated reasoning in the modal logic CPDLreg which is a combination of CPDL (Propositional Dynamic Logic with Converse) and REGc (Regular Grammar Logic with Converse). The logic CPDL is widely used in many areas, including program verification, theory of action and change, and knowledge representation. On the other hand, the logic REGc is applicable in reasoning about epistemic states and ontologies (via Description Logics). The modal logic CPDLreg can serve as a technical foundation for reasoning about agency. Even very rich multi-agent logics can be embedded into CPDLreg via a suitable translation. Therefore, CPDLreg can serve as a test bed to implement and possibly verify new ideas without providing specific automated reasoning techniques for the logic in question. This process can to a large extent be automated. The idea of embedding various logics into CPDLreg is illustrated on a rather advanced logic TEAMLOGK designed to specify teamwork in multi-agent systems. Apart from defining informational and motivational attitudes of groups of agents, TEAMLOGK allows for grading agents' beliefs, goals and intentions. The current paper is a companion to our paper (Dunin-Kęplicz et al., 2010a). The main contribution are proofs of soundness and completeness of the tableau calculus for CPDLreg provided in (Dunin-Kęplicz et al., 2010a).

Available from:
2011-12-05
Created:
2011-12-05
Last updated:
2011-12-12
Statistics:
15 hits