Non-determinism in logic-based languages

DOI10.1007/BF01530924zbMath0875.68586OpenAlexW2063922067MaRDI QIDQ1360676

Victor Vianu, Serge Abiteboul

Publication date: 27 October 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

dataloglogic-based languagesnon-deterministic programs

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Epsilon-logic is more expressive than first-order logic over finite structures ⋮ Expressiveness of efficient semi-deterministic choice constructs ⋮ Semantics and expressive power of nondeterministic constructs in deductive databases ⋮ Unnamed Item ⋮ Semantics and Proof Theory of the Epsilon Calculus ⋮ An extension of fixpoint logic with a symmetry-based choice construct ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Procedural languages for database queries and updates
• Fundamental properties of deterministic and nondeterministic extensions of Datalog
• The expressive power of stratified logic programs
• Computable queries for relational data bases
• Datalog extensions for database queries and updates
• Structure and complexity of relational queries
• A transaction-based approach to relational database specification
• The Implication Problem for Functional and Inclusion Dependencies is Undecidable
• Relational queries computable in polynomial time
• Incomplete Information in Relational Databases
• Languages that Capture Complexity Classes

This page was built for publication: Non-determinism in logic-based languages