"On the Structural Hardness of Answer Set Programming: Can Structure ..."

Markus Hecher, Rafael Kiesel (2024)

> Home

Details and statistics

DOI: 10.1609/AAAI.V38I9.28923

access: open

type: Conference or Workshop Paper

metadata version: 2024-04-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/aaai/HecherK24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/HecherK24
Markus Hecher, Rafael Kiesel:
On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? AAAI 2024: 10535-10543

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.