On the complexity of identifying head-elementary-set-free programs
From MaRDI portal
Publication:3400962
DOI10.1017/S1471068409990196zbMath1186.68097MaRDI QIDQ3400962
Fabio Fassetti, Luigi Palopoli
Publication date: 28 January 2010
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
computational complexity; disjunctive logic program; elementary set; head-elementary-set-free program
Related Items
On the tractability of minimal model computation for some CNF theories, Graph-based construction of minimal models, On elementary loops of logic programs
Cites Work