On the Horn Fragments of Serial Regular Grammar Logics with Converse
2013 (English)In: Advanced Methods and Technologies for Agent and Multi-Agent Systems: Proceedings of the 7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA 2013) / [ed] Dariusz Barbucha, Manh Thanh Le, Robert J. Howlett, Lakhmi C. Jain, IOS Press, 2013, 225-234Conference paper (Refereed)
We study Horn fragments of serial multimodal logics which are characterized by regular grammars with converse. Such logics are useful for reasoning about epistemic states of multiagent systems as well as similarity-based approximate reasoning. We provide the first algorithm with PTIME data complexity for checking satisfiability of a Horn knowledge base in a serial regular grammar logic with converse.
Frontiers in Artificial Intelligence and Applications, ISSN 0922-6389 (print), 1879-8314 (online) ; 252
National CategoryComputer Systems
IdentifiersURN: urn:nbn:se:liu:diva-107347DOI: 10.3233/978-1-61499-254-7-225ISBN: 978-1-61499-253-0OAI: oai:DiVA.org:liu-107347DiVA: diva2:723550
7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA 2013), 27-29 May 2013, Hue City, Vietnam