Hostname: page-component-77c78cf97d-lphnv Total loading time: 0 Render date: 2026-04-26T13:26:59.574Z Has data issue: false hasContentIssue false

Non-monotonic spatial reasoning with answer set programming modulo theories*

Published online by Cambridge University Press:  30 August 2016

PRZEMYSŁAW ANDRZEJ WAŁĘGA
Affiliation:
Spatial Reasoning (www.spatial-reasoning.com) The DesignSpace Group, Germany (www.design-space.org) University of Warsaw, Warsaw, Poland University of Münster, Münster, Germany University of Bremen, Bremen, Germany (e-mail: p.a.walega@gmail.com, schultzc@uni-muenster.de, bhatt@uni-bremen.de)
CARL SCHULTZ
Affiliation:
Spatial Reasoning (www.spatial-reasoning.com) The DesignSpace Group, Germany (www.design-space.org) University of Warsaw, Warsaw, Poland University of Münster, Münster, Germany University of Bremen, Bremen, Germany (e-mail: p.a.walega@gmail.com, schultzc@uni-muenster.de, bhatt@uni-bremen.de)
MEHUL BHATT
Affiliation:
Spatial Reasoning (www.spatial-reasoning.com) The DesignSpace Group, Germany (www.design-space.org) University of Warsaw, Warsaw, Poland University of Münster, Münster, Germany University of Bremen, Bremen, Germany (e-mail: p.a.walega@gmail.com, schultzc@uni-muenster.de, bhatt@uni-bremen.de)

Abstract

The systematic modelling of dynamic spatial systems is a key requirement in a wide range of application areas such as commonsense cognitive robotics, computer-aided architecture design, and dynamic geographic information systems. We present Answer Set Programming Modulo Theories (ASPMT)(QS), a novel approach and fully implemented prototype for non-monotonic spatial reasoning — a crucial requirement within dynamic spatial systems — based on ASPMT. ASPMT(QS) consists of a (qualitative) spatial representation module (QS) and a method for turning tight ASPMT instances into Satisfiability Modulo Theories (SMT) instances in order to compute stable models by means of SMT solvers. We formalise and implement concepts of default spatial reasoning and spatial frame axioms. Spatial reasoning is performed by encoding spatial relations as systems of polynomial constraints, and solving via SMT with the theory of real non-linear arithmetic. We empirically evaluate ASPMT(QS) in comparison with other contemporary spatial reasoning systems both within and outside the context of logic programming. ASPMT(QS) is currently the only existing system that is capable of reasoning about indirect spatial effects (i.e., addressing the ramification problem), and integrating geometric and QS information within a non-monotonic spatial reasoning context.

Information

Type
Regular Papers
Copyright
Copyright © Cambridge University Press 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Supplementary material: PDF

Wałęga et al. supplementary material

Online Appendix

Download Wałęga et al. supplementary material(PDF)
PDF 3.2 MB