liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
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)
Abstract [en]

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.

Series
Frontiers in Artificial Intelligence and Applications, ISSN 0922-6389 (print), 1879-8314 (online) ; 252
National Category
Computer Systems
Identifiers
urn:nbn:se:liu:diva-107347 (URN)10.3233/978-1-61499-254-7-225 (DOI)978-1-61499-253-0 (ISBN)oai:DiVA.org:liu-107347 (OAI)diva2:723550 (DiVA)
Conference
7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA 2013), 27-29 May 2013, Hue City, Vietnam
Available from2014-06-11 Created:2014-06-11 Last updated:2014-08-01Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Nguyen, Linh AnhSzalas, Andrzej
By organisation
University of Warsaw, PolandKPLAB - Knowledge Processing LabThe Institute of Technology
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 3 hits
ReferencesLink to record
Permanent link

Direct link