ML Anthology

Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case

Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
AAAI 2005 pp. 695-700
/aaai/2005/eiter2005aaai-strong/
PDF AAAI Semantic Scholar

Cite

Text

Eiter et al. "Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case." AAAI Conference on Artificial Intelligence, 2005.

Markdown

[Eiter et al. "Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case." AAAI Conference on Artificial Intelligence, 2005.](https://mlanthology.org/aaai/2005/eiter2005aaai-strong/)

BibTeX

@inproceedings{eiter2005aaai-strong,
  title     = {{Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case}},
  author    = {Eiter, Thomas and Fink, Michael and Tompits, Hans and Woltran, Stefan},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2005},
  pages     = {695-700},
  url       = {https://mlanthology.org/aaai/2005/eiter2005aaai-strong/}
}