A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming

DOI10.1017/S1471068420000198MaRDI QIDQ5140008zbMATH OpenOpenAlexFDO

Authors George Baryannis, Ilias Tachmazidis, Sotiris Batsakis, Grigoris Antoniou, M. Alviano, Emmanuel N. Papadakis

Publication date 13 December 2020

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2008.01519

zbMATH Keywords

answer-set programmingqualitative calculusqualitative reasoningspatial reasoning

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Abstract: Qualitative 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. This paper is under consideration for acceptance in TPLP.

Recommendations

• Answer-set programming encodings for argumentation frameworks
• scientific article; zbMATH DE number 6536279
• Using possibilistic logic for modeling qualitative decision: answer set programming algorithms
• Improved answer-set programming encodings for abstract argumentation
• Generality Relations in Answer Set Programming
• An Introduction to Answer Set Programming and Some of Its Extensions
• Characterizing and extending answer set semantics using possibility theory
• Towards a general argumentation system based on answer-set programming

Cites work

• A trajectory calculus for qualitative spatial reasoning using answer set programming
• Answer Set Programming for Qualitative Spatio-temporal Reasoning: Methods and Experiments
• ASP-Core-2 input language format
• Decomposition and tractability in qualitative spatial and temporal reasoning
• scientific article; zbMATH DE number 1149417 (Why is no real title available?)
• Modelling and solving temporal reasoning as propositional satisfiability
• On the consistency of cardinal direction constraints
• Spatial reasoning with rectangular cardinal relations. The convex tractable subalgebra

Cited in

(4)

• Modal logic S5 in answer set programming with lazy creation of worlds
• A trajectory calculus for qualitative spatial reasoning using answer set programming
• Modal logic S5 satisfiability in answer set programming
• Answer Set Programming for Qualitative Spatio-temporal Reasoning: Methods and Experiments

Describes a project that uses

Uses Software

• Clingo

This page was built for publication: A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140008)