Datalog - MaRDI portal

swMATH20023MaRDI QIDQ31846FDOQ31846

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

Abductive retrieval of structured documents
On the complexity of data disjunctions.
Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\).
A model building framework for answer set programming with external computations
Normal forms for second-order logic over finite structures, and classification of NP optimization problems
Undecidability and intractability results concerning Datalog programs and their persistency numbers
Ontological query answering under many-valued group preferences in Datalog\(+/-\)
Generalization of ZYT-linearizability for bilinear datalog programs
Representing multi-scale Datalog\(+/-\) using hierarchical graphs
Deciding the bisimilarity relation between Datalog goals
Declarative probabilistic programming with Datalog
On the expected size of recursive datalog queries
On Datalog vs. LFP
Monadic Datalog Containment
Datalog with integer periodicity constraints
A single recursive predicate is sufficient for pure datalog
Updating intensional predicates in Datalog
A fast algorithm and Datalog inexpressibility for temporal reasoning
On decompositions of chain datalog programs into P (left-)linear 1-rule components
On the complexity of the Bernays-Schönfinkel class with Datalog
Ontology-Mediated Query Answering with Data-Tractable Description Logics
Conceptual Structures at Work
An extended constraint deductive database: theory and implementation
Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints
Title not available (Why is that?)
Title not available (Why is that?)
A datalog-based computational model for coordination-free, data-parallel systems
Containment of monadic Datalog programs via bounded clique-width
Inconsistency handling in Datalog\(+/-\) ontologies
Pruning external minimality checking for answer set programs using semantic dependencies
Reasoning on Datalog\(^\pm\) ontologies with abductive logic programming
Precise complexity guarantees for pointer analysis via Datalog with extensions
On edge addition rewrite systems and their relevance to program analysis
A rule-based approach to analyzing database schema objects with Datalog
Debugging non-ground ASP programs: technique and graphical tools
Partial compilation of ASP programs
Optimizing answer set computation via heuristic-based decomposition
Dynamic magic sets for disjunctive Datalog programs
Bottom-up evaluation of datalog with negation
Datalog with non-deterministic choice computes NDB-PTIME
On temporal logic versus Datalog
Datalog\(^\pm\) ontology consolidation
Characterization of desirable properties of general database decompositions.
Datalog: A self-contained tutorial. II
Module extraction in expressive ontology languages via Datalog reasoning
Datalog and logic databases
kProbLog: an algebraic Prolog for machine learning
Linear Logical Algorithms
Can datalog be approximated?
A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters
Memoing evaluation for constraint extensions of datalog
Abstract Hilbertian deductive systems, infon logic, and Datalog
Inf-datalog, Modal Logic and Complexities
Practical algorithms for MSO model-checking on tree-decomposable graphs
The generalized supplementary magic-sets transformation for stratified Datalog
More on tractable disjunctive Datalog
Parameterized splitting: a simple modification-based approach
Bounded-depth succinct encodings and the structure they imply on graphs
Semantics and complexity of recursive aggregates in answer set programming
Safe computation of the well-founded semantics of datalog queries
Removing redundancy from a clause
Certain answers over incomplete XML documents: extending tractability boundary
Reasoning with infinite stable models
Magic Sets and their application to data integration
A non-ground realization of the stable and well-founded semantics
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
Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
Querying incomplete information in RDF with SPARQL
ADDING PROBABILITIES AND RULES TO OWL LITE SUBSETS BASED ON PROBABILISTIC DATALOG
On the equivalence of recursive and nonrecursive Datalog programs
Functional queries in datalog
Information-based distance measures and the canonical reflection of view updates
Title not available (Why is that?)
Title not available (Why is that?)
On datalog vs polynomial time
Title not available (Why is that?)
Inference of monotonicity constraints in Datalog programs
Type inference for Datalog with complex type hierarchies
Languages represented by Boolean formulas
A linear algebraic approach to Datalog evaluation
Extending and implementing the stable model semantics
From primal infon logic with individual variables to Datalog
Stable models and difference logic
Datalog vs first-order logic
Modularity aspects of disjunctive stable models
Datalog extensions for database queries and updates
Linear Datalog and Bounded Path Duality of Relational Structures
Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues
Succinctness as a source of complexity in logical formalisms
Datalog in academia and industry. Second international workshop, Datalog 2.0, Vienna, Austria, September 11--13, 2012. Proceedings
Monadic Datalog over finite structures of bounded treewidth
Title not available (Why is that?)
On the complexity of single-rule datalog queries.
On rules with existential variables: walking the decidability line
Monadic Datalog and the expressive power of languages for web information extraction
Succinct representation, leaf languages, and projection reductions
Magic sets for disjunctive Datalog programs
Equivalence of Datalog queries is undecidable

This page was built for software: Datalog