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

From Tetherless World Wiki

Jump to: navigation, search

\begin{bibtex} @inproceedings{DBLP:conf/aaai/EiterFTW05, title={Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case}, pages={695-700}, year={2005}, crossref={DBLP:conf/aaai/2005}, booktitle={AAAI}, url={http://www.informatik.uni-trier.de/~ley/db/conf/aaai/aaai2005.html#EiterFTW05}, author={Thomas Eiter and Michael Fink and Hans Tompits and Stefan Woltran} }\end{bibtex}

Retrieved from "http://tw.rpi.edu/wiki/Strong_and_Uniform_Equivalence_in_Answer-Set_Programming:_Characterizations_and_Complexity_Results_for_the_Non-Ground_Case"