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

DOI10.1017/S1471068409990196zbMATH Open1186.68097MaRDI QIDQ3400962FDOQ3400962

Authors: Fabio Fassetti, Luigi Palopoli 

Publication date: 28 January 2010

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Recommendations

• Head-Elementary-Set-Free Logic Programs
• Logic Programming
• Head boundedness of nonterminating rewritings
• On P Versus NP for Parameter-Free Programs Over Algebraic Structures
• scientific article; zbMATH DE number 1408348
• ON THE COMPUTING POWER OF PROGRAMS WITH SETS
• scientific article; zbMATH DE number 845472
• On the combinatorial and algebraic complexity of quantifier elimination
• An implicit characterization of the polynomial-time decidable sets by cons-free rewriting
• scientific article; zbMATH DE number 4012568

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)

Cites Work

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

Cited In (4)

• On elementary loops of logic programs
• Head-Elementary-Set-Free Logic Programs
• On the tractability of minimal model computation for some CNF theories
• Graph-based construction of minimal models

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400962)