Filters








923 Hits in 4.1 sec

Datalog Unchained

Victor Vianu
2021 Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems  
Datalog variants with forward chaining semantics have been adopted in a variety of settings, including active databases, production systems, distributed data exchange, and data-driven reactive systems.  ...  This is the companion paper of a talk in the Gems of PODS series, that reviews the development, starting at PODS 1988, of a family of Datalog-like languages with procedural, forward chaining semantics,  ...  Special thanks to Serge Abiteboul for revisiting our joint work and providing many useful suggestions for the presentation.  ... 
doi:10.1145/3452021.3458815 fatcat:b6mnoptf2jgdtl27xrt54z7r5u

Modular Class Analysis with DATALOG [chapter]

Frédéric Besson, Thomas Jensen
2003 Lecture Notes in Computer Science  
datalog can be used to specify a variety of class analyses for object-oriented programs as variations of a common framework.  ...  In this framework, the result of analyzing a class is a set of datalog clauses whose least xpoint is the information analysed for.  ...  Following the object-oriented conventions, in a method body, the current active object is referenced as self . Execution of a program starts at the rst instruction of the method main of class main.  ... 
doi:10.1007/3-540-44898-5_2 fatcat:3k5u44fyivgwjmkylkcejrdxyi

Implementing Abstract Objects with Inheritance in Datalog neg

Hasan M. Jamil
1997 Very Large Data Bases Conference  
The reduction technique presented in this paper makes it possible to model object-oriented database features in a purely deductive system.  ...  Encapsulation has been given a formal treatment for the first time by introducing the so called conteztresolution scheme.  ...  The author would like to thank Mohammad Ashrafuzzaman of the University of Saskatchewan, Canada for reading the initial version of this paper and giving helpful comments.  ... 
dblp:conf/vldb/Jamil97 fatcat:wrwkrsevhra5njowfmxlkokigy

MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations [article]

Matthias Lanzinger, Stefano Sferrazza, Georg Gottlob
2022 arXiv   pre-print
On the basis of this characterisation, we propose similar many-valued semantics for rules with existential quantification in the head, extending Datalog+-.  ...  We propose MV-Datalog and MV-Datalog+- as extensions of Datalog and Datalog+-, respectively, to the fuzzy semantics of infinite-valued Lukasiewicz logic L as languages for effectively reasoning in scenarios  ...  Georg Gottlob is a Royal Society Research Professor and acknowledges support by the Royal Society in this role through the "RAISON DATA" project (Reference No. RP\R1\201074).  ... 
arXiv:2202.01718v4 fatcat:zqxxbun6tnci5fzk3mvses3y34

Datalog with non-deterministic choice computes NDB-PTIME

Fosca Giannotti, Dino Pedreschi
1998 The Journal of Logic Programming  
Another application of non-deterministic operators is in providing a logical basis for the notion of object identity, a crucial issue in the integration of deductive and object oriented databases [3] .  ...  These proposals are based on a non-deterministic choice construct for Datalog, which, in all cases, was designed on the basis of a declarative semantics choice models in [12] , and stable models in [13  ...  This work has been partially supported by the Commission of the European Communities -EC/US Cooperative Activity ECUS033.  ... 
doi:10.1016/s0743-1066(97)10004-8 fatcat:nu7u6i6qjjhkble22k2sbobqim

Metamodelling with Datalog and Classes: ConceptBase at the Age of 21 [chapter]

Matthias Jarke, Manfred A. Jeusfeld, Hans W. Nissen, Christoph Quix, Martin Staudt
2010 Lecture Notes in Computer Science  
ConceptBase is a deductive object-oriented database system intended for the management of metadata.  ...  The internal representation is based on a quadruple object structure, combined with advanced Datalog engines, such that many optimization techniques in ConceptBase have pioneered ideas later pursued in  ...  Such a proposition has the dual role as a fact in the sense of deductive databases, and as an identifiable object in an object-oriented database, thus forming the elementary bridge within the deductive  ... 
doi:10.1007/978-3-642-14681-7_6 fatcat:n33me2mmxrbilh44a7qtbzz2hi

Column-Oriented Datalog Materialization for Large Knowledge Graphs

Jacopo Urbani, Ceriel Jacobs, Markus Krötzsch
2016 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
The evaluation of Datalog rules over large Knowledge Graphs (KGs) is essential for many applications.  ...  In this paper, we present a new method of materializing Datalog inferences, which combines a column-based memory layout with novel optimization methods that avoid redundant inferences at runtime.  ...  Datalog thus provides an excellent basis for exploiting KGs to the full. Unfortunately, the implementation of Datalog inferencing on large KGs remains very challenging.  ... 
doi:10.1609/aaai.v30i1.9993 fatcat:gzpkfwgwazdhdaldvcssdgaova

Scaling Datalog for Machine Learning on Big Data [article]

Yingyi Bu, Vinayak Borkar, Michael J. Carey, Joshua Rosen, Neoklis Polyzotis, Tyson Condie, Markus Weimer, Raghu Ramakrishnan
2012 arXiv   pre-print
As a proof of concept, we consider two programming models--Pregel and Iterative Map-Reduce-Update---from the machine learning domain, and show how they can be captured in Datalog, tuned for a specific  ...  In this paper, we present the case for a declarative foundation for data-intensive machine learning systems.  ...  A runtime program searches for a good set of parameters based on the objective function.  ... 
arXiv:1203.0160v2 fatcat:tvhnfihhdvdglhd4f63vby3kaq

Column-Oriented Datalog Materialization for Large Knowledge Graphs (Extended Technical Report) [article]

Jacopo Urbani, Ceriel Jacobs, Markus Krötzsch
2016 arXiv   pre-print
The evaluation of Datalog rules over large Knowledge Graphs (KGs) is essential for many applications.  ...  In this paper, we present a new method of materializing Datalog inferences, which combines a column-based memory layout with novel optimization methods that avoid redundant inferences at runtime.  ...  Datalog thus provides an excellent basis for exploiting KGs to the full. Unfortunately, the implementation of Datalog inferencing on large KGs remains very challenging.  ... 
arXiv:1511.08915v2 fatcat:fnoxuh73lfabng676hdhjvbfja

Parallel evaluation of datalog programs by load sharing

Ouri Wolfson
1992 The Journal of Logic Programming  
The author thanks Nissim France2 and Oded Shmeli for helpful discussions and comments, and the referees for numerous suggestions and comments that helped improve this paper significantly.  ...  The reason for set-orientation is that database applications are data intensive, and they usually looks for all answers parallelizing tuple-oriented processing usually employs control-(or agenda-, in [  ...  A database for P is a relation for each predicate of P. An input to P is a relation for each extensional predicate.  ... 
doi:10.1016/0743-1066(92)90008-q fatcat:av6twllcmzhfzdqdxh3fx5a2zq

Using Datalog with Binary Decision Diagrams for Program Analysis [chapter]

John Whaley, Dzintars Avots, Michael Carbin, Monica S. Lam
2005 Lecture Notes in Computer Science  
BDD operations take time proportional to the size of the data structure, not the number of tuples in a relation, which leads to fast execution times. bddbddb is an effective tool for implementing a large  ...  A program analysis expressed in Datalog accepts an input program represented as a set of input relations and generates new output relations representing the results of the analysis.  ...  Benjamin Livshits and Christopher Unkel for their contribution of test cases and helpful feedback on their experiences with using bddbddb.  ... 
doi:10.1007/11575467_8 fatcat:62j4ssbogfhepimcxf5yo3d7zi

A general Datalog-based framework for tractable query answering over ontologies

Andrea Calì, Georg Gottlob, Thomas Lukasiewicz
2012 Journal of Web Semantics  
In this paper, as a first step towards closing the gap between the Semantic Web and databases, we introduce a family of expressive extensions of Datalog, called Datalog ± , as a new paradigm for query  ...  It paves the way for applying results from databases to the context of the Semantic Web.  ...  The following are some concept and role memberships, which express that the individual i 1 is a scientist who authors the article i 2 :  ... 
doi:10.1016/j.websem.2012.03.001 fatcat:yvjyqtstn5a6dlht5qhnpzgyoy

A general datalog-based framework for tractable query answering over ontologies

Andrea Calì, Georg Gottlob, Thomas Lukasiewicz
2009 Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '09  
In this paper, as a first step towards closing the gap between the Semantic Web and databases, we introduce a family of expressive extensions of Datalog, called Datalog ± , as a new paradigm for query  ...  It paves the way for applying results from databases to the context of the Semantic Web.  ...  The following are some concept and role memberships, which express that the individual i 1 is a scientist who authors the article i 2 :  ... 
doi:10.1145/1559795.1559809 dblp:conf/pods/CaliGL09 fatcat:l66en63uo5aqnhh2uvkhc3skye

Extending stratified datalog to capture complexity classes ranging from ${\cal P} to {\cal QH}$

Sergio Greco, Domenico Saccà, Carlo Zaniolo
2001 Acta Informatica  
This paper presents a unified solution to the problem of extending stratified DATALOG to express database complexity classes ranging from P to QH; QH is the query hierarchy containing the decision problems  ...  The solution is based on (i) stratified negation as the core of a simple, declarative semantics for negation, (ii) the use of a "choice" construct to capture the nondeterminism of stable models in a disciplined  ...  Introduction Designing declarative, logic-oriented database languages for wider application domains has been a key motivation of much of the research on databases and knowledge bases in the past years.  ... 
doi:10.1007/pl00013306 fatcat:44olmfk7srfnrkwis3yvhxanka

A logical approach to cooperative information systems

Elisa Bertino, Barbara Catania, Vincenzo Gervasi, Alessandra Raffaetà
2000 The Journal of Logic Programming  
Such language is then extended to deal with active rules in the style of Active-U-Datalog (E. Bertino, B. active rules, a system can eciently perform update propagation among dierent databases.  ...  Montesi, Toward deductive object databases, Theory and Practice of Object Systems 1 (1) (1995) 19±39) language to model queries and transactions in each source of data.  ...  The language obtained by extending U-Datalog with active rules and support for heterogeneous databases is called Heterogeneous U-Datalog (HU-Datalog for short).  ... 
doi:10.1016/s0743-1066(99)00024-2 fatcat:5w3ym2o6yngcbcoqitzlbtxali
« Previous Showing results 1 — 15 out of 923 results