Pages that link to "Item:Q1176285"
From MaRDI portal
The following pages link to Datalog extensions for database queries and updates (Q1176285):
Displaying 39 items.
- Highly expressive query languages for unordered data trees (Q269323) (← links)
- Computing with infinitary logic (Q672337) (← links)
- A semideterministic approach to object creation and nondeterminism in database queries (Q676418) (← links)
- Tie-breaking semantics and structural totality (Q676419) (← links)
- Algebraic and calculus query languages for recursively typed complex objects (Q686644) (← links)
- Procedural languages for database queries and updates (Q751799) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- Grounded fixpoints and their applications in knowledge representation (Q892232) (← links)
- A restricted second order logic for finite structures (Q1271559) (← links)
- Semantics and expressiveness issues in active databases (Q1278040) (← links)
- The expressive power of stratified logic programs with value invention (Q1281496) (← links)
- Verifiable properties of database transactions (Q1281498) (← links)
- Querying datalog programs with temporal logic (Q1323325) (← links)
- A semantics for a class of non-deterministic and causal production system programs (Q1340964) (← links)
- Non-determinism in logic-based languages (Q1360676) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- Finitely representable databases (Q1376408) (← links)
- A query language for NC (Q1376409) (← links)
- The complexity of the evaluation of complex algebra expressions (Q1376410) (← links)
- Revision programming (Q1389448) (← links)
- The Kolmogorov expressive power of Boolean query languages (Q1389450) (← links)
- Games and total Datalog\(^{\lnot}\) queries (Q1575136) (← links)
- Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results (Q1744448) (← links)
- Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra (Q1854400) (← links)
- Adding for-loops to first-order logic (Q1854443) (← links)
- Abstract state machines and computationally complete query languages (Q1854519) (← links)
- Functional queries in datalog (Q1862647) (← links)
- Modeling data-intensive reactive systems with relational transition systems (Q1901696) (← links)
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond (Q2117588) (← links)
- Computation on structures. Behavioural theory, logic, complexity (Q2117601) (← links)
- Normalization of class hierarchy in databases (Q2365511) (← links)
- Positive Dedalus programs tolerate non-causality (Q2453541) (← links)
- External sources of knowledge and value invention in logic programming (Q2457798) (← links)
- Arity hierarchies (Q2563982) (← links)
- What Is an Algorithm? (Q2891359) (← links)
- SO F : A Semantic Restriction over Second-Order Logic and Its Polynomial-Time Hierarchy (Q3224003) (← links)
- Semantic Restrictions over Second-Order Logic (Q3458159) (← links)
- Semiring reasoning frameworks in AI and their computational complexity (Q6488781) (← links)
