On the complexity of identifying head-elementary-set-free programs

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)

zbMATH Keywords

computational complexitydisjunctive logic programelementary sethead-elementary-set-free program

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17)

Related Items (3)

On elementary loops of logic programs ⋮ On the tractability of minimal model computation for some CNF theories ⋮ Graph-based construction of minimal models

Cites Work

• Reasoning with minimal models: efficient algorithms and applications
• Propositional semantics for disjunctive logic programs
• The DLV system for knowledge representation and reasoning
• Head-Elementary-Set-Free Logic Programs

This page was built for publication: On the complexity of identifying head-elementary-set-free programs