# Answer Set Programming Made Easy

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 4 of its 35 references that are in the map.
- First posted on arXiv 11 Nov 2021.

## Builds on (most cited first, 4 of 4)

- [Multi-shot ASP solving with clingo](https://mlsanity.com/paper/1705.09811/) (2017)
- [ASP-Core-2 Input Language Format](https://mlsanity.com/paper/1911.04326/) (2019)
- [Predicate Logic as a Modelling Language: The IDP System](https://mlsanity.com/paper/1401.6312/) (2014)
- [The informal semantics of Answer Set Programming: A Tarskian perspective](https://mlsanity.com/paper/1901.09125/) (2019)

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

- [EZASP - Facilitating the Usage of ASP](https://mlsanity.com/paper/2603.26863/) (2026)

## Abstract (arXiv)

We take up an idea from the folklore of Answer Set Programming, namely that choices, integrity constraints along with a restricted rule format is sufficient for Answer Set Programming. We elaborate upon the foundations of this idea in the context of the logic of Here-and-There and show how it can be derived from the logical principle of extension by definition. We then provide an austere form of logic programs that may serve as a normalform for logic programs similar to conjunctive normalform in classical logic. Finally, we take the key ideas and propose a modeling methodology for ASP beginners and illustrate how it can be used.