Polynomial-time computable stable models

DOI10.1007/BF02127971zbMATH Open0891.68107OpenAlexW2068677297MaRDI QIDQ1380428FDOQ1380428

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

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

zbMATH Keywords

polynomial-time computabilitystable models semantics

Mathematics Subject Classification ID

Knowledge representation (68T30)

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• 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)