Querying disjunctive databases through nonmonotonic logics

DOI10.1016/0304-3975(95)00192-1MaRDI QIDQ1350535zbMATH OpenOpenAlexFDO

Authors P. A. Bonatti, Thomas Eiter

Publication date 27 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(95)00192-1

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Expressive power and complexity of partial models for disjunctive deductive databases
• scientific article; zbMATH DE number 67490
• scientific article; zbMATH DE number 140388

Cites work

• A logic for default reasoning
• All I know: A study in autoepistemic logic
• Autoepistemic logic
• Autoepistemic logic programming
• Autoepistemic logics as a unifying framework for the semantics of logic programs
• Complexity Results for Nonmonotonic Logics
• Hard problems for simple default logics
• Horn clause queries and generalizations
• scientific article; zbMATH DE number 4199656 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 25192 (Why is no real title available?)
• scientific article; zbMATH DE number 44621 (Why is no real title available?)
• scientific article; zbMATH DE number 140392 (Why is no real title available?)
• scientific article; zbMATH DE number 176244 (Why is no real title available?)
• scientific article; zbMATH DE number 478394 (Why is no real title available?)
• scientific article; zbMATH DE number 1142327 (Why is no real title available?)
• scientific article; zbMATH DE number 1158758 (Why is no real title available?)
• scientific article; zbMATH DE number 194618 (Why is no real title available?)
• scientific article; zbMATH DE number 4185059 (Why is no real title available?)
• Languages that Capture Complexity Classes
• On generating all maximal independent sets
• On the representation and querying of sets of possible worlds
• Querying logical databases
• Semantical considerations on nonmonotonic logic
• The Complexity of Enumeration and Reliability Problems
• The problem of incomplete information in relational databases
• Three-valued nonmonotonic formalisms and semantics of logic programs

Cited in

(12)

• Circumscribing DATALOG: expressive power and complexity
• Duality for goal-driven query processing in disjunctive deductive databases
• On the complexity of data disjunctions.
• More on representation theory for default logic
• Negation and minimality in disjunctive databases
• scientific article; zbMATH DE number 4064539 (Why is no real title available?)
• scientific article; zbMATH DE number 67497 (Why is no real title available?)
• On the semantics of the unknown
• The complexity class θp2: Recent results and applications in AI and modal logic
• An extension to GCWA and query evaluation for disjunctive deductive databases
• Constraints on extensions of a default theory
• Evaluating the effect of semi-normality on the expressiveness of defaults

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: Querying disjunctive databases through nonmonotonic logics

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