Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
AAAI
/
Paper
On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
Markus Hecher
,
Rafael Kiesel
Venue
A*
AAAI
Year
2024
Proceedings
AAAI
DBLP record
conf/aaai/HecherK24 ↗
Browse the full
AAAI paper archive
.