Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
LPNMR
/
Paper
The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics.
Mario Alviano
,
Wolfgang Faber
Venue
B
LPNMR
Year
2013
Proceedings
LPNMR
DBLP record
conf/lpnmr/AlvianoF13 ↗
Browse the full
LPNMR paper archive
.