Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hecher, Markus, Kiesel, Rafael
Format:	Preprint
Published:	2024
Subjects:	Artificial Intelligence Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2402.03539