The expressive power of partial models for disjunctive deductive databases

DOI10.1007/BFB0031745MaRDI QIDQ4375822zbMATH OpenFDO

Authors Thomas Eiter, N. Leone, Domenico Saccà

Publication date 2 March 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0031745

zbMATH Keywords

disjunctive deductive databasespartial model semantics

Mathematics Subject Classification ID

Database theory (68P15) Semantics in the theory of computing (68Q55)

Recommendations

• Expressive power and complexity of partial models for disjunctive deductive databases
• On the partial semantics for disjunctive deductive databases
• scientific article; zbMATH DE number 25192
• scientific article; zbMATH DE number 5033761

Cited in

(13)

• Reasoning with minimal models: efficient algorithms and applications
• Circumscribing DATALOG: expressive power and complexity
• Expressive power and complexity of partial models for disjunctive deductive databases
• Ordered model trees: A normal form for disjunctive deductive databases
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• On the partial semantics for disjunctive deductive databases
• Indirect disjunctive belief rule base modeling using limited conjunctive rules: two possible means
• scientific article; zbMATH DE number 1884384 (Why is no real title available?)
• scientific article; zbMATH DE number 1407680 (Why is no real title available?)
• On the expressive power of the relational algebra with partially ordered domains
• scientific article; zbMATH DE number 5033761 (Why is no real title available?)
• An extension to GCWA and query evaluation for disjunctive deductive databases
• The expressive power of ``possible-is-certain semantics (extended abstract)

This page was built for publication: The expressive power of partial models for disjunctive deductive databases

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