Computing minimal models, stable models and answer sets

DOI10.1017/S1471068405002607MaRDI QIDQ5492049zbMATH OpenOpenAlexFDO

Authors Zbigniew Lonc, Mirosław Truszczyński

Publication date 12 October 2006

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

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

zbMATH Keywords

disjunctive logic programsminimal modelsstable modelsanswer sets

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Logic Programming
• On computing minimal models
• scientific article; zbMATH DE number 2090538
• Computing stable models: worst-case performance estimates
• On the tractability of minimal model computation for some CNF theories

Cited in

(15)

• Stability, supportedness, minimality and Kleene answer set programs
• scientific article; zbMATH DE number 1884398 (Why is no real title available?)
• An incremental algorithm for generating all minimal models
• Counting independent sets in claw-free graphs
• Logic Programming
• Quo Vadis Answer Set Programming?
• A logic-based framework leveraging neural networks for studying the evolution of neurological disorders
• On the tractability of minimal model computation for some CNF theories
• Computing stable models: worst-case performance estimates
• Counting Maximal Independent Sets in Subcubic Graphs
• scientific article; zbMATH DE number 1614696 (Why is no real title available?)
• scientific article; zbMATH DE number 2090538 (Why is no real title available?)
• scientific article; zbMATH DE number 1931664 (Why is no real title available?)
• Graph-based construction of minimal models
• Computing minimal models by partial instantiation

This page was built for publication: Computing minimal models, stable models and answer sets

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