Answer Set Programming
Also known as ASP
Overview
Answer Set Programming represents problems as rules with defaults and exceptions, then uses stable-model semantics to find solutions that satisfy the rules and constraints. Systems typically ground programs and use solver search; weak constraints support optimization, while extensions such as ASP modulo theories and temporal ASP handle numeric and time-based problems. Applications include scheduling, trajectory planning, compliance, and visual question answering, with newer neuro-symbolic approaches combining ASP with neural models or using language models to generate rules that are checked by solvers. A central challenge is scaling grounding and search while integrating learned components without losing the clarity and reliability of declarative semantics.
Latest papers
30 papers1 paper in the last four weeks, against 1 the four weeks before. 0.0% of all new papers.
Rule-Based Languages for Neurosymbolic AI
Distilling Answer Set Programming Theories from Large Language Models
A New Well-Supported Semantics for Description Logic Programs
Bound-Founded Semantics for Answer Set Programming with Difference Constraints: Preliminary Report
Declarative Problem Solving in UAM Strategic Deconfliction
EZSMT Version 3, Matured
Answer Set Programming Energised! End-to-End Neurosymbolic Reasoning and Learning with ASP and Energy Based Models
Applying Answer Set Programming with Fuzzy Membership Functions: a Case Study
Reasonable Motion: A General ASP Foundation for Environment Constrained Movement Trajectory Computation
Accelerating NeurASP with vectorization and caching
A Four-Valued Normative Intermediate Representation for ASP-Oriented Compliance Reasoning
Distilling Answer-Set Programming Rules from LLMs for Neurosymbolic Visual Question Answering
Meta-Programming for Linear-time Temporal Answer Set Programming
2-ASP(Q) programs with weak constraints: Complexity and efficient implementation
Parametric Modular Answer Set Programs Made Declarative
Cplus2ASP: Computing Action Language C+ in Answer Set Programming
Functional Stable Model Semantics and Answer Set Programming Modulo Theories
intensional'' functions in answer set programming. Intensional functions are those whose values can be described by other functions and predicates, rather than being pre-defined as in the standard answer set programming. We demonstrate that the functional stable model semantics plays an important role in the framework of Answer Set Programming Modulo Theories (ASPMT)'' -- a tight integration of answer set programming and satisfiability modulo theories, under which existing integration approaches can be viewed as special cases where the role of functions is limited. We show that ``tight'' ASPMT programs can be translated into SMT instances, which is similar to the known relationship between ASP and SAT.