Complexity of the Stable Model Semantics for Queries on Incomplete Databases

DOI10.1007/978-3-642-04238-6_11MaRDI QIDQ3643109zbMATH OpenOpenAlexFDO

Authors Jos de Bruijn, Stijn Heymans

Publication date 10 November 2009

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04238-6_11

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)

Recommendations

• Expressive power and complexity of partial models for disjunctive deductive databases
• On the completed database semantics for negation
• On the computational cost of disjunctive logic programming: Propositional case
• Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity
• The expressive powers of stable models for bound and unbound DATALOG queries

Cited in

(8)

• Certain answers over incomplete XML documents: extending tractability boundary
• scientific article; zbMATH DE number 1264546 (Why is no real title available?)
• Logical foundations and complexity of 4QL, a query language with unrestricted negation
• The expressive powers of stable models for bound and unbound DATALOG queries
• Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity
• On the complexity of queries in the logical data model
• Query languages for data exchange: beyond unions of conjunctive queries
• The expressive power of unique total stable model semantics

This page was built for publication: Complexity of the Stable Model Semantics for Queries on Incomplete Databases

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