LiU Electronic Press
Full-text not available in DiVA
Author:
Nguyen, Linh Anh (University of Warsaw, Poland)
Szalas, Andrzej (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology) (University of Warsaw, Poland)
Title:
On the Horn Fragments of Serial Regular Grammar Logics with Converse
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Conference paper (Refereed)
Language:
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)
Editor:
Dariusz Barbucha, Manh Thanh Le, Robert J. Howlett, Lakhmi C. Jain
Conference:
7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA 2013), 27-29 May 2013, Hue City, Vietnam
Publisher: IOS Press
Series:
Frontiers in Artificial Intelligence and Applications, ISSN 0922-6389 (print), 1879-8314 (online); 252
Pages:
225-234
Year of publ.:
2013
URI:
urn:nbn:se:liu:diva-107347
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-107347
ISBN:
978-1-61499-253-0
Subject category:
Computer Systems
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.

Available from:
2014-06-11
Created:
2014-06-11
Last updated:
2014-08-01
Statistics:
3 hits