Experimenting with Heuristics for Answer Set Programming
Abstract
Answer Set Programming (ASP) is a novel programming paradigm, which allows to solve problems in a simple and highly declarative way. The language of ASP (function-free disjunctive logic programming) is very expressive, and allows to represent even problems of high complexity (every problem in the complexity class 2 = NP ).
Cite
Text
Faber et al. "Experimenting with Heuristics for Answer Set Programming." International Joint Conference on Artificial Intelligence, 2001.Markdown
[Faber et al. "Experimenting with Heuristics for Answer Set Programming." International Joint Conference on Artificial Intelligence, 2001.](https://mlanthology.org/ijcai/2001/faber2001ijcai-experimenting/)BibTeX
@inproceedings{faber2001ijcai-experimenting,
title = {{Experimenting with Heuristics for Answer Set Programming}},
author = {Faber, Wolfgang and Leone, Nicola and Pfeifer, Gerald},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2001},
pages = {635-640},
url = {https://mlanthology.org/ijcai/2001/faber2001ijcai-experimenting/}
}