Functional Stable Model Semantics in Answer Set Programming Modulo Theories
A new paper on arXiv explores the role of intensional functions in answer set programming (ASP), demonstrating how functional stable model semantics integrates with Answer Set Programming Modulo Theories (ASPMT). The authors show that tight ASPMT programs can be translated into SMT instances, paralleling the known relationship between ASP and SAT. This work unifies existing integration approaches under a single framework.
Key facts
- The paper is titled 'Functional Stable Model Semantics and Answer Set Programming Modulo Theories'.
- It is categorized under Computer Science > Artificial Intelligence.
- Intensional functions are those whose values are described by other functions and predicates.
- ASPMT is a tight integration of answer set programming and satisfiability modulo theories.
- Existing integration approaches are special cases with limited roles for functions.
- Tight ASPMT programs can be translated into SMT instances.
- The relationship mirrors that between ASP and SAT.
- The paper was submitted to arXiv with ID 2605.09524.
Entities
Institutions
- arXiv