Fixed-parameter complexity of semantics for logic programs

DOI10.1145/601775.601779zbMATH Open1365.68150OpenAlexW2123481932WikidataQ130980219 ScholiaQ130980219MaRDI QIDQ5267425FDOQ5267425

Mirosław Truszczyński, Zbigniew Lonc

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

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

zbMATH Keywords

fixed-parameter complexitystable modelsnormal logic programssupported models

Mathematics Subject Classification ID

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

Cited In (11)

• Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
• On the complexity of formulas in semantic programming
• The computational complexity of ideal semantics
• Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
• A multiparametric view on answer set programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of revising logic programs
• Computing large and small stable models
• Fixed-parameter complexity in AI and nonmonotonic reasoning
• Fixpoint semantics for logic programming a survey

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)