First-order stable model semantics with intensional functions
From MaRDI portal
Publication:2321299
DOI10.1016/j.artint.2019.01.001zbMath1478.68341OpenAlexW2912103526MaRDI QIDQ2321299
Joohyung Lee, Michael Bartholomew
Publication date: 28 August 2019
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2019.01.001
Related Items
ASP (): Answer Set Programming with Algebraic Constraints ⋮ Testing in ASP: revisited language and programming environment
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stable models and circumscription
- Nonmonotonic causal theories
- Ordered completion for logic programs with aggregates
- Integrating answer set programming and constraint logic programming
- On the logic of causal explanation
- Addendum: Circumscription and other non-monotonic formalisms
- Cplus 2ASP: Computing Action Language ${\cal C}$ + in Answer Set Programming
- A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions
- System aspmt2smt: Computing ASPMT Theories by SMT Solvers
- Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
- Functional answer set programming
- ASPMT(QS): Non-Monotonic Spatial Reasoning with Answer Set Programming Modulo Theories
- Thirteen Definitions of a Stable Model
- Functional completion
- Representing hybrid automata by action language modulo theories
- On relation between constraint answer set programming and satisfiability modulo theories
- Constraint Answer Set Solving
- dReal: An SMT Solver for Nonlinear Theories over the Reals
- On the stable model semantics for intensional functions
- Strongly equivalent logic programs
