scientific article; zbMATH DE number 4180775
From MaRDI portal
zbMATH Open0716.68020MaRDI QIDQ3204028FDOQ3204028
Authors: Serge Abiteboul, Victor Vianu 
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
Cited In (34)
- Capturing the polynomial hierarchy by second-order revised Krom logic
- The expressive power of the bounded-iteration construct
- Infinitary logics and 0-1 laws
- Adding for-loops to first-order logic
- Canonization for two variables and puzzles on the square
- Semantics and expressive power of nondeterministic constructs in deductive databases
- Non-determinism in logic-based languages
- On the equivalence of recursive and nonrecursive Datalog programs
- Fixed-point extensions of first-order logic
- Abstract state machines and computationally complete query languages
- Infinitary logic for computer science
- Generalized hex and logical characterizations of polynomial space
- Counting modulo quantifiers on finite structures
- Reflective relational machines
- Datalog extensions for database queries and updates
- Title not available (Why is that?)
- Extending Datalog with arrays
- \(FO(FD)\): extending classical logic with rule-based fixpoint definitions
- Title not available (Why is that?)
- Comparison of expressive power of some query languages for databases
- Functions over free algebras definable in the simply typed lambda calculus
- Fundamental properties of deterministic and nondeterministic extensions of Datalog
- Implicit definability and infinitary logic in finite model theory
- A Step Up in Expressiveness of Decidable Fixpoint Logics
- Negation in rule-based database languages: A survey
- Computing on structures
- A logic of fixpoint definitions
- Principles of programming with complex objects and collection types
- Title not available (Why is that?)
- Fixpoint semantics for logic programming a survey
- Existential fixed-point logic, universal quantifiers, and topoi
- Complexity and expressive power of second-order extended Horn logic
- The expressiveness of a family of finite set languages
- Procedural languages for database queries and updates
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204028)
