Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming

From Tetherless World Wiki

Jump to: navigation, search

\begin{bibtex} @inproceedings{DBLP:conf/asp/EiterFFPW03, 

 author    = {Thomas Eiter and
              Wolfgang Faber and
              Michael Fink and
              Gerald Pfeifer and
              Stefan Woltran},
 title     = {Complexity of Answer Set Checking and Bounded Predicate
              Arities for Non-ground Answer Set Programming},
 booktitle = {Answer Set Programming},
 year      = {2003},
 ee        = {http://SunSITE.Informatik.RWTH-Aachen.de/Publications/CEUR-WS//Vol-78/asp03-final-eiter-compl.pdf},
 crossref  = {DBLP:conf/asp/2003},
 bibsource = {DBLP, http://dblp.uni-trier.de}

} \end{bibtex}

Retrieved from "http://tw.rpi.edu/wiki/Complexity_of_Answer_Set_Checking_and_Bounded_Predicate_Arities_for_Non-ground_Answer_Set_Programming"
Personal tools