ASPMT(QS): Non-Monotonic Spatial Reasoning with Answer Set Programming Modulo Theories
From MaRDI portal
Publication:3449232
DOI10.1007/978-3-319-23264-5_41zbMATH Open1470.68219arXiv1506.04929OpenAlexW2194834917WikidataQ62623659 ScholiaQ62623659MaRDI QIDQ3449232FDOQ3449232
Mehul Bhatt, Carl R. Schultz, Przemysลaw Andrzej Waลฤga
Publication date: 4 November 2015
Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)
Abstract: The systematic modelling of emph{dynamic spatial systems} [9] is a key requirement in a wide range of application areas such as comonsense cognitive robotics, computer-aided architecture design, dynamic geographic information systems. We present ASPMT(QS), a novel approach and fully-implemented prototype for non-monotonic spatial reasoning ---a crucial requirement within dynamic spatial systems-- based on Answer Set Programming Modulo Theories (ASPMT). ASPMT(QS) consists of a (qualitative) spatial representation module (QS) and a method for turning tight ASPMT instances into Sat 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 using choice formulas. Spatial reasoning is performed by encoding spatial relations as systems of polynomial constraints, and solving via SMT with the theory of real nonlinear arithmetic. We empirically evaluate ASPMT(QS) in comparison with other prominent contemporary spatial reasoning systems. Our results show that ASPMT(QS) is the only existing system that is capable of reasoning about indirect spatial effects (i.e. addressing the ramification problem), and integrating geometric and qualitative spatial information within a non-monotonic spatial reasoning context.
Full work available at URL: https://arxiv.org/abs/1506.04929
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- System aspmt2smt: Computing ASPMT Theories by SMT Solvers
- Multi-shot ASP solving with clingo
- Maintaining knowledge about temporal intervals
- Logic Programming and Nonmonotonic Reasoning
- Stable models and circumscription
- Parts, wholes, and part-whole relations: The prospects of mereotopology
- Reasoning about solids using constraint logic programming
- An application of CLP: Checking the correctness of theorems in geometry
Cited In (5)
- Non-monotonic spatial reasoning with answer set programming modulo theories
- Answer Set Programming for Qualitative Spatio-temporal Reasoning: Methods and Experiments
- Title not available (Why is that?)
- Qualitative reasoning about 2D cardinal directions using answer set programming
- First-order stable model semantics with intensional functions
Recommendations
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- A modal and relevance logic for qualitative spatial reasoning ๐ ๐
- Non-monotonic spatial reasoning with answer set programming modulo theories ๐ ๐
- Answer Set Programming for Qualitative Spatio-temporal Reasoning: Methods and Experiments ๐ ๐
- A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming ๐ ๐
- ASP (): Answer Set Programming with Algebraic Constraints ๐ ๐
This page was built for publication: ASPMT(QS): Non-Monotonic Spatial Reasoning with Answer Set Programming Modulo Theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449232)