Datalog extensions for database queries and updates
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4180775 (Why is no real title available?)
- scientific article; zbMATH DE number 4199654 (Why is no real title available?)
- scientific article; zbMATH DE number 4147465 (Why is no real title available?)
- scientific article; zbMATH DE number 4162254 (Why is no real title available?)
- scientific article; zbMATH DE number 4022671 (Why is no real title available?)
- scientific article; zbMATH DE number 4035805 (Why is no real title available?)
- scientific article; zbMATH DE number 1142320 (Why is no real title available?)
- scientific article; zbMATH DE number 1142327 (Why is no real title available?)
- A relational model of data for large shared data banks
- Computable queries for relational data bases
- Fundamental properties of deterministic and nondeterministic extensions of Datalog
- Horn clause queries and generalizations
- Inductive definitions over finite structures
- Languages that Capture Complexity Classes
- Monadic generalized spectra
- On folk theorems
- Procedural languages for database queries and updates
- Relational queries computable in polynomial time
- Relationships between nondeterministic and deterministic tape complexities
- Relative Information Capacity of Simple Relational Database Schemata
- Structure and complexity of relational queries
- The expressive power of stratified logic programs
- Why not negation by fixpoint?
Cited in
(86)- External sources of knowledge and value invention in logic programming
- Highly expressive query languages for unordered data trees
- Negation in rule-based database languages: A survey
- Datafun: a functional Datalog
- Hypothetical datalog: Complexity and expressibility
- The expressive power of higher-order Datalog
- Functional queries in datalog
- Infinitary logic for computer science
- The Kolmogorov expressive power of Boolean query languages
- Computation on structures. Behavioural theory, logic, complexity
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
- Querying datalog programs with temporal logic
- Semantics and expressive power of nondeterministic constructs in deductive databases
- A query language for NC
- The complexity of the evaluation of complex algebra expressions
- scientific article; zbMATH DE number 4064536 (Why is no real title available?)
- Arity hierarchies
- Finitely representable databases
- Fundamental properties of deterministic and nondeterministic extensions of Datalog
- How an agent might think
- How to define a linear order on finite models
- What is an algorithm?
- Tailoring recursion for complexity
- Tailoring recursion for complexity
- Datalog queries distributing over components
- Computing with infinitary logic
- A semideterministic approach to object creation and nondeterminism in database queries
- Tie-breaking semantics and structural totality
- A declarative extension of horn clauses, and its significance for Datalog and its applications
- On datalog vs polynomial time
- Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra
- Knowledge compilation of logic programs using approximation fixpoint theory
- The expressiveness of DAC
- Algebraic and calculus query languages for recursively typed complex objects
- Program schemes, arrays, Lindström quantifiers and zero-one laws
- scientific article; zbMATH DE number 4180775 (Why is no real title available?)
- Datalog and recursive query processing
- Complete problems for fixed-point logics
- Revision programming
- A restricted second order logic for finite structures
- Adding for-loops to first-order logic
- Abstract state machines and computationally complete query languages
- The expressive power of fixed-point logic with counting
- On the expressive power of Datalog: tools and a case study.
- The expressive power of stratified logic programs with value invention
- Modeling data-intensive reactive systems with relational transition systems
- Normalization of class hierarchy in databases
- Role of determinism in query languages for data bases
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results
- Non-determinism in logic-based languages
- Positive Dedalus programs tolerate non-causality
- Computing on structures
- Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints
- Games and total Datalog\(^{\lnot}\) queries
- Expressiveness of efficient semi-deterministic choice constructs
- Updating intensional predicates in Datalog
- A query language for NC (extended abstract)
- Semantics and expressiveness issues in active databases
- A semantics for a class of non-deterministic and causal production system programs
- Verifiable properties of database transactions
- Grounded fixpoints and their applications in knowledge representation
- Procedural languages for database queries and updates
- Update programs versus revision programs
- An analysis of the Core-ML language: Expressive power and type reconstruction
- Extending Datalog with arrays
- About boundedness for some DATALOG and DATALOG\textsuperscript{neg} programs
- Extending stratified datalog to capture complexity classes ranging from \(\mathcal P\) to \(Cal Q\mathcal H\)
- Semiring reasoning frameworks in AI and their computational complexity
- The Relational Polynomial-Time Hierarchy and Second-Order Logic
- Semantic restrictions over second-order logic
- The semantics of Datalog for the evidential tool bus (extended abstract)
- scientific article; zbMATH DE number 2218053 (Why is no real title available?)
- Modern Datalog Engines
- Iterating on multiple collections in synchrony
- Datalog and Its Extensions for Semantic Web Databases
- A restricted second order logic for finite structures
- Metafinite model theory
- Update rules in Datalog programs
- First order logic, fixed point logic and linear order
- The expressive power of ``possible-is-certain semantics (extended abstract)
- Recent advances in Datalog\(^\pm \)
- The expressive power of revised Datalog on problems with closure properties
- Addendum to ``Choiceless polynomial time
- \(\mathrm{SO}^F\): a semantic restriction over second-order logic and its polynomial-time hierarchy
- Database Theory, Yuri, and Me
- A computational model for generic graph functions
This page was built for publication: Datalog extensions for database queries and updates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176285)
