The following pages link to Datalog (Q31846):
Displaying 50 items.
- Certain answers over incomplete XML documents: extending tractability boundary (Q269320) (← links)
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies (Q286087) (← links)
- Querying incomplete information in RDF with SPARQL (Q286403) (← links)
- Languages represented by Boolean formulas (Q290253) (← links)
- Semantic query optimization in the presence of types (Q389237) (← links)
- Abstract Hilbertian deductive systems, infon logic, and Datalog (Q393078) (← links)
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots (Q414848) (← links)
- Ordered completion for first-order logic programs on finite structures (Q420824) (← links)
- Information-based distance measures and the canonical reflection of view updates (Q429442) (← links)
- Datalog in academia and industry. Second international workshop, Datalog 2.0, Vienna, Austria, September 11--13, 2012. Proceedings (Q446534) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions (Q477206) (← links)
- CNF and DNF succinct graph encodings (Q515682) (← links)
- ERBlox: combining matching dependencies with machine learning for entity resolution (Q518610) (← links)
- Semantics and complexity of recursive aggregates in answer set programming (Q543600) (← links)
- On rules with existential variables: walking the decidability line (Q646515) (← links)
- A non-ground realization of the stable and well-founded semantics (Q671655) (← links)
- A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs (Q672662) (← links)
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- Monotonic aggregation in deductive databases (Q676422) (← links)
- Removing redundancy from a clause (Q685346) (← links)
- The generalized supplementary magic-sets transformation for stratified Datalog (Q685491) (← links)
- Low-complexity aggregation in GraphLog and Datalog (Q688669) (← links)
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints (Q688670) (← links)
- Bounded-depth succinct encodings and the structure they imply on graphs (Q722204) (← links)
- Fundamental properties of deterministic and nondeterministic extensions of Datalog (Q756410) (← links)
- Enhancing disjunctive logic programming systems by SAT checkers (Q814529) (← links)
- Reasoning with infinite stable models (Q814596) (← links)
- A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic (Q831915) (← links)
- A semantic approach to optimize linear datalog programs (Q854685) (← links)
- Magic Sets and their application to data integration (Q882436) (← links)
- Ordered completion for logic programs with aggregates (Q892233) (← links)
- Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited (Q894695) (← links)
- Design and results of the Fifth Answer Set Programming Competition (Q899444) (← links)
- Checking functional consistency in deductive databases (Q911816) (← links)
- Hypothetical datalog: Complexity and expressibility (Q915436) (← links)
- On the decomposition of datalog program mappings (Q915437) (← links)
- Weighted monadic Datalog (Q944376) (← links)
- Stable models and difference logic (Q1028651) (← links)
- Conceptual and ontological modeling in information systems (Q1040330) (← links)
- Computing only minimal answers in disjunctive deductive databases (Q1040782) (← links)
- Boundedness is undecidable for datalog programs with a single recursive rule (Q1123647) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- Graph traversal and top-down evaluation of logic queries (Q1130171) (← links)
- Datalog extensions for database queries and updates (Q1176285) (← links)
- Safe computation of the well-founded semantics of datalog queries (Q1198101) (← links)
- Selective inheritance of attribute values in relational databases (Q1202889) (← links)
- Permutation dependency in datalog programs (Q1208139) (← links)
- Preservation of integrity constraints in definite DATALOG programs (Q1208438) (← links)
- Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
