SMT-based Constraint Answer Set Solver EZSMT+
Not on the map. Why?
Abstract (arXiv)
Constraint answer set programming integrates answer set programming with constraint processing. System EZSMT+ is a constraint answer set programming tool that utilizes satisfiability modulo theory solvers for search. Its theoretical foundation lies on generalizations of Niemela's characterization of answer sets of a logic program via so called level rankings.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 8 May 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 0; 2024: 1; 2025: 0; 2026: 1.
6 papers.
- 2021Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approachescited by 7
- 2022An Abstract View on Optimizations in Propositional Frameworkscited by 3
- 2024Unit Testing in ASP Revisited: Language and Test-Driven Development Environmentcited by 2
- 2022Unifying Framework for Optimizations in non-boolean Formalismscited by 1
- 2022Automating Defeasible Reasoning in Lawcited by 0
- 2026EZSMT Version 3, Maturedcited by 0
- 2026EZSMT Version 3, Matured15 Jul 2026
- 2024Unit Testing in ASP Revisited: Language and Test-Driven Development Environment4 Jan 2024
- 2022Unifying Framework for Optimizations in non-boolean Formalisms16 Jun 2022
- 2022An Abstract View on Optimizations in Propositional Frameworks13 Jun 2022
- 2022Automating Defeasible Reasoning in Law15 May 2022
- 2021Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches17 Jul 2021