Datalog
From MaRDI portal
Software:31846
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
- Ontological query answering under many-valued group preferences in Datalog\(+/-\)
- Generalization of ZYT-linearizability for bilinear datalog programs
- Reasoning on Datalog± Ontologies with Abductive Logic Programming
- Representing multi-scale Datalog\(+/-\) using hierarchical graphs
- On the expected size of recursive datalog queries
- Title not available (Why is that?)
- Datalog and Logic Databases
- Optimizing Answer Set Computation via Heuristic-Based Decomposition
- On Datalog vs. LFP
- Partial Compilation of ASP Programs
- Monadic Datalog Containment
- Datalog with integer periodicity constraints
- Debugging Non-ground ASP Programs: Technique and Graphical Tools
- A single recursive predicate is sufficient for pure datalog
- Updating intensional predicates in Datalog
- Undecidability and intractability results concerning datalog programs and their persistency numbers
- On decompositions of chain datalog programs into P (left-)linear 1-rule components
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Deciding the Bisimilarity Relation between Datalog Goals
- 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
- Pruning external minimality checking for answer set programs using semantic dependencies
- A fast algorithm and datalog inexpressibility for temporal reasoning
- 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
- 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
- Declarative Probabilistic Programming with 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
- Containment of Monadic Datalog Programs via Bounded Clique-Width
- 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
- On the Complexity of the Bernays-Schönfinkel Class with Datalog
- Logic Programming
- The Intelligent Grounder of DLV
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints
- Low-complexity aggregation in GraphLog and Datalog
- Querying disjunctive databases through nonmonotonic logics
- A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic
- Abduction from logic programs: Semantics and complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Expressiveness of Logic Programs under the General Stable Model Semantics
- Bidual Horn functions and extensions
- Title not available (Why is that?)
- On the equivalence of the static and disjunctive well-founded semantics and its computation
- LARS: a logic-based framework for analytic reasoning over streams
- A semantic approach to optimize linear datalog programs
- Expressive power and complexity of partial models for disjunctive deductive databases
- Sequences, datalog, and transducers
- Bounded arity Datalog \((\neq)\) queries on graphs
- A probabilistic view of Datalog parallelization
- The expressive powers of stable models for bound and unbound DATALOG queries
- Boundedness is undecidable for datalog programs with a single recursive rule
- Regular expression transformations to extend regular languages (with application to a Datalog XML schema validator)
- Preservation of integrity constraints in definite DATALOG programs
- Circumscribing DATALOG: expressive power and complexity
- Graph traversal and top-down evaluation of logic queries
- Possible models computation and revision -- a practical approach
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Parallel bottom-up processing of datalog queries
- Multiple total stable models are definitely needed to solve unique solution problems
- Magic sets revisited
- Counting and topological order
- The complexity of searching implicit graphs
- Alternative foundations for Reiter's default logic
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
- Title not available (Why is that?)
- Games and total Datalog\(^{\lnot}\) queries
- A declarative extension of horn clauses, and its significance for datalog and its applications
- Unique complements and decompositions of database schemata
- Programming Languages and Systems
- Horn Clause Solvers for Program Verification
- Ordered completion for logic programs with aggregates
- Fundamental properties of deterministic and nondeterministic extensions of Datalog
- Design and results of the Fifth Answer Set Programming Competition
- Using clausal deductive databases for defining semantics in disjunctive deductive databases
- Querying datalog programs with temporal logic
- The complexity of searching succinctly represented graphs
- Compiling dyadic first-order specifications into map algebra
- Datalog and constraint satisfaction with infinite templates
- Prolog technology for default reasoning: proof theory and compilation techniques
This page was built for software: Datalog