Computing stable models: worst-case performance estimates

DOI10.1017/S147106840300173XMaRDI QIDQ4819008zbMATH OpenOpenAlexFDO

Authors Zbigniew Lonc, Mirosław Truszczyński

Publication date 24 September 2004

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

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

zbMATH Keywords

computing stable modelslogic programsstable modelsworst-case bounds

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 2090538
• Logic Programming
• Computing minimal models, stable models and answer sets
• Extremal problems in logic programming and stable model computation
• Computing large and small stable models

Cited in

(8)

• Polynomial-time computable stable models
• scientific article; zbMATH DE number 3871152 (Why is no real title available?)
• Extremal problems in logic programming and stable model computation
• Computing large and small stable models
• Random logic programs: linear model
• scientific article; zbMATH DE number 2090538 (Why is no real title available?)
• Logic Programming
• Computing minimal models, stable models and answer sets

Describes a project that uses

Uses Software

• Smodels

This page was built for publication: Computing stable models: worst-case performance estimates

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