Polynomial-time computable stable models

DOI10.1007/BF02127971zbMath0891.68107OpenAlexW2068677297MaRDI QIDQ1380428

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)

Cites Work

• Tie-breaking semantics and structural totality
• The expressive power of stratified logic programs
• Semantical considerations on nonmonotonic logic
• A logic for default reasoning
• General logical databases and programs: Default logic semantics and stratification
• Structure and complexity of relational queries
• Propositional semantics for disjunctive logic programs
• Completed logic programs and their consistency
• Horn clause queries and generalizations
• Relational queries computable in polynomial time
• Autoepistemic logic
• The well-founded semantics for general logic programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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