Datalog
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Stable models and difference logic
- Conceptual and ontological modeling in information systems
- Computing only minimal answers in disjunctive deductive databases
- Boundedness is undecidable for datalog programs with a single recursive rule
- Circumscribing DATALOG: expressive power and complexity
- Graph traversal and top-down evaluation of logic queries
- Datalog extensions for database queries and updates
- Safe computation of the well-founded semantics of datalog queries
- Selective inheritance of attribute values in relational databases
- Permutation dependency in datalog programs
- Preservation of integrity constraints in definite DATALOG programs
- 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
- Sequences, datalog, and transducers
- Succinctness as a source of complexity in logical formalisms
- Unique complements and decompositions of database schemata
- Querying datalog programs with temporal logic
- Bottom-up evaluation of datalog with negation
- Datalog vs first-order logic
- 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.
- The expressive powers of stable models for bound and unbound DATALOG queries
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Magic sets revisited
- Counting and topological order
- Bounded arity Datalog () 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
- Abductive retrieval of structured documents
- A probabilistic view of Datalog parallelization
- Abduction from logic programs: Semantics and complexity
- On temporal logic versus Datalog
- On the complexity of single-rule datalog queries.
- Autowrite
- HiLog
- C-SPARQL
- LOGIDATA+
- LAILA
- ASSAT
- IMPACT
- CACTUS
- DLVHEX
- Games and total Datalog\(^{\lnot}\) queries
- SCASY
- Alternative foundations for Reiter's default logic
- Logic programming and knowledge representation---The A-Prolog perspective
- Extending and implementing the stable model semantics
- recsy
- LARS: a logic-based framework for analytic reasoning over streams
- How does incoherence affect inconsistency-tolerant semantics for Datalog^?
- Cmodels
- A rule-based approach to analyzing database schema objects with Datalog
- Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints
- Gringo
- Smodels
- DLV
- DLV-EX
- kProbLog: an algebraic Prolog for machine learning
- Ontological query answering under many-valued group preferences in Datalog\(+/-\)
- Magic sets for disjunctive Datalog programs
- Datalog: A self-contained tutorial. II
- AEtnaNova
- On the complexity of data disjunctions.
- Complexity and expressive power of deterministic semantics for DATALOG^ .
- Functional queries in datalog
- Compiling dyadic first-order specifications into map algebra
- Linearisability on Datalog programs
- Generalization of ZYT-linearizability for bilinear datalog programs
- A single recursive predicate is sufficient for pure datalog
- On the expected size of recursive datalog queries
- On datalog vs polynomial time
- Potassco
- Datalog extension for nested relations
- NoMoRe
- GASP
- 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
- Nonrecursive incremental evaluation of Datalog queries
- Datalog and constraint satisfaction with infinite templates
- SPARQL
- Bidual Horn functions and extensions
- Inference of monotonicity constraints in Datalog programs
- Representing multi-scale Datalog+/- using hierarchical graphs
- Pruning external minimality checking for answer set programs using semantic dependencies
- Possible models computation and revision -- a practical approach
- Treewidthlib
- Inconsistency-tolerant query answering for existential rules
- MYSTIQ
- A polynomial reduction of forks into logic programs
- Modular materialisation of Datalog programs
- Recursive rules with aggregation: a simple unified semantics
- A tetrachotomy of ontology-mediated queries with a covering axiom
- WASP
- Joeq
- DMCS
- Checking the data complexity of ontology-mediated queries: a case study with non-uniform CSPs and Polyanna
This page was built for software: Datalog
