Datalog
From MaRDI portal
Cited in
(only showing first 100 items - show all)- scientific article; zbMATH DE number 4064536 (Why is no real title available?)
- scientific article; zbMATH DE number 1407678 (Why is no real title available?)
- Abstract Hilbertian deductive systems, infon logic, and Datalog
- Abductive retrieval of structured documents
- On the complexity of data disjunctions.
- Complexity and expressive power of deterministic semantics for DATALOG^ .
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Monadic datalog and regular tree pattern queries
- Inf-datalog, Modal Logic and Complexities
- Logic Programming
- Normal forms for second-order logic over finite structures, and classification of NP optimization problems
- Update rules in datalog programs
- A model building framework for answer set programming with external computations
- The generalized supplementary magic-sets transformation for stratified Datalog
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints
- Low-complexity aggregation in GraphLog and Datalog
- Ontological query answering under many-valued group preferences in Datalog\(+/-\)
- Undecidability and intractability results concerning Datalog programs and their persistency numbers
- Generalization of ZYT-linearizability for bilinear datalog programs
- scientific article; zbMATH DE number 1420817 (Why is no real title available?)
- Querying disjunctive databases through nonmonotonic logics
- A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic
- Disjunctive answer set solvers via templates
- Parameterized splitting: a simple modification-based approach
- Abduction from logic programs: Semantics and complexity
- Bounded-depth succinct encodings and the structure they imply on graphs
- Representing multi-scale Datalog\(+/-\) using hierarchical graphs
- More on tractable disjunctive Datalog
- Semantics and complexity of recursive aggregates in answer set programming
- Deciding the bisimilarity relation between Datalog goals
- Safe computation of the well-founded semantics of datalog queries
- scientific article; zbMATH DE number 4126721 (Why is no real title available?)
- Logic Programming
- A Datalog recognizer for almost affine \(\lambda \)-CFGs
- Declarative probabilistic programming with Datalog
- scientific article; zbMATH DE number 1149474 (Why is no real title available?)
- Removing redundancy from a clause
- scientific article; zbMATH DE number 1406215 (Why is no real title available?)
- On the expected size of recursive datalog queries
- Certain answers over incomplete XML documents: extending tractability boundary
- scientific article; zbMATH DE number 5605141 (Why is no real title available?)
- Modern Datalog Engines
- Reasoning with infinite stable models
- Eliminating recursion from monadic datalog programs on trees
- scientific article; zbMATH DE number 1226428 (Why is no real title available?)
- scientific article; zbMATH DE number 219219 (Why is no real title available?)
- Magic Sets and their application to data integration
- A non-ground realization of the stable and well-founded semantics
- Twofold Extensions of Fuzzy Datalog
- Bidual Horn functions and extensions
- Monotonic aggregation in deductive databases
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
- Ordered completion for first-order logic programs on finite structures
- On Datalog vs. LFP
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- Querying incomplete information in RDF with SPARQL
- Reasoning with uncertain and inconsistent OWL ontologies
- Monadic Datalog Containment
- On the equivalence of recursive and nonrecursive Datalog programs
- scientific article; zbMATH DE number 219218 (Why is no real title available?)
- Datalog with integer periodicity constraints
- Information-based distance measures and the canonical reflection of view updates
- A Theoretical Framework for the Declarative Debugging of Datalog Programs
- On the equivalence of the static and disjunctive well-founded semantics and its computation
- Functional queries in datalog
- LARS: a logic-based framework for analytic reasoning over streams
- ADDING PROBABILITIES AND RULES TO OWL LITE SUBSETS BASED ON PROBABILISTIC DATALOG
- A semantic approach to optimize linear datalog programs
- An allocation algorithm for distributing Datalog programs
- On datalog vs polynomial time
- Enhancing the expressive power of the U-Datalog language
- Building PMCFG Parsers as Datalog Program Transformations
- scientific article; zbMATH DE number 3874667 (Why is no real title available?)
- scientific article; zbMATH DE number 3640922 (Why is no real title available?)
- scientific article; zbMATH DE number 4180775 (Why is no real title available?)
- Expressive power and complexity of partial models for disjunctive deductive databases
- Sequences, datalog, and transducers
- A single recursive predicate is sufficient for pure datalog
- Inference of monotonicity constraints in Datalog programs
- Bounded arity Datalog \((\neq)\) queries on graphs
- A probabilistic view of Datalog parallelization
- Updating intensional predicates in Datalog
- The expressive powers of stable models for bound and unbound DATALOG queries
- Languages represented by Boolean formulas
- Type inference for Datalog with complex type hierarchies
- Horn clause solvers for program verification
- scientific article; zbMATH DE number 2090838 (Why is no real title available?)
- Temporal disjunctive logic programming
- Recent advances in Datalog\(^\pm \)
- Boundedness is undecidable for datalog programs with a single recursive rule
- Stable models and difference logic
- Extending and implementing the stable model semantics
- Datalog vs first-order logic
- A fast algorithm and Datalog inexpressibility for temporal reasoning
- From primal infon logic with individual variables to Datalog
- Preservation of integrity constraints in definite DATALOG programs
- scientific article; zbMATH DE number 1696779 (Why is no real title available?)
- A linear algebraic approach to Datalog evaluation
- Datalog extensions for database queries and updates
- Circumscribing DATALOG: expressive power and complexity
This page was built for software: Datalog
