Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity

DOI10.1145/3447508MaRDI QIDQ5056424zbMATH OpenOpenAlexWikidataFDO

Authors Georg Gottlob, André Hernich, Clemens Kupke, Thomas Lukasiewicz

Publication date 8 December 2022

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3447508

zbMATH Keywords

answer set programmingcomplexitydecidabilitystable models

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17) Database theory (68P15) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• Complexity of the Stable Model Semantics for Queries on Incomplete Databases
• Towards efficient reasoning under guarded-based disjunctive existential rules
• On rules with existential variables: walking the decidability line
• The Complexity of Conjunctive Query Answering in Expressive Description Logics
• Fast query answering over existential rules

Cited in

(9)

• A progression semantics for first-order logic programs
• scientific article; zbMATH DE number 1696822 (Why is no real title available?)
• Towards efficient reasoning under guarded-based disjunctive existential rules
• Recent advances in Datalog^
• Complexity of the Stable Model Semantics for Queries on Incomplete Databases
• Combining decidability paradigms for existential rules
• On combining ontologies and rules
• On rules with existential variables: walking the decidability line
• Extended RDF: computability and complexity issues

Describes a project that uses

Uses Software

• MASTRO
• WASP
• clasp

This page was built for publication: Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity

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