Polynomial-time computable stable models

DOI10.1007/BF02127971MaRDI QIDQ1380428zbMATH OpenOpenAlexFDO

Authors Luigi Palopoli, Carlo Zaniolo

Publication date 3 August 1998

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02127971

zbMATH Keywords

polynomial-time computabilitystable models semantics

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• scientific article; zbMATH DE number 2090538
• Computing stable models: worst-case performance estimates
• Computing large and small stable models
• Deterministic and non-deterministic stable models
• Fixed-parameter complexity of semantics for logic programs

Cites work

• scientific article; zbMATH DE number 3755910 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 140388 (Why is no real title available?)
• scientific article; zbMATH DE number 176244 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1398073 (Why is no real title available?)
• A logic for default reasoning
• Autoepistemic logic
• Completed logic programs and their consistency
• General logical databases and programs: Default logic semantics and stratification
• Horn clause queries and generalizations
• Propositional semantics for disjunctive logic programs
• Relational queries computable in polynomial time
• Semantical considerations on nonmonotonic logic
• Structure and complexity of relational queries
• The expressive power of stratified logic programs
• The well-founded semantics for general logic programs
• Tie-breaking semantics and structural totality

Cited in

(3)

• scientific article; zbMATH DE number 1302875 (Why is no real title available?)
• Polynomial-time versus recursive models
• On the Expressibility of Stable Logic Programming

This page was built for publication: Polynomial-time computable stable models

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