Datalog extensions for database queries and updates

DOI10.1016/0022-0000(91)90032-ZzbMath0764.68158OpenAlexW2042690606MaRDI QIDQ1176285

Publication date: 25 June 1992

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(91)90032-z

zbMATH Keywords

datalog fixpoint semantics deterministic and non-deterministic extensions non-deterministic fixpoint extensions of first-order logic

Mathematics Subject Classification ID

Database theory (68P15) Semantics in the theory of computing (68Q55) Artificial intelligence (68T99) Logic programming (68N17)

Related Items

Highly expressive query languages for unordered data trees, Normalization of class hierarchy in databases, What Is an Algorithm?, A semantics for a class of non-deterministic and causal production system programs, Semantic Restrictions over Second-Order Logic, Modeling data-intensive reactive systems with relational transition systems, Non-determinism in logic-based languages, How to define a linear order on finite models, Finitely representable databases, A query language for NC, The complexity of the evaluation of complex algebra expressions, Complete problems for fixed-point logics, A computational model for generic graph functions, Revision programming, The Kolmogorov expressive power of Boolean query languages, About boundedness for some datalog and DATALOGneg programs, SO F : A Semantic Restriction over Second-Order Logic and Its Polynomial-Time Hierarchy, Iterating on multiple collections in synchrony, Tailoring recursion for complexity, Grounded fixpoints and their applications in knowledge representation, A query language for NC (extended abstract), Knowledge compilation of logic programs using approximation fixpoint theory, The expressive power of fixed-point logic with counting, Positive Dedalus programs tolerate non-causality, Computing on structures, An analysis of the Core-ML language: Expressive power and type reconstruction, Expressiveness of efficient semi-deterministic choice constructs, Tailoring recursion for complexity, External sources of knowledge and value invention in logic programming, Computing with infinitary logic, A semideterministic approach to object creation and nondeterminism in database queries, Tie-breaking semantics and structural totality, The descriptive complexity of decision problems through logics with relational fixed-point and capturing results, A restricted second order logic for finite structures, Metafinite model theory, Algebraic and calculus query languages for recursively typed complex objects, Database Theory, Yuri, and Me, Addendum to ``Choiceless polynomial time, Infinitary logic for computer science, Procedural languages for database queries and updates, Negation in rule-based database languages: A survey, A restricted second order logic for finite structures, Semantics and expressiveness issues in active databases, The expressive power of stratified logic programs with value invention, Verifiable properties of database transactions, Games and total Datalog\(^{\lnot}\) queries, Arity hierarchies, The Relational Polynomial-Time Hierarchy and Second-Order Logic, Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra, Adding for-loops to first-order logic, Abstract state machines and computationally complete query languages, Functional queries in datalog, Program schemes, arrays, Lindström quantifiers and zero-one laws, Querying datalog programs with temporal logic, Some thoughts on computational models: from massive human computing to abstract state machines, and beyond, Computation on structures. Behavioural theory, logic, complexity

Uses Software

Datalog

Cites Work