Computing large and small stable models

DOI10.1017/S1471068402001138zbMATH Open1087.68534OpenAlexW244812768MaRDI QIDQ4452610FDOQ4452610

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

stable modelsfixed-parameter complexity.

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (3)

• Title not available (Why is that?)
• Parameterized complexity: the main ideas and connections to practical computing
• Fixed-parameter tractability of disjunction-free default reasoning

   Recommendations

• Fixed-parameter complexity of semantics for logic programs 👍 👎
• Computing stable models: worst-case performance estimates 👍 👎
• Title not available (Why is that?) 👍 👎
• Extremal problems in logic programming and stable model computation 👍 👎
• Logic Programming 👍 👎

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)