Datalog

swMATH20023MaRDI QIDQ31846

No author found.

Related Items (only showing first 100 items - show all)

Certain answers over incomplete XML documents: extending tractability boundary ⋮ Bottom-up evaluation of datalog with negation ⋮ Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies ⋮ Querying incomplete information in RDF with SPARQL ⋮ A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic ⋮ Languages represented by Boolean formulas ⋮ Linearisability on Datalog programs ⋮ Generalization of ZYT-linearizability for bilinear datalog programs ⋮ Datalog vs first-order logic ⋮ A single recursive predicate is sufficient for pure datalog ⋮ Multiple total stable models are definitely needed to solve unique solution problems ⋮ Querying disjunctive databases through nonmonotonic logics ⋮ Characterization of desirable properties of general database decompositions. ⋮ On the expected size of recursive datalog queries ⋮ On datalog vs polynomial time ⋮ LARS: a logic-based framework for analytic reasoning over streams ⋮ A semantic approach to optimize linear datalog programs ⋮ The expressive powers of stable models for bound and unbound DATALOG queries ⋮ Datalog extension for nested relations ⋮ How does incoherence affect inconsistency-tolerant semantics for Datalog\(^\pm\)? ⋮ Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation ⋮ Magic sets revisited ⋮ Counting and topological order ⋮ Bounded arity Datalog \((\neq)\) queries on graphs ⋮ 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 ⋮ Hierarchies in transitive closure logic, stratified Datalog and infinitary logic ⋮ Normal forms for second-order logic over finite structures, and classification of NP optimization problems ⋮ A rule-based approach to analyzing database schema objects with Datalog ⋮ Boundedness is undecidable for datalog programs with a single recursive rule ⋮ Abductive retrieval of structured documents ⋮ Circumscribing DATALOG: expressive power and complexity ⋮ Nonrecursive incremental evaluation of Datalog queries ⋮ Magic Sets and their application to data integration ⋮ Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints ⋮ Graph traversal and top-down evaluation of logic queries ⋮ Semantic query optimization in the presence of types ⋮ A probabilistic view of Datalog parallelization ⋮ Abduction from logic programs: Semantics and complexity ⋮ Abstract Hilbertian deductive systems, infon logic, and Datalog ⋮ Ordered completion for logic programs with aggregates ⋮ Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited ⋮ On temporal logic versus Datalog ⋮ Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots ⋮ On the complexity of single-rule datalog queries. ⋮ Design and results of the Fifth Answer Set Programming Competition ⋮ Ordered completion for first-order logic programs on finite structures ⋮ kProbLog: an algebraic Prolog for machine learning ⋮ Information-based distance measures and the canonical reflection of view updates ⋮ Checking functional consistency in deductive databases ⋮ Datalog in academia and industry. Second international workshop, Datalog 2.0, Vienna, Austria, September 11--13, 2012. Proceedings ⋮ Hypothetical datalog: Complexity and expressibility ⋮ On the decomposition of datalog program mappings ⋮ On rules with existential variables: walking the decidability line ⋮ Ontological query answering under many-valued group preferences in Datalog\(+/-\) ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Datalog extensions for database queries and updates ⋮ A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions ⋮ A non-ground realization of the stable and well-founded semantics ⋮ A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs ⋮ Weighted monadic Datalog ⋮ On the equivalence of recursive and nonrecursive Datalog programs ⋮ Monotonic aggregation in deductive databases ⋮ CNF and DNF succinct graph encodings ⋮ ERBlox: combining matching dependencies with machine learning for entity resolution ⋮ Safe computation of the well-founded semantics of datalog queries ⋮ Removing redundancy from a clause ⋮ The generalized supplementary magic-sets transformation for stratified Datalog ⋮ Low-complexity aggregation in GraphLog and Datalog ⋮ A closed-form evaluation for Datalog queries with integer (gap)-order constraints ⋮ Selective inheritance of attribute values in relational databases ⋮ Magic sets for disjunctive Datalog programs ⋮ Permutation dependency in datalog programs ⋮ Preservation of integrity constraints in definite DATALOG programs ⋮ Semantics and complexity of recursive aggregates in answer set programming ⋮ Bounded-depth succinct encodings and the structure they imply on graphs ⋮ Fundamental properties of deterministic and nondeterministic extensions of Datalog ⋮ Datalog: A self-contained tutorial. II ⋮ Succinct representation, leaf languages, and projection reductions ⋮ Double Horn functions ⋮ Expressive power and complexity of partial models for disjunctive deductive databases ⋮ Prolog technology for default reasoning: proof theory and compilation techniques ⋮ Stable models and difference logic ⋮ Sequences, datalog, and transducers ⋮ Games and total Datalog\(^{\lnot}\) queries ⋮ Conceptual and ontological modeling in information systems ⋮ Computing only minimal answers in disjunctive deductive databases ⋮ Succinctness as a source of complexity in logical formalisms ⋮ Alternative foundations for Reiter's default logic ⋮ On the complexity of data disjunctions. ⋮ Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). ⋮ Functional queries in datalog ⋮ Logic programming and knowledge representation---The A-Prolog perspective ⋮ Extending and implementing the stable model semantics ⋮ Unique complements and decompositions of database schemata ⋮ Enhancing disjunctive logic programming systems by SAT checkers ⋮ Reasoning with infinite stable models ⋮ Querying datalog programs with temporal logic ⋮ Compiling dyadic first-order specifications into map algebra

This page was built for software: Datalog