Semantics and expressive power of nondeterministic constructs in deductive databases

DOI10.1006/JCSS.1999.1699MaRDI QIDQ5943120zbMATH OpenOpenAlexFDO

Authors F. Giannotti, Dino Pedreschi, Carlo Zaniolo

Publication date 26 August 2002

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcss.1999.1699

zbMATH Keywords

Datalogfirst-order relational languages

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Datalog with non-deterministic choice computes NDB-PTIME
• Programming with non-determinism in deductive databases
• Non-determinism in databases
• Expressiveness of efficient semi-deterministic choice constructs
• Datalog extensions for database queries and updates

Cites work

• scientific article; zbMATH DE number 4180775 (Why is no real title available?)
• scientific article; zbMATH DE number 3874667 (Why is no real title available?)
• scientific article; zbMATH DE number 1368934 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Datalog with non-deterministic choice computes NDB-PTIME
• Fixed-point extensions of first-order logic
• Horn clause queries and generalizations
• Languages that Capture Complexity Classes
• Non-determinism in logic-based languages
• Procedural languages for database queries and updates
• Programming with non-determinism in deductive databases
• Reasoning about termination of pure Prolog programs
• Relational queries computable in polynomial time
• Structure and complexity of relational queries
• The expressive power of stratified logic programs
• ``Possible is certain is desirable and can be expressive

Cited in

(7)

• scientific article; zbMATH DE number 4199656 (Why is no real title available?)
• Semantics and properties of existential quantifiers in deductive databases
• scientific article; zbMATH DE number 1931656 (Why is no real title available?)
• Deductive databases for computing certain and consistent answers from mediated data integration systems
• Fixed-point Logics with Nondeterministic Choice
• The Choice Construct in the Soufflé Language
• Minimalism, justification and non-monotonicity in deductive databases

This page was built for publication: Semantics and expressive power of nondeterministic constructs in deductive databases

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