scientific article
From MaRDI portal
Publication:3204028
zbMath0716.68020MaRDI QIDQ3204028
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (25)
Generalized hex and logical characterizations of polynomial space ⋮ Non-determinism in logic-based languages ⋮ Canonization for two variables and puzzles on the square ⋮ Unnamed Item ⋮ Capturing the polynomial hierarchy by second-order revised Krom logic ⋮ Datalog extensions for database queries and updates ⋮ Computing on structures ⋮ The expressive power of the bounded-iteration construct ⋮ The expressiveness of a family of finite set languages ⋮ Principles of programming with complex objects and collection types ⋮ On the equivalence of recursive and nonrecursive Datalog programs ⋮ Implicit definability and infinitary logic in finite model theory ⋮ Infinitary logics and 0-1 laws ⋮ Complexity and expressive power of second‐order extended Horn logic ⋮ Unnamed Item ⋮ Semantics and expressive power of nondeterministic constructs in deductive databases ⋮ Comparison of expressive power of some query languages for databases ⋮ Infinitary logic for computer science ⋮ Procedural languages for database queries and updates ⋮ Negation in rule-based database languages: A survey ⋮ Fundamental properties of deterministic and nondeterministic extensions of Datalog ⋮ Reflective relational machines ⋮ Counting modulo quantifiers on finite structures ⋮ Abstract state machines and computationally complete query languages ⋮ Functions over free algebras definable in the simply typed lambda calculus
Uses Software
This page was built for publication:
