Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 1,596 papers for “deductive databases”

Deductive databases

Sáenz Pérez, Fernando · Library Open Repository (Universidad Complutense Madrid) · 2011

We have witnessed a new interest on deductive databases, languages and technologies. Also, emerging companies promoting deductive technologies transfer these technological outcomes to practical applications. Datalog, as a preeminent deductive query language has been extensively studied and is gaining a renowned interest thanks to their application to ontologies, semantic web, social networks, policy languages, and even for optimization. Thus, the aim of this talk is to try to look at deductive databases from a renowned viewpoint as more features are being added making them more appealing. In addition to review some relevant deductive systems and technologies, we'll base our presentation on the grounds of DES (Datalog Educational System), which includes several extensions to the pure Datalog language, and its interactiveness makes it an adequate tool to rapidly acquire fundamentals. Fernando Sáenz Pérez is currently an Associate Professor attached to the Department of Artifcial Intelligence and Sofware Engineering. Since 1987, he has been involved in researching at the University Complutense of Madrid (Spain), and at the Institut für Informatik at Aachen (Germany). His current research interests include: declarative and constraint programming, and deductive databases. He has taken part in many basic research projects and development projects in tight touch with several corporations such as Repsol YPF, Enagás, Cofares, and Ente Público RTVE, performing actual research transfers. Sáenz-Pérez has been a member of several program committees and referee for both international and national conferences. He is also actively involved in several free, open-source projects such as DES.

Cited by 0

Integrating Deductive Databases

Lihui Xu · 1997

This paper presents a method for integrating deductive databases. In our approach deductive databases are expressed in a functional database programming language in which rules are expressed as derived functions. For integrating the extensional parts of deductive databases, we use a binary relational ER model with subtyping as the common data model and propose a semi-automatic method to perform the integration. For integrating the intentional parts of deductive databases, we formally define equivalence and subsumption relationships between derived functions and propose a systematic method for comparing their semantics and integrating them. 1 Introduction Database integration has been studied for more than a decade, and with the recent boom in network technology and the wide use of information systems, database researchers have begun to observe the necessity of integrating multiple information sources, including databases, knowledge bases, and even file systems, in order to solve comm...

Cited by 0

Temporal Deductive Databases.

Marianne Baudinet, Jan Chomicki, Pierre Wolper · 1993

We survey a number of approaches to the problem of finite representation of infinite temporal extensions. Two of them, Datalog 1S and Templog, are syntactical extensions of Datalog; the third is based on repetition and arithmetic constraints. We provide precise characterizations of the expressiveness and the computational complexity of these languages. We also describe query evaluation methods.

Cited by 111

Preference Queries in Deductive Databases 1 Preference Queries in Deductive Databases

2008

In many applications, it may be natural to express not only mandatory requirements but also preferences on the data to be retrieved. Lacroix and Lavency 10) extended SQL with a notion of preference and showed how the resulting query language could still be translated into the domain relational calculus. We explore the use of preference in databases in the setting of datalog. We introduce the formalism of preference datalog programs (PDPs) as preference logic 2 Surya MANTHA programs without uninterpreted function symbols for this purpose. PDPs extend datalog not only with constructs to specify which predicate is to be optimized and the criterion for optimization but also with constructs to specify which predicate to be relaxed and the criterion to be used for relaxation. We can show that all of the soft requirements in 10) can be directly encoded in PDP. We first develop a naively-pruned bottom-up evaluation procedure that is sound and complete for computing answers to normal and relaxation queries when the PDPs are stratified, we then show how the evaluation scheme can be extended to the case when the programs are not necessarily stratified, and finally we develop an extension of the magic templates method for datalog 14) that constructs an equivalent but more efficient program for bottom-up evaluation. x1 Motivation and Approach The motivation for our work stems from the observation that traditional database query languages allow the user to express only the mandatory requirements on the data to be retrieved from a database. In many applications, it is more natural to express queries in terms of both mandatory, or hard, requirements as well as preferences, or soft requirements. Lacroix and Lavency 10) explore this idea with queries of the form

Cited by 0

Paraconsistent disjunctive deductive databases

V. S. Subrahmanian · 2002

The author develops a theory of disjunctive logic programming, with negations allowed to appear both in the head of a clause and in the body. As such programs can easily contain inconsistent information (with respect to the intuitions of two-valued logic), this means that the formalism allows reasoning about systems that are intuitively inconsistent but yet have models (in nonclassical model theory). Such an ability is important because inconsistencies may occur very easily during the design and development of deductive databases and/or expert systems. The author also develops a theory of disjunctive deductive databases that (perhaps) contain inconsistent information. The author shows how to associate, with any such database, an operator that maps multivalued-model states to multivalued-model states. It is shown that this operator has a least fixed point which is identical to the set of all variable-free disjunctions that are provable from the database under consideration. A procedure to answer queries to such databases is devised. Soundness and completeness results are proved. The techniques introduced are fairly general. However, the results are applicable to databases that are quantitative in nature.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cited by 14

Distributed deductive databases, declaratively

Robert J. Simmons, Bernardo Toninho, Frank Pfenning · 2011

We present the design of L10, a rich forward-chaining (a.k.a. "bottom-up") logic programming language. L10 allows parallel computation to be explicitly specified through the use of worlds, a logically-motivated concept that has been used to describe distributed functional programming. An interpreter for L10 runs these logic programs on top of the infrastructure of the X10 programming language, and is responsible for mapping between L10's worlds and places, the related X10 construct for describing distributed computation.

Cited by 3

Novelty in deductive databases

Éric Grégoire, Pierre Marquis · OpenGrey (Institut de l'Information Scientifique et Technique) · 1993

International audience

Cited by 0