Semantics and expressive power of nondeterministic constructs in deductive databases

DOI10.1006/jcss.1999.1699zbMath0990.68065OpenAlexW1995532290MaRDI QIDQ5943120

Carlo Zaniolo, Fosca Giannotti, Dino Pedreschi

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)

Related Items (1)

Deductive databases for computing certain and consistent answers from mediated data integration systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Procedural languages for database queries and updates
• The expressive power of stratified logic programs
• Fixed-point extensions of first-order logic
• Reasoning about termination of pure Prolog programs
• Non-determinism in logic-based languages
• Programming with non-determinism in deductive databases
• ``Possible is certain is desirable and can be expressive
• Structure and complexity of relational queries
• Horn clause queries and generalizations
• Relational queries computable in polynomial time
• Languages that Capture Complexity Classes
• Datalog with non-deterministic choice computes NDB-PTIME

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