BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
datalog
Google datalog

Tag #datalog

113 papers:

PADLPADL-2020-ShahinC #variability
Variability-Aware Datalog (RS, MC), pp. 213–221.
POPLPOPL-2020-RaghothamanMZNS #source code #synthesis
Provenance-guided synthesis of Datalog programs (MR, JM, DZ, MN, BS), p. 27.
CIKMCIKM-2019-HuUMH #knowledge base #rdf #reasoning
Datalog Reasoning over Compressed RDF Knowledge Bases (PH, JU, BM, IH), pp. 2065–2068.
CIKMCIKM-2019-MiloMY #analysis #named #probability
PODIUM: Probabilistic Datalog Analysis via Contribution Maximization (TM, YM, BY), pp. 2865–2868.
ESOPESOP-2019-Alvarez-Picallo #fixpoint #incremental #recursion #semantics
Fixing Incremental Computation - Derivatives of Fixpoints, and the Recursive Semantics of Datalog (MAP, AET, MPJ, CHLO), pp. 525–552.
CIKMCIKM-2018-DasGZ #named #reasoning
ASTRO: A Datalog System for Advanced Stream Reasoning (AD, SMG, CZ), pp. 1863–1866.
OOPSLAOOPSLA-2018-SzaboBEV #analysis
Incrementalizing lattice-based program analyses in Datalog (TS, GB, SE, MV), p. 29.
PPDPPPDP-2018-ContrastinOR #automation #data flow #order #safety
Automatic Reordering for Dataflow Safety of Datalog (MC, DAO, ACR), p. 17.
ESEC-FSEESEC-FSE-2018-SiLZAKN #source code #synthesis
Syntax-guided synthesis of Datalog programs (XS, WL, RZ, AA, PK, MN), pp. 515–527.
LOPSTRLOPSTR-2017-EngelsBB #approach #database #rule-based
A Rule-Based Approach to Analyzing Database Schema Objects with Datalog (CE, AB, SB), pp. 20–36.
ICFP-2016-ArntzeniusK #functional #named
Datafun: a functional Datalog (MA, NRK), pp. 214–227.
PLDIPLDI-2016-MadsenYL #declarative #fixpoint
From Datalog to flix: a declarative language for fixed points on lattices (MM, MHY, OL), pp. 194–208.
CCCC-2016-ScholzJSW #on the #performance #program analysis #scalability
On fast large-scale program analysis in Datalog (BS, HJ, PS, TW), pp. 196–206.
VLDBVLDB-2015-DeutchGM #query #source code #using
Selective Provenance for Datalog Programs Using Top-K Queries (DD, AG, YM), pp. 1394–1405.
VLDBVLDB-2015-WangBH #evaluation #fault tolerance #recursion
Asynchronous and Fault-Tolerant Recursive Datalog Evaluation in Shared-Nothing Engines (JW, MB, DH), pp. 1542–1553.
ICALPICALP-v2-2015-BojanczykMW #bound #clique #monad #source code
Containment of Monadic Datalog Programs via Bounded Clique-Width (MB, FM, AW), pp. 427–439.
PPDPPPDP-2015-CaballeroGS #constraints #debugging #source code
Debugging of wrong and missing answers for datalog programs with constraint handling rules (RC, YGR, FSP), pp. 55–66.
ICLPICLP-2015-GavanelliLRBZC #abduction #framework #ontology
An Abductive Framework for Datalog± Ontologies (MG, EL, FR, EB, RZ, GC), pp. 274–286.
KRKR-2014-GottlobLP
Datalog+/-: Questions and Answers (GG, TL, AP).
PLDIPLDI-2014-ZhangMGNY #abstraction #analysis #on the #refinement
On abstraction refinement for program analyses in Datalog (XZ, RM, RG, MN, HY), p. 27.
PODSPODS-2013-BienvenuCLW #case study #csp #data access #ontology
Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP (MB, BtC, CL, FW), pp. 213–224.
PODSPODS-2013-HernichKLG #ontology #reasoning #semantics
Well-founded semantics for extended datalog and ontological reasoning (AH, CK, TL, GG), pp. 225–236.
VLDBVLDB-2013-ShkapskyZZ #graph #query
Graph Queries in a Next-Generation Datalog System (AS, KZ, CZ), pp. 1258–1261.
ICLPICLP-J-2013-MazuranSZ #declarative #horn clause
A declarative extension of horn clauses, and its significance for datalog and its applications (MM, ES, CZ), pp. 609–623.
ICALPICALP-v2-2012-BenediktBS #monad
Monadic Datalog Containment (MB, PB, PS), pp. 79–91.
KEODKEOD-2012-Decker #information management
Datalog for Inconsistency-tolerant Knowledge Engineering (HD), pp. 296–301.
KRKR-2012-GottlobS #ontology #query #recursion #source code
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs (GG, TS).
PADLPADL-2012-CampagnaSS #approximate #constraints #difference #optimisation
Optimizing Inequality Joins in Datalog with Approximated Constraint Propagation (DC, BSS, TS), pp. 108–122.
PPDPPPDP-2012-LamC #linear #logic #modelling
Modeling datalog fact assertion and retraction in linear logic (ESLL, IC), pp. 67–78.
ICLPICLP-J-2012-AlvianoFLM #complexity #decidability #quantifier #semantics
Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues (MA, WF, NL, MM), pp. 701–718.
SIGMODSIGMOD-2011-HuangGL #interactive #tutorial
Datalog and emerging applications: an interactive tutorial (SSH, TJG, BTL), pp. 1213–1216.
SIGMODSIGMOD-2011-TekleL #performance #query #set
More efficient datalog queries: subsumptive tabling beats magic sets (KTT, YAL), pp. 661–672.
PODSPODS-2010-Hellerstein #experience
Datalog redux: experience and conjecture (JMH), pp. 1–2.
CIKMCIKM-2010-RonenS #automation #interactive #network #social
Automated interaction in social networks with datalog (RR, OS), pp. 1273–1276.
POPLPOPL-2010-SchaferM #type inference
Type inference for datalog with complex type hierarchies (MS, OdM), pp. 145–156.
PPDPPPDP-2010-LiangK #statistics
Deriving predicate statistics in datalog (SL, MK), pp. 45–56.
PPDPPPDP-2010-TekleGL #graph #optimisation #query
Graph queries through datalog optimizations (KTT, MG, YAL), pp. 25–34.
PPDPPPDP-2010-TekleL #analysis #complexity #performance #precise #query
Precise complexity analysis for efficient datalog queries (KTT, YAL), pp. 35–44.
ICLPICLP-2010-Alviano10 #set #source code
Dynamic Magic Sets for Disjunctive Datalog Programs (MA), pp. 226–235.
ICLPICLP-2010-Aref10 #enterprise #industrial #research
Datalog for Enterprise Software: from Industrial Applications to Research (MA), p. 1.
LICSLICS-2010-CaliGLMP #information management #logic #product line #query #representation
Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications (AC, GG, TL, BM, AP), pp. 228–242.
LATALATA-2009-BuchseS #monad #transducer
Monadic Datalog Tree Transducers (MB, TS), pp. 267–278.
LOPSTRLOPSTR-2009-AlpuenteFJV #logic
Defining Datalog in Rewriting Logic (MA, MAF, CJ, AV), pp. 188–204.
PADLPADL-2009-ZookPS
Typed Datalog (DZ, EP, BSS), pp. 168–182.
PODSPODS-2008-MoorSAV #optimisation #query #type inference
Type inference for datalog and its application to query optimisation (OdM, DS, PA, MV), pp. 291–300.
SIGMODSIGMOD-2008-SereniAM #compilation #optimisation
Adding magic to an optimising datalog compiler (DS, PA, OdM), pp. 553–566.
ICALPICALP-B-2008-DawarK #on the
On Datalog vs. LFP (AD, SK), pp. 160–171.
ICALPICALP-B-2008-EgriLT #symmetry
Directed st-Connectivity Is Not Expressible in Symmetric Datalog (LE, BL, PT), pp. 172–183.
LICSLICS-2008-DalmauL #symmetry
Maltsev + Datalog --> Symmetric Datalog (VD, BL), pp. 297–306.
PODSPODS-2007-GottlobPW #bound #finite #monad
Monadic datalog over finite structures with bounded treewidth (GG, RP, FW), pp. 165–174.
VLDBVLDB-2007-ShenDNR #declarative #embedded #information management #using
Declarative Information Extraction Using Datalog with Embedded Extraction Predicates (WS, AD, JFN, RR), pp. 1033–1044.
LICSLICS-2007-EgriLT #constraints #problem #symmetry
Symmetric Datalog and Constraint Satisfaction Problems in Logspace (LE, BL, PT), pp. 193–202.
KRKR-2006-Rosati #integration #logic
DL+log: Tight Integration of Description Logics and Disjunctive Datalog (RR), pp. 68–78.
ECOOPECOOP-2006-HajiyevVM #named #query #scalability #source code
codeQuest: Scalable Source Code Queries with Datalog (EH, MV, OdM), pp. 2–27.
ICLPICLP-2006-Lam #question #source code #why
Why Use Datalog to Analyze Programs? (MSL), p. 1.
ICLPICLP-2006-RuckhausKPG #approach #owl
Integrating Datalog with OWL: Exploring the AL-log Approach (ER, VK, BP, BCG), pp. 455–456.
PODSPODS-2005-AbiteboulAHM #exclamation
Diagnosis of asynchronous discrete event systems: datalog to the rescue! (SA, ZA, SH, TM), pp. 358–367.
ECIRECIR-2005-Nottelmann #information retrieval #named #probability
PIRE: An Extensible IR Engine Based on Probabilistic Datalog (HN), pp. 260–274.
ICLPICLP-2005-LukacsyN #reasoning
Open World Reasoning in Datalog (GL, ZN), pp. 427–428.
PODSPODS-2004-Bonatti #decidability #on the #query #recursion
On the Decidability of Containment of Recursive Datalog Queries — Preliminary report (PAB), pp. 297–306.
KRKR-2004-HustadtMS #logic #source code
Reducing SHIQ-Description Logic to Disjunctive Datalog Programs (UH, BM, US), pp. 152–162.
PPDPPPDP-2004-GrecoGSS #logic programming #multi #programming language #reasoning
Event choice datalog: a logic programming language for reasoning in multiple dimensions (GG, AG, DS, FS), pp. 238–249.
ICLPICLP-2004-CumboFGL #source code
Enhancing the Magic-Set Method for Disjunctive Datalog Programs (CC, WF, GG, NL), pp. 371–385.
PADLPADL-2003-LiM #constraints #trust
DATALOG with Constraints: A Foundation for Trust Management Languages (NL, JCM), pp. 58–73.
PPDPPPDP-2003-GrecoZ #bound #on the #performance #query
On the rewriting and efficient computation of bound disjunctive datalog queries (SG, EZ), pp. 136–147.
PPDPPPDP-2003-LiuS #performance #source code
From datalog rules to efficient programs with time and space guarantees (YAL, SDS), pp. 172–183.
SASSAS-2003-BessonJ #analysis #composition
Modular Class Analysis with DATALOG (FB, TPJ), pp. 19–36.
PODSPODS-2002-GottlobK #information management #monad #power of #web
Monadic Datalog and the Expressive Power of Languages for Web Information Extraction (GG, CK), pp. 17–28.
CIKMCIKM-2001-NottelmannF #classification #learning #probability
Learning Probabilistic Datalog Rules for Information Classification and Transformation (HN, NF), pp. 387–394.
LOPSTRLOPSTR-2001-PotikasRG #nondeterminism #source code
A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs (PP, PR, MG), pp. 25–45.
PODSPODS-1999-Bonner #transaction #workflow
Workflow, Transactions, and Datalog (AJB), pp. 294–305.
ICLPJICSLP-1998-GrecoZ #algorithm
Greedy Algorithms in Datalog with Choice and Negation (SG, CZ), pp. 294–309.
LOPSTRLOPSTR-1997-SemeraroEMFF #framework #incremental #induction #logic #synthesis
A Logic Framework for the Incremental Inductive Synthesis of Datalog Theories (GS, FE, DM, NF, SF), pp. 300–321.
ICLPILPS-1997-GrecoS #optimisation #problem
NP Optimization Problems in Datalog (SG, DS), pp. 181–195.
LICSLICS-1996-Marcinkowski #bound #decidability
DATALOG SIRUPs Uniform Boundedness is Undecidable (JM), pp. 13–24.
PODSPODS-1995-LevyS #optimisation #query #semantics #source code
Semantic Query Optimization in Datalog Programs (AYL, YS), pp. 163–173.
PODSPODS-1995-MeccaB #sequence #transducer
Sequences, Datalog and Transducers (GM, AJB), pp. 23–35.
SIGIRSIGIR-1995-Fuhr #logic #probability #retrieval
Probabilistic Datalog — A Logic For Powerful Retrieval Methods (NF), pp. 282–290.
LOPSTRLOPSTR-1995-SemeraroEM #refinement #source code
Ideal Refinement of Datalog Programs (GS, FE, DM), pp. 120–136.
ICLPILPS-1995-Liu #named #set #tuple
Relationlog: A Typed Extension to Datalog with Sets and Tuples (ML), pp. 83–97.
ICLPILPS-1995-Toman #bottom-up #constraints #top-down
Top-Down beats Bottom-Up for Constraint Based Extensions of Datalog (DT), pp. 98–112.
PODSPODS-1994-Afrati #bound #exclamation #graph #query
Bounded Arity Datalog (!=) Queries on Graphs (FNA), pp. 97–106.
PODSPODS-1994-ChaudhuriK #approximate #question
Can Datalog be Approximated? (SC, PGK), pp. 86–96.
PODSPODS-1994-ChaudhuriV #complexity #equivalence #on the #recursion #source code
On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs (SC, MYV), pp. 107–116.
PODSPODS-1994-EiterGM
Adding Disjunction to Datalog (TE, GG, HM), pp. 267–278.
CADECADE-1994-FribourgP #bottom-up #constraints #evaluation #source code
Bottom-up Evaluation of Datalog Programs with Arithmetic Constraints (LF, MVP), pp. 311–325.
ICLPILPS-1994-OrosG #inheritance #source code
Inferring Inheritance from Datalog Programs (MAO, PYG), p. 680.
ICLPILPS-1994-TomanCR #constraints #integer
Datalog with Integer Periodicity Constraints (DT, JC, DSR), pp. 189–203.
PODSPODS-1993-Chaudhuri #recursion
Finding Nonrecursive Envelopes for Datalog Predicates (SC), pp. 135–146.
PODSPODS-1993-LevyMSS #equivalence #satisfiability
Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions (AYL, ISM, YS, OS), pp. 109–122.
SEKESEKE-1993-PirriP #deduction #design #taxonomy #using
Using Datalog as a Language for Data Dictionary Design: A Deductive Support (FP, CP), pp. 304–308.
PODSPODS-1992-ChaudhuriV #equivalence #on the #recursion #source code
On the Equivalence of Recursive and Nonrecursive Datalog Programs (SC, MYV), pp. 55–66.
PODSPODS-1992-Dong #query #tool support
Datalog Expressiveness of Chain Queries: Grammar Tools and Characterizations (GD), pp. 81–90.
PODSPODS-1992-LevyS #constraints
Constraints and Redundancy in Datalog (AYL, YS), pp. 67–80.
PODSPODS-1991-AfratiCY #on the #polynomial
On Datalog vs. Polynomial Time (FNA, SSC, MY), pp. 13–25.
PODSPODS-1991-HillebrandKMV #bound #tool support
Tools for Datalog Boundedness (GGH, PCK, HGM, MYV), pp. 1–12.
PODSPODS-1991-SeibL #source code
Parallelizing Datalog Programs by Generalized Pivoting (JS, GL), pp. 241–251.
PODSPODS-1991-SeshadriN #on the #query #recursion
On the Expected Size of Recursive Datalog Queries (SS, JFN), pp. 268–279.
PODSPODS-1990-KolaitisV #case study #on the #power of #tool support
On the Expressive Power of Datalog: Tools and a Case Study (PGK, MYV), pp. 61–71.
PODSPODS-1990-Ross #composition #set #source code
Modular Stratification and Magic Sets for DATALOG Programs with Negation (KAR), pp. 161–171.
SIGMODSIGMOD-1990-GangulyST #framework #parallel #query
A Framework for the Parallel Processing of Datalog Queries (SG, AS, ST), pp. 143–152.
PODSPODS-1989-Bonner #linear #recursion
Hypothetical Datalog: Negation and Linear Recursion (AJB), pp. 286–300.
PODSPODS-1989-BrodskyS #constraints #source code
Inference of Monotonicity Constraints in Datalog Programs (AB, YS), pp. 190–199.
PODSPODS-1989-LakshmananM #game studies #induction #power of
Inductive Pebble Games and the Expressive Power of Datalog (VSL, AOM), pp. 301–310.
PODSPODS-1989-SagivV #database #infinity #query #safety
Safety of Datalog Queries over Infinite Databases (YS, MYV), pp. 160–171.
PODSPODS-1989-Ullman #bottom-up #top-down
Bottom-Up Beats Top-Down for Datalog (JDU), pp. 140–149.
SIGMODSIGMOD-1989-Dong #database #distributed #on the #query
On Distributed Processibility of Datalog Queries by Decomposing Databases (GD), pp. 26–35.
PODSPODS-1988-RamakrishnanBK #optimisation #query
Optimizing Existential Datalog Queries (RR, CB, RK), pp. 89–102.
SIGMODSIGMOD-1988-AbiteboulH
Data Functions, Datalog and Negation (SA, RH), pp. 143–153.
SIGMODSIGMOD-1988-KrishnamurthyRS #effectiveness #framework #safety #testing
A Framework for Testing Safety and Effective Computability of Extended Datalog (RK, RR, OS), pp. 154–163.
PODSPODS-1987-Sagiv #optimisation #source code
Optimizing Datalog Programs (YS), pp. 349–362.
VLDBVLDB-1987-CeriT #algebra #equation #optimisation #query
Optimization of Systems of Algebraic Equations for Evaluating Datalog Queries (SC, LT), pp. 31–41.
VLDBVLDB-1987-Gardarin #recursion #source code
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs (GG), pp. 21–30.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.