Answer Set Programming Modulo Theories and Reasoning about Continuous Changes

Joohyung Lee, Yunsong Meng
7/6/2025
cs.AI

No confident code implementation found for this paper.

Abstract

Answer Set Programming Modulo Theories (ASPMT) is a new framework of tight integration of answer set programming (ASP) and satisfiability modulo theories (SMT). Similar to the relationship between first-order logic and SMT, it is based on a recent proposal of the functional stable model semantics by fixing interpretations of background theories. Analogously to a known relationship between ASP and SAT, ``tight'' ASPMT programs can be translated into SMT instances. We demonstrate the usefulness of ASPMT by enhancing action language C+ to handle continuous changes as well as discrete changes. We reformulate the semantics of C+ in terms ofASPMT, and show that SMT solvers can be used to compute the language. We also show how the language can represent cumulative effects on continuous resources.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lee2025answer,
  title  = {Answer Set Programming Modulo Theories and Reasoning about Continuous Changes},
  author = {Joohyung Lee and Yunsong Meng},
  year   = {2025},
  eprint = {2507.04299},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.04299v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.04299.svg)](https://codeofpaper.com/paper/2507.04299)

Discussion