Filters








83 Hits in 9.3 sec

Swift Logic for Big Data and Knowledge Graphs [chapter]

Luigi Bellomarini, Georg Gottlob, Andreas Pieris, Emanuel Sallinger
2017 Lecture Notes in Computer Science  
Many modern companies wish to maintain knowledge in the form of a corporate knowledge graph and to use and manage this knowledge via a knowledge graph management system (KGMS).  ...  We formulate various requirements for a fully-fledged KGMS.  ...  Notice that as soon as we have an algorithm for solving the tuple inference problem under a certain Datalog ± language L, then we have an algorithm for computing the certain answers to a conjunctive query  ... 
doi:10.1007/978-3-319-73117-9_1 fatcat:kplzy4npfbeczixmten2iaaolu

Swift Logic for Big Data and Knowledge Graphs

Luigi Bellomarini, Georg Gottlob, Andreas Pieris, Emanuel Sallinger
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
Many modern companies wish to maintain knowledge in the form of a corporate knowledge graph and to use and manage this knowledge via a knowledge graph management system (KGMS).  ...  We formulate various requirements for a fully fledged KGMS.  ...  -Warded Datalog ± is suitable for querying RDF graphs.  ... 
doi:10.24963/ijcai.2017/1 dblp:conf/ijcai/BellomariniGPS17 fatcat:axk23hme5rd3dlh773pc4tgu4q

In-Memory Parallelization of Join Queries Over Large Ontological Hierarchies

Dimitris Bilidas, Manolis Koubarakis
2020 Zenodo  
the query answering process even more, for systems that provide complete answers with respect to such ontological ax- ioms.  ...  Specifically, we present a join im- plementation that allows to achieve any desired degree of parallelism on arbitrary join queries and RDF graphs stored in memory using compact vertical partitioning.  ...  The first one is query rewriting, which is similar in spirit with backward chaining of datalog evaluation.  ... 
doi:10.5281/zenodo.3941666 fatcat:3afyfre5d5auxbjfcjficzmeoe

A survey of large-scale reasoning on the Web of data

Grigoris Antoniou, Sotiris Batsakis, Raghava Mutharaju, Jeff Z. Pan, Guilin Qi, Ilias Tachmazidis, Jacopo Urbani, Zhangquan Zhou
2018 Knowledge engineering review (Print)  
To address this problem, several high-performance reasoning systems, which mainly implement distributed or parallel algorithms, have been proposed in the last few years.  ...  These systems differ significantly; for instance in terms of reasoning expressivity, computational properties such as completeness, or reasoning objectives.  ...  OWL-2QL has mainly been established for tractable query answering where query answering is done through query rewriting -since materialization is not always possible.  ... 
doi:10.1017/s0269888918000255 fatcat:bergc5uphbceznigppektgvzrm

Large-Scale Reasoning with (Semantic) Data

Grigoris Antoniou, Sotiris Batsakis, Ilias Tachmazidis
2014 Proceedings of the 4th International Conference on Web Intelligence, Mining and Semantics (WIMS14) - WIMS '14  
To address this problem, several highperformance reasoning systems, which mainly implement distributed or parallel algorithms, have been proposed in the last few years.  ...  These systems differ significantly; for instance in terms of reasoning expressivity, computational properties such as completeness, or reasoning objectives.  ...  OWL-2QL has mainly been established for tractable query answering where query answering is done through query rewriting -since materialization is not always possible.  ... 
doi:10.1145/2611040.2611041 dblp:conf/wims/AntoniouBT14 fatcat:g3ljwx4eqrg3po242ckkv6rwme

Bounds on the propagation of selection into logic programs

C. Beeri, P. Kanellakis, F. Bancilhon, R. Ramakrishnan
1987 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '87  
Selection propagation is always possible for database programs (i.e., tirst-order formula programs) and is often a desirable optimization.  ...  In particular, we study the class of chain programs and formalize selection propagation on such a logic program as: the task of finding an equivalent program containing only monadic derived predicates.  ...  Moshe Vardi pointed out an alternative proof of Theorem 3.3 part (I), which uses WSlS on IG.  ... 
doi:10.1145/28659.28683 dblp:conf/pods/BeeriKBR87 fatcat:ln5lk6ot4zafvdklmjb5s7ooyi

Bounds on the propagation of selection into logic programs

Catriel Beeri, Paris Kanellakis, Francois Bancilhon, Raghu Ramakrishnan
1990 Journal of computer and system sciences (Print)  
Selection propagation is always possible for database programs (i.e., tirst-order formula programs) and is often a desirable optimization.  ...  In particular, we study the class of chain programs and formalize selection propagation on such a logic program as: the task of finding an equivalent program containing only monadic derived predicates.  ...  Moshe Vardi pointed out an alternative proof of Theorem 3.3 part (I), which uses WSlS on IG.  ... 
doi:10.1016/0022-0000(90)90035-j fatcat:5mkro4bjhncxleun6zk5vtmrrm

Data Science with Vadalog: Bridging Machine Learning and Reasoning [chapter]

Luigi Bellomarini, Ruslan R. Fayzrakhmanov, Georg Gottlob, Andrey Kravchenko, Eleonora Laurenza, Yavor Nenov, Stéphane Reissfelder, Emanuel Sallinger, Evgeny Sherkhonov, Lianlong Wu
2018 Lecture Notes in Computer Science  
There is currently a perceived disconnect between the traditional approaches for data science, typically based on machine learning and statistical modelling, and systems for reasoning with domain knowledge  ...  Following the recent successful examples of large technology companies, many modern enterprises seek to build knowledge graphs to provide a unified view of corporate knowledge and to draw deep insights  ...  Note that this is a complementary alternative -in case algorithms should be used out-of-the-box based on existing systems and approaches, and no modification or close interaction with the knowledge graph  ... 
doi:10.1007/978-3-030-00856-7_1 fatcat:y6vhqytaqbfg7ev4li2zkn53m4

On the power of magic

Catriel Beeri, Raghu Ramakrishnan
1991 The Journal of Logic Programming  
We describe in detail several algorithms for rewriting a program. These algorithms generalize the counting and magic-sets algorithms to work with arbitrary programs.  ...  Then the program defines a derived relation describing ancestors, and the query asks for the ances-  ...  Accordingly, we define a sip strategy for computing the answers to a query expressed using a set of Datalog rules, and a set of sips, one for each adornment of a rule head, as follows.  ... 
doi:10.1016/0743-1066(91)90038-q fatcat:zvduh4pqmbb7tmhxt4xjxirasi

Reasoning with Probabilistic Logics [article]

Riccardo Zese
2015 arXiv   pre-print
In particular, we present in detail the system TRILL P, which computes the probability of queries w.r.t. probabilistic knowledge bases, which has been implemented in Prolog.  ...  In this paper, we illustrate the work we have done in this research field by presenting a probabilistic semantics for description logics and reasoning and learning algorithms.  ...  All-MinAs(Q, K) is the set of all MinAs for query Q in knowledge base K.  ... 
arXiv:1405.0915v3 fatcat:6pi6phh26nbvjjmuoxoof2yp5y

Developing and certifying Datalog optimizations in coq/mathcomp

Pierre-Léo Bégay, Pierre Crégut, Jean-François Monin
2021 Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs  
We also thank Théo Winterhalter and Arthur Azevedo De Amorim for helping us getting started with some aspects of the Coq formalization.  ...  Acknowledgements We would like to thank the anonymous reviewers for their numerous and helpful comments, which resulted in a dramatically enriched paper.  ...  It is based on a Z3 [28] implementation of Datalog, called [17] , with network-oriented modifications made for scalability.  ... 
doi:10.1145/3437992.3439913 fatcat:qw3wsxamjvb23ngm237pkhlawe

CoLab: A hybrid knowledge representation and compilation laboratory

Harold Boley, Philipp Hanschke, Knut Hinkelmann, Manfred Meyer
1995 Annals of Operations Research  
Knowledge bases for real-world domains such as mechanical engineering require expressive and efficient representation and processing tools.  ...  of knowledge, as well as for exploring the synergetic collaboration of the knowledge representation formalisms .  ...  Richter for encouraging us computer scientists to go into the real-world area of mechanical engineering.  ... 
doi:10.1007/bf02031716 fatcat:djzxr64dgvce5bdiug7sdfgoca

Formulog: Datalog for SMT-Based Static Analysis (Extended Version) [article]

Aaron Bembenek
2020 arXiv   pre-print
Formulog extends the logic programming language Datalog with a first-order functional language and mechanisms for representing and reasoning about SMT formulas; a novel type system supports the construction  ...  Our case studies demonstrate that a range of SMT-based analyses can naturally and concisely be encoded in Formulog, and that -- thanks to this encoding -- high-level Datalog-style optimizations can be  ...  Extending Datalog with our fragment of ML is not foundational, as it can relatively easily be translated to Datalog rules (this would not necessarily be the case for a higher-order fragment of ML).  ... 
arXiv:2009.08361v2 fatcat:5jcjczcvdnfxdf4wkil7jskzxm

Belief reasoning in MLS deductive databases

Hasan M. Jamil
1999 Proceedings of the 1999 ACM SIGMOD international conference on Management of data - SIGMOD '99  
We strive t o d e v elop a poised and practical logical characterization of MLS databases for the rst time based on the inherently di cult concept of non-monotonic inheritance.  ...  The impetus for our current research is this need to provide an adequate framework for belief reasoning in MLS databases.  ...  We have shown that MultiLog is a natural extension of Datalog. The scheme presented here for the implementation of MultiLog based on rewriting into CORAL has been shown to be consistent.  ... 
doi:10.1145/304182.304192 dblp:conf/sigmod/Jamil99 fatcat:xmybi3xg4zbvlnhxji7fnkquxa

Belief reasoning in MLS deductive databases

Hasan M. Jamil
1999 SIGMOD record  
We strive t o d e v elop a poised and practical logical characterization of MLS databases for the rst time based on the inherently di cult concept of non-monotonic inheritance.  ...  The impetus for our current research is this need to provide an adequate framework for belief reasoning in MLS databases.  ...  We have shown that MultiLog is a natural extension of Datalog. The scheme presented here for the implementation of MultiLog based on rewriting into CORAL has been shown to be consistent.  ... 
doi:10.1145/304181.304192 fatcat:7ung7333lzasbnggze45jbs7qq
« Previous Showing results 1 — 15 out of 83 results