%0 Conference Paper %1 conf/lpnmr/FinkPTW07 %A Fink, Michael %A Pichler, Reinhard %A Tompits, Hans %A Woltran, Stefan %B LPNMR %D 2007 %E Baral, Chitta %E Brewka, Gerhard %E Schlipf, John S. %I Springer %K dblp %P 123-135 %T Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. %U http://dblp.uni-trier.de/db/conf/lpnmr/lpnmr2007.html#FinkPTW07 %V 4483 %@ 978-3-540-72199-4

@inproceedings{conf/lpnmr/FinkPTW07, added-at = {2017-11-16T00:00:00.000+0100}, author = {Fink, Michael and Pichler, Reinhard and Tompits, Hans and Woltran, Stefan}, biburl = {https://www.bibsonomy.org/bibtex/2a2c08ad8bce0cd04e9246fc3603e2016/dblp}, booktitle = {LPNMR}, crossref = {conf/lpnmr/2007}, editor = {Baral, Chitta and Brewka, Gerhard and Schlipf, John S.}, ee = {https://doi.org/10.1007/978-3-540-72200-7_12}, interhash = {cad52eb422b55a16bdbfdb03c2a1392d}, intrahash = {a2c08ad8bce0cd04e9246fc3603e2016}, isbn = {978-3-540-72199-4}, keywords = {dblp}, pages = {123-135}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T13:00:16.000+0200}, title = {Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains.}, url = {http://dblp.uni-trier.de/db/conf/lpnmr/lpnmr2007.html#FinkPTW07}, volume = 4483, year = 2007 }