scientific article; zbMATH DE number 4180775
From MaRDI portal
Publication:3204028
Recommendations
Cited in
(37)- Procedural languages for database queries and updates
- Capturing the polynomial hierarchy by second-order revised Krom logic
- The expressive power of the bounded-iteration construct
- Implicit definability and infinitary logic in finite model theory (extended abstract)
- Infinitary logics and 0-1 laws
- Adding for-loops to first-order logic
- Canonization for two variables and puzzles on the square
- Non-determinism in logic-based languages
- On the equivalence of recursive and nonrecursive Datalog programs
- Semantics and expressive power of nondeterministic constructs in deductive databases
- Fixed-point extensions of first-order logic
- Abstract state machines and computationally complete query languages
- Generalized hex and logical characterizations of polynomial space
- Counting modulo quantifiers on finite structures
- Descriptive complexity for counting complexity classes
- Infinitary logic for computer science
- Reflective relational machines
- Datalog extensions for database queries and updates
- scientific article; zbMATH DE number 7533347 (Why is no real title available?)
- Extending Datalog with arrays
- Functions over free algebras definable in the simply typed lambda calculus
- \(FO(FD)\): extending classical logic with rule-based fixpoint definitions
- Comparison of expressive power of some query languages for databases
- scientific article; zbMATH DE number 2218053 (Why is no real title available?)
- Logical characterizations of weighted complexity classes
- Fundamental properties of deterministic and nondeterministic extensions of Datalog
- A Step Up in Expressiveness of Decidable Fixpoint Logics
- Negation in rule-based database languages: A survey
- A logic of fixpoint definitions
- Computing on structures
- Descriptive complexity and weighted Turing machines
- Principles of programming with complex objects and collection types
- Probability logic and statistical relational artificial intelligence
- Fixpoint semantics for logic programming a survey
- Existential fixed-point logic, universal quantifiers, and topoi
- The expressiveness of a family of finite set languages
- Complexity and expressive power of second-order extended Horn logic
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)
