Computing large and small stable models

DOI10.1017/S1471068402001138MaRDI QIDQ4452610zbMATH OpenOpenAlexFDO

Authors Mirosław Truszczyński

Publication date 1 March 2004

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

Full work available at URL https://doi.org/10.1017/s1471068402001138

zbMATH Keywords

fixed-parameter complexity.stable models

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Fixed-parameter complexity of semantics for logic programs
• Computing stable models: worst-case performance estimates
• scientific article; zbMATH DE number 2090538
• Extremal problems in logic programming and stable model computation
• Logic Programming

Cited in

(10)

• Polynomial-time computable stable models
• Fixed-parameter tractability of disjunction-free default reasoning
• Parameterized complexity: the main ideas and connections to practical computing
• Extremal problems in logic programming and stable model computation
• scientific article; zbMATH DE number 978242 (Why is no real title available?)
• scientific article; zbMATH DE number 2040809 (Why is no real title available?)
• scientific article; zbMATH DE number 2085278 (Why is no real title available?)
• scientific article; zbMATH DE number 2090538 (Why is no real title available?)
• Computing stable models: worst-case performance estimates
• Fixed-parameter complexity of semantics for logic programs

This page was built for publication: Computing large and small stable models

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