# SMT-based Constraint Answer Set Solver EZSMT+

arXiv: https://arxiv.org/abs/1905.03334 · HTML: https://mlsanity.com/paper/1905.03334/

## Key facts

- Cited by 6 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 May 2019.

## Built on by (most cited first, 6 of 6)

- [Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches](https://mlsanity.com/paper/2107.08252/) (2021)
- [An Abstract View on Optimizations in Propositional Frameworks](https://mlsanity.com/paper/2206.06440/) (2022)
- [Unit Testing in ASP Revisited: Language and Test-Driven Development Environment](https://mlsanity.com/paper/2401.02153/) (2024)
- [Unifying Framework for Optimizations in non-boolean Formalisms](https://mlsanity.com/paper/2206.07862/) (2022)
- [Automating Defeasible Reasoning in Law](https://mlsanity.com/paper/2205.07335/) (2022)
- [EZSMT Version 3, Matured](https://mlsanity.com/paper/2607.13344/) (2026)

## 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.