Show simple item record

dc.contributor.authorBaryannis, G
dc.contributor.authorTachmazidis, I
dc.contributor.authorBatsakis, S
dc.contributor.authorAntoniou, G
dc.contributor.authorAlviano, M
dc.contributor.authorPapadakis, E
dc.date.accessioned2021-02-09T00:42:29Z
dc.date.available2021-02-09T00:42:29Z
dc.date.issued2020
dc.identifier.issn1471-0684en_US
dc.identifier.doi10.1017/S1471068420000198en_US
dc.identifier.urihttp://hdl.handle.net/10072/401869
dc.description.abstractQualitative reasoning involves expressing and deriving knowledge based on qualitative terms such as natural language expressions, rather than strict mathematical quantities. Well over 40 qualitative calculi have been proposed so far, mostly in the spatial and temporal domains, with several practical applications such as naval traffic monitoring, warehouse process optimisation and robot manipulation. Even if a number of specialised qualitative reasoning tools have been developed so far, an important barrier to the wider adoption of these tools is that only qualitative reasoning is supported natively, when real-world problems most often require a combination of qualitative and other forms of reasoning. In this work, we propose to overcome this barrier by using ASP as a unifying formalism to tackle problems that require qualitative reasoning in addition to non-qualitative reasoning. A family of ASP encodings is proposed which can handle any qualitative calculus with binary relations. These encodings are experimentally evaluated using a real-world dataset based on a case study of determining optimal coverage of telecommunication antennas, and compared with the performance of two well-known dedicated reasoners. Experimental results show that the proposed encodings outperform one of the two reasoners, but fall behind the other, an acceptable trade-off given the added benefits of handling any type of reasoning as well as the interpretability of logic programs.en_US
dc.description.peerreviewedYesen_US
dc.languageenen_US
dc.publisherCambridge University Pressen_US
dc.relation.ispartofconferencename36th International Conference on Logic Programming (ICLP 2020)en_US
dc.relation.ispartofconferencetitleTheory and Practice of Logic Programmingen_US
dc.relation.ispartofdatefrom2020-09-20
dc.relation.ispartofdateto2020-09-25
dc.relation.ispartoflocationRende, Italyen_US
dc.relation.ispartofpagefrom687en_US
dc.relation.ispartofpageto702en_US
dc.relation.ispartofissue5en_US
dc.relation.ispartofvolume20en_US
dc.subject.fieldofresearchComputation Theory and Mathematicsen_US
dc.subject.fieldofresearchArtificial Intelligence and Image Processingen_US
dc.subject.fieldofresearchComputer Softwareen_US
dc.subject.fieldofresearchcode0802en_US
dc.subject.fieldofresearchcode0801en_US
dc.subject.fieldofresearchcode0803en_US
dc.titleA Generalised approach for encoding and reasoning with qualitative theories in answer set programmingen_US
dc.typeConference outputen_US
dc.type.descriptionE1 - Conferencesen_US
dcterms.bibliographicCitationBaryannis, G; Tachmazidis, I; Batsakis, S; Antoniou, G; Alviano, M; Papadakis, E, A Generalised approach for encoding and reasoning with qualitative theories in answer set programming, Theory and Practice of Logic Programming, 2020, 20 (5), pp. 687-702en_US
dc.date.updated2021-02-09T00:40:20Z
dc.description.versionAccepted Manuscript (AM)en_US
gro.rights.copyright© 2020 Association for Logic Programming. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version.en_US
gro.hasfulltextFull Text
gro.griffith.authorAntoniou, Grigorios


Files in this item

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record