Querying disjunctive databases through nonmonotonic logics
From MaRDI portal
Publication:1350535
DOI10.1016/0304-3975(95)00192-1zbMath0872.68029OpenAlexW2127005081MaRDI QIDQ1350535
Piero 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
Related Items
The complexity class θp2: Recent results and applications in AI and modal logic, Circumscribing DATALOG: expressive power and complexity, Constraints on extensions of a default theory, On the complexity of data disjunctions., More on representation theory for default logic, Evaluating the effect of semi-normality on the expressiveness of defaults
Uses Software
Cites Work
- Querying logical databases
- Semantical considerations on nonmonotonic logic
- On generating all maximal independent sets
- A logic for default reasoning
- On the representation and querying of sets of possible worlds
- Hard problems for simple default logics
- Three-valued nonmonotonic formalisms and semantics of logic programs
- The problem of incomplete information in relational databases
- Autoepistemic logic programming
- All I know: A study in autoepistemic logic
- Horn clause queries and generalizations
- Languages that Capture Complexity Classes
- The Complexity of Enumeration and Reliability Problems
- Complexity Results for Nonmonotonic Logics
- Autoepistemic logic
- Autoepistemic logics as a unifying framework for the semantics of logic programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item