Fixed-parameter complexity of semantics for logic programs

DOI10.1145/601775.601779MaRDI QIDQ5267425zbMATH OpenOpenAlexWikidataFDO

Authors Zbigniew Lonc, Mirosław Truszczyński

Publication date 13 June 2017

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/601775.601779

zbMATH Keywords

fixed-parameter complexitystable modelsnormal logic programssupported models

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2085278
• Computing large and small stable models
• scientific article; zbMATH DE number 1453052
• Fixed-parameter complexity in AI and nonmonotonic reasoning
• Complexity of computing with extended propositional logic programs

Cited in

(14)

• The computational complexity of ideal semantics
• scientific article; zbMATH DE number 2085278 (Why is no real title available?)
• Fixed-parameter complexity in AI and nonmonotonic reasoning
• Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
• Fixpoint semantics for logic programming a survey
• Utilizing treewidth for quantitative reasoning on epistemic logic programs
• A multiparametric view on answer set programming
• On the complexity of formulas in semantic programming
• scientific article; zbMATH DE number 2237358 (Why is no real title available?)
• The Logical Consequence Role in LPNMR: A Parameterized Computation Approach
• Computing large and small stable models
• The complexity of revising logic programs
• On the complexity of the partner units decision problem
• Decidability and implementation of parametrized logic programs

This page was built for publication: Fixed-parameter complexity of semantics for logic programs

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