917 Hits in 3.6 sec

Datalog Unchained

Victor Vianu
2021 Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database 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,  ...  These languages also provide a unified formalism that can express important classes of queries including fixpoint, while, and all computable queries.  ...  The author is grateful to Pierre Bourhis and Luc Segoufin for their insightful comments on this paper.  ... 
doi:10.1145/3452021.3458815 fatcat:b6mnoptf2jgdtl27xrt54z7r5u

Datalog extensions for database queries and updates

Serge Abiteboul, Victor Vianu
1991 Journal of computer and system sciences (Print)  
The connection between the Datalog extensions and explicitly procedural languages, as well as tixpoint extensions of first-order logic, is also investigated.  ...  In particular, a new family of non-deterministic tixpoint extensions of first-order logic is considered. (0 1991 Academic Press, Inc.  ...  Similar insights are obtained by examining the connections between the safe Datalog extensions and fixpoint extensions of first-order logic.  ... 
doi:10.1016/0022-0000(91)90032-z fatcat:gmpg7xfplvhanktfyjwhy2jw6m

A Step Up in Expressiveness of Decidable Fixpoint Logics

Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2016 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16  
While guardedness has been applied fruitfully in the setting of first-order logic, the ability to add fixpoints while retaining decidability has been very limited.  ...  Using automata, we show that the resulting logics have a decidable satisfiability problem, and provide a fine study of the complexity of satisfiability.  ...  LFP is the natural extension of first-order logic with a fixpoint constructor.  ... 
doi:10.1145/2933575.2933592 dblp:conf/lics/BenediktBB16 fatcat:iofilouplngydidnz42r5dkpt4

Page 9238 of Mathematical Reviews Vol. , Issue 2001M [page]

2001 Mathematical Reviews  
Summary: “Nondeterministic extensions are needed in logic-based languages, such as first-order relational languages and Datalog, to enhance their expressive power and support the efficient formu- lation  ...  reformulation of first-order logic).  ... 

Page 476 of Mathematical Reviews Vol. , Issue 98A [page]

1998 Mathematical Reviews  
W. (3-VCTR-C; Victoria, BC) First-order functional languages and intensional logic. (English summary) J. Funct. Programming 7 (1997), no. 1, 73-101.  ...  From a practical point of view, our investigation provides a formal basis for the tagging mechanism that is used in the implementation of first-order functional languages on dataflow machines.” 98a:68022  ... 

Convergence of Datalog over (Pre-) Semirings

Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu, Yisu Remy Wang
2022 Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems  
We consider an ordered semiring, define the semantics of a datalog program as a least fixpoint in this semiring, and study the number of steps required to reach that fixpoint, if ever.  ...  Finally, we describe a class of ordered semirings on which one can use the semi-naive evaluation algorithm on any datalog program.  ...  (𝑓 • • • 𝑓 )𝑔(𝑓 • • • 𝑓 )𝑔 • • • 𝑔(𝑓 • • • 𝑓 ), similar to B PROOFS AND EXTENSIONS OF SECTION 4 B.1 Extensions to datalog • We describe here several extensions to the definition of datalog •  ... 
doi:10.1145/3517804.3524140 fatcat:vvst7emxfja3xmhzhcnkg4vd6u

A paraconsistent logic programming approach for querying inconsistent databases

Sandra de Amo, Mônica Sakuray Pais
2007 International Journal of Approximate Reasoning  
In this paper, we use a paraconsistent logic (LFI1) as the underlying logic for the specification of P-Datalog, a deductive query language for databases containing inconsistent information.  ...  We also present a bottomup evaluation method for P-Datalog programs based on an alternating fixpoint operator.  ...  Acknowledgements We would like to thank the anonymous referees whose really careful reading, useful comments and corrections have lead to significant improvement of our work.  ... 
doi:10.1016/j.ijar.2006.09.009 fatcat:tezgi5pygfeldi4klw5nauivy4

A Logic-Based Approach to Mining Inductive Databases [chapter]

Hong-Cheu Liu, Jeffrey Xu Yu, John Zeleznikow, Ying Guan
2007 Lecture Notes in Computer Science  
We present a logic-based inductive query language and illustrate the use of aggregates and exploit a new join operator to model specific data mining tasks.  ...  In this paper, we discuss the main problems of inductive query languages and optimisation issues.  ...  Part of the work performed while the first author was at University of Wollongong.  ... 
doi:10.1007/978-3-540-72584-8_35 fatcat:hag7ll35bvhjnol7gsutsx4unq

Extending the power of datalog recursion

Mirjana Mazuran, Edoardo Serra, Carlo Zaniolo
2012 The VLDB journal  
This monotonic extension greatly enhances the power of Datalog, while preserving (i) its declarative semantics and (ii) its amenability to efficient implementation via differential fixpoint and other optimization  ...  To solve this problem, we propose a simple extension, called Datalog F S (Datalog extended with frequency support goals), that supports queries and reasoning about the number of distinct variable assignments  ...  and least fixpoint) semantics of logic programs.  ... 
doi:10.1007/s00778-012-0299-1 fatcat:mf2jbhemqjaateedxvffa5njja

Fundamental properties of deterministic and nondeterministic extensions of Datalog

Serge Abiteboul, Eric Simon
1991 Theoretical Computer Science  
The first extension (Datalog '*) allows negations in both the bodies and heads of rules, (the -, indicates that negations are allowed in bodies and the * that they are allowed in heads).  ...  Fundamental properties of deterministic and nondeterministic extensions of Datalog from Abiteboul and Vianu (1988) are studied.  ...  Acknowledgment We thank Victor Vianu for very carefully reading a first draft of this paper and his many comments. 158 S. Abiteboul, E. Simon  ... 
doi:10.1016/0304-3975(51)90006-0 fatcat:gjngdaf4rvai3cqdn5z72yl7u4

Computed answer based on fuzzy knowledgebase - a model for handling uncertain information

Ágnes Achs
2005 European Society for Fuzzy Logic and Technology  
The basic question of our study is how we can give a possible model for handling uncertain information. This model is worked out in the framework of DATALOG.  ...  The concept of fuzzy knowledge-base will be defined as a quadruple of any background knowledge; a deduction mechanism; a connecting algorithm, and a decoding set of the program, which help us to determine  ...  A few years ago in [1] and [3] there was given a possible combination of Datalog-like languages and fuzzy logic.  ... 
dblp:conf/eusflat/Achs05 fatcat:npf7f7ylqfaxdlpxh6cegsv6sa

Active-U-Datalog: Integrating active rules in a logical update language [chapter]

Elisa Bertino, Barbara Catania, Vincenzo Gervasi, Alessandra Raffaetà
1998 Lecture Notes in Computer Science  
This requirement has led to the definition of several languages integrating logic and updates [1, 2, 9, 10, 15, 16, 31, 32, 35] .  ...  The aim of this paper is to propose a new language for integrating active rules, deductive rules and updates in a uniform logical context.  ...  The authors wish to thank the anonymous referees for their valuable suggestions leading to significant improvements of this paper.  ... 
doi:10.1007/bfb0055497 fatcat:ocesboh7ujbfjkvj7zrknhkmka

How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)?

Michael Benedikt
2018 Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - SIGMOD/PODS '18  
This has included significant developments in theory, increasing maturity of tools both in performance and usability, and the evolution of standards and benchmarks.  ...  The purpose of this article is to reflect on the use of reasoning for rewriting and simplifying relational database queries.  ...  I want to express my deep gratitude to Marcelo Arenas, Michaël Cadilhac, Phokion Kolaitis, Dan Olteanu, and Victor Vianu for extensive feedback on this work.  ... 
doi:10.1145/3196959.3196989 dblp:conf/pods/Benedikt18 fatcat:fmx4gidgbzb6fpxtvrsy4eyskm

Complexity and expressive power of logic programming

Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov
2001 ACM Computing Surveys  
The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols.  ...  This paper surveys various complexity and expressiveness results on different forms of logic programming.  ...  Acknowledgments We would like to thank Jan van den Bussche, Michael Gelfond, Leonid Libkin, Domenico Saccá, Moshe Vardi, and our colleagues for comments on a previous version of this paper and suggestions  ... 
doi:10.1145/502807.502810 fatcat:534rdwm6fbdmtn6ghdsntvca5e

Combining Safe Rules and Ontologies by Interfacing of Reasoners [chapter]

Uwe Aßmann, Jakob Henriksson, Jan Małuszyński
2006 Lecture Notes in Computer Science  
The proposed scheme is apt for logical rule languages such as Datalog, but also opens up for rules lacking logical semantics, e.g. the XML query and transformation language Xcerpt.  ...  The paper presents a scheme for hybrid integration of rules languages with constraints languages including but not restricted to Description Logic-based ontologies.  ...  ACKNOWLEDGEMENT The authors are very grateful to Boris Motik, Michael Wessel and Birte Glimm for their helpful comments on the state of query languages of existing DL reasoners and to Wlodek Drabent and  ... 
doi:10.1007/11853107_3 fatcat:lthxvetqdjes7gz5j3wemhy2zy
« Previous Showing results 1 — 15 out of 917 results