The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics. Alviano, M. & Faber, W. In Cabalar, P. & Son, T. C., editors, Logic Programming and Nonmonotonic Reasoning, 12th International Conference, LPNMR 2013, Corunna, Spain, September 15-19, 2013. Proceedings, volume 8148, of Lecture Notes in Computer Science, pages 67–72, 2013. Springer.
![The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi bibtex
Paper doi bibtex Downloads: 0
{"_id":"Ai7P7shxwWmWhKYTv","bibbaseid":"alviano-faber-thecomplexityboundaryofanswersetprogrammingwithgeneralizedatomsundertheflpsemantics-2013","author_short":["Alviano, M.","Faber, W."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Mario"],"propositions":[],"lastnames":["Alviano"],"suffixes":[]},{"firstnames":["Wolfgang"],"propositions":[],"lastnames":["Faber"],"suffixes":[]}],"editor":[{"firstnames":["Pedro"],"propositions":[],"lastnames":["Cabalar"],"suffixes":[]},{"firstnames":["Tran","Cao"],"propositions":[],"lastnames":["Son"],"suffixes":[]}],"title":"The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics","booktitle":"Logic Programming and Nonmonotonic Reasoning, 12th International Conference, LPNMR 2013, Corunna, Spain, September 15-19, 2013. Proceedings","series":"Lecture Notes in Computer Science","volume":"8148","pages":"67–72","publisher":"Springer","year":"2013","url":"https://doi.org/10.1007/978-3-642-40564-8_7","doi":"10.1007/978-3-642-40564-8_7","timestamp":"Sat, 05 Sep 2020 01:00:00 +0200","biburl":"https://dblp.org/rec/conf/lpnmr/AlvianoF13.bib","bibsource":"dblp computer science bibliography, https://dblp.org","author_short":["Alviano, M.","Faber, W."],"editor_short":["Cabalar, P.","Son, T. C."],"key":"DBLP:conf/lpnmr/AlvianoF13","id":"DBLP:conf/lpnmr/AlvianoF13","bibbaseid":"alviano-faber-thecomplexityboundaryofanswersetprogrammingwithgeneralizedatomsundertheflpsemantics-2013","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-642-40564-8_7"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/17/4975.html?view=bibtex","dataSources":["Abx4S3KE5cjtwTGfS"],"keywords":[],"search_terms":["complexity","boundary","answer","set","programming","generalized","atoms","under","flp","semantics","alviano","faber"],"title":"The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics","year":2013}