The following pages link to Datalog (Q31846):
Displayed 50 items.
- Double Horn functions (Q1271644) (← links)
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- Prolog technology for default reasoning: proof theory and compilation techniques (Q1275596) (← links)
- Sequences, datalog, and transducers (Q1278034) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- Unique complements and decompositions of database schemata (Q1318468) (← links)
- Querying datalog programs with temporal logic (Q1323325) (← links)
- Bottom-up evaluation of datalog with negation (Q1333369) (← links)
- Datalog vs first-order logic (Q1342861) (← links)
- Multiple total stable models are definitely needed to solve unique solution problems (Q1349967) (← links)
- Querying disjunctive databases through nonmonotonic logics (Q1350535) (← links)
- Characterization of desirable properties of general database decompositions. (Q1353960) (← links)
- The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337) (← links)
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation (Q1363783) (← links)
- Magic sets revisited (Q1368187) (← links)
- Counting and topological order (Q1375328) (← links)
- Bounded arity Datalog \((\neq)\) queries on graphs (Q1376404) (← links)
- Can datalog be approximated? (Q1376415) (← links)
- A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters (Q1378382) (← links)
- Memoing evaluation for constraint extensions of datalog (Q1378383) (← links)
- Abductive retrieval of structured documents (Q1381730) (← links)
- A probabilistic view of Datalog parallelization (Q1389447) (← links)
- Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
- On temporal logic versus Datalog (Q1401358) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)
- Games and total Datalog\(^{\lnot}\) queries (Q1575136) (← links)
- Alternative foundations for Reiter's default logic (Q1589575) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- Extending and implementing the stable model semantics (Q1603743) (← links)
- LARS: a logic-based framework for analytic reasoning over streams (Q1648076) (← links)
- How does incoherence affect inconsistency-tolerant semantics for Datalog\(^\pm\)? (Q1653442) (← links)
- A rule-based approach to analyzing database schema objects with Datalog (Q1671135) (← links)
- Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints (Q1678427) (← links)
- kProbLog: an algebraic Prolog for machine learning (Q1699913) (← links)
- Ontological query answering under many-valued group preferences in Datalog\(+/-\) (Q1726403) (← links)
- Magic sets for disjunctive Datalog programs (Q1761296) (← links)
- Datalog: A self-contained tutorial. II (Q1817097) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). (Q1854304) (← links)
- Functional queries in datalog (Q1862647) (← links)
- Compiling dyadic first-order specifications into map algebra (Q1870581) (← links)
- Linearisability on Datalog programs (Q1884881) (← links)
- Generalization of ZYT-linearizability for bilinear datalog programs (Q1887164) (← links)
- A single recursive predicate is sufficient for pure datalog (Q1891166) (← links)
- On the expected size of recursive datalog queries (Q1900920) (← links)
- On datalog vs polynomial time (Q1900923) (← links)
- Datalog extension for nested relations (Q1905912) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
- Normal forms for second-order logic over finite structures, and classification of NP optimization problems (Q1919763) (← links)
- Nonrecursive incremental evaluation of Datalog queries (Q1924723) (← links)