scientific article; zbMATH DE number 978242

MaRDI QIDQ4332418zbMATH OpenFDO

Authors Georg Gottlob, Mirosław Truszczyński

Publication date 3 June 1997

zbMATH Keywords

complexitystable model semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• Computing large and small stable models
• Fixed-parameter complexity of semantics for logic programs
• scientific article; zbMATH DE number 2085278
• On the hardness of approximate reasoning
• Polynomial-time computable stable models

Cited in

(1)

• Extending and implementing the stable model semantics

This page was built for publication:

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