A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Filters
Fixpoint iteration with subsumption in deductive databases
1995
Journal of Intelligent Information Systems
Preserved Fulltext
Fixpoint Iteration with Subsumption in Deductive Databases B C D E F G E H I P Q R S T D E G U H V D E U D E I W D R R T W U C X ¡ © ¦ £ X ¦ ¤ Y ¢ ¤ ` ¥ ¢ 5 ¢ £ 8 3 a b c d e f g c h i p g d q r i s d ...
doi:10.1007/bf00961871
fatcat:hibngiudl5eofgvoyyovamd4py
Optimizing existential queries in stratifiable deductive databases
2005
Proceedings of the 2005 ACM symposium on Applied computing - SAC '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We reconsider query evaluation in stratifiable deductive databases using Magic Sets. ...
To this end, the query answering process is optimized in such a way that after the generation of one appropriate answer fact with respect to a (derived) existential query, the redundant computations of ...
. , |ad1|}.Definition 9 (Subsumption Rules). Let R be a stratifiable deductive rule set, and ms(R Q ) the magic rules with respect to a query Q. ...
doi:10.1145/1066677.1066821
dblp:conf/sac/Behrend05
fatcat:khx7alipjbcqvdvteuhpllikkm
A Uniform Fixpoint Approach to the Implementation of Inference Methods for Deductive Databases
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Within the research area of deductive databases three different database tasks have been deeply investigated: query evaluation, update propagation and view updating. ...
In this paper, we present such a uniform approach in form of a new version of the soft consequence operator. ...
In [17] it has been shown that the perfect model of a stratifiable database D is identical with the iterated fixpoint model M i D of D. ...
arXiv:1108.5451v1
fatcat:cyy6y7bk2nfhbg2pmkkoibvl4m
Tabling with Support for Relational Features in a Deductive Database
2013
Electronic Communications of the EASST
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In this paper, we show how unusual operations in deductive systems can be integrated with tabling. ...
As well, deductive database implementations benefit from this technique for implementing query solving engines. ...
So, first store the new call in CT and then, return all previous answers in ET (from a previous fixpoint iteration). ...
doi:10.14279/tuj.eceasst.55.819
dblp:journals/eceasst/Saenz-Perez12
fatcat:hsbef7lcznc2lblbzxaieol744
Model generation and state generation for disjunctive logic programs
1997
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
On each stratum of the program, this operator converges in at most to iterations. ...
I> This paper investigates two fixpoint approaches for minimal model reasoning with disjunctive logic programs 9. ...
database is finite, the operator 5r~ M reaches its least fixpoint in a finite number of iterations. ...
doi:10.1016/s0743-1066(96)00116-1
fatcat:qbcujabpubat7nrr64baywkdvi
Towards a New Step of Logic Paradigm
[chapter]
1990
Deductive and Object-Oriented Databases
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In other words, we apply fixpoint theory to databases with another operator than the classical immediate consequence operator of van Emden and Kowalski. ...
Deductive and Object-Oriented Databases W. Kim, J.-M. Nicolas, and S. ...
The least fixpoint of Τ on a function-free Horn database DB can be constructed by iteratively computing the sets TT n (DB) for increasing n. ...
doi:10.1016/b978-0-444-88433-6.50008-3
fatcat:jgqxvfczlvgargtfqxaz6engrm
Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP
2019
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Our implementation is based on the TCLP framework available in Ciao Prolog and is one-third the size of the initial fixpoint implementation in CiaoPP. ...
In this adaptation, the tabling engine drives the fixpoint computation, while the constraint solver handles the LUB of the abstract substitutions of different clauses. ...
Tabling has been successfully applied in a variety of contexts, including deductive databases, program analysis, semantic Web reasoning, and model checking. ...
doi:10.1017/s1471068419000383
fatcat:yikav2352zg6jjxasnhnwor7j4
DECLARE and SDS: Early efforts to commercialize deductive database technology
1994
The VLDB journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
SDS offers the functionality of deductive reasoning in a distributed, heterogeneous database environment. ...
We argue that heuristic knowledge and control should be made an integral part of deductive databases. ...
In particular we would like to thank the former members of the DECLARE team in Munich: Riidiger Azone, Olaf Biernath, Maria Friedrich, Lothar Kappen, Franz Kronseder, Eva Krfiger, Benedikt Nuiding, Elisabeth ...
doi:10.1007/bf01228881
fatcat:7atpx6qz6fhjdlmktuvdxubupm
Abstract interpretation: A kind of magic
1995
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Magic sets and, more recently, magic templates have been used in the field of deductive databases to facilitate efficient bottom-up evaluation of database queries. ...
In this paper we give a new and very simple proof that this approach is equivalent to the collecting interpretation of the abstract interpretation framework for logic programs of Mellish. ...
It is likely that such methods can be combined with evaluation techniques in the deductive database field such as semi-naive evaluation. ...
doi:10.1016/0304-3975(94)00223-6
fatcat:jiwsdsoab5g5biqwbx3h4q3thy
Logic and Databases: Past, Present, and Future
1997
The AI Magazine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
I review developments in the field, assess contributions, consider the status of implementations of deductive databases, and discuss future work needed in deductive databases. Articles ...
Gallaire, Minker, and Nicolas stated that logic and databases was a field in its own right. This was the first time that this designation was made. ...
The full paper is dedicated in honor of Hervé Gallaire and Jean-Marie Nicolas with whom I have worked as co-author, co-editor, colleague, and friend and who have helped to make the field of deductive databases ...
doi:10.1609/aimag.v18i3.1304
dblp:journals/aim/Minker97
fatcat:6foa4j2a45cabojbsyxj7rwpfq
Well-founded ordered search: Goal-directed bottom-up evaluation of well-founded models
1997
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we extend Ordered Search to compute the well-founded semantics for all (nonfloundering) programs with negation. ...
1> There have been several evaluation mechanisms proposed for computing query answers based on the well-founded semantics, for programs with negation. ...
Iterative Fixpoint Evaluation The fundamental step in iterative fixpoint evaluation is a derivation. ...
doi:10.1016/s0743-1066(96)00110-0
fatcat:2ueyuol7kzakzmrgf2dcqtvpna
Logic programming approach to automata-based decision procedures
2017
Journal of Logical and Algebraic Methods in Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog queries. ...
We then show how the use of advanced implementation techniques for Logic Programs, in particular the use of tabling in the XSB system, yields a considerable improvement in performance over more traditional ...
The type restrictions guarantee that the fixpoint iteration terminates after finitely many steps. ...
doi:10.1016/j.jlamp.2016.02.005
fatcat:7hdawowlbrbrvg6rrvthtth6ay
Rule ordering in bottom-up fixpoint evaluation of logic programs
1994
IEEE Transactions on Knowledge and Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Logic programs can be evaluated bottom-up by repeatedly applying all rules, in "iterations", until the fixpoint is reached. ...
However, it is often desirable-and in some cases, e.g. programs with stratified negation, even necessary to guarantee the semantics-to apply the rules in some order. ...
Introduction Bottom-up evaluation of logic programs is an important issue in deductive database applications. ...
doi:10.1109/69.298169
fatcat:7rsxrfj24vfrrnfr3lk7fuvruq
Inprocessing Rules
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Such inprocessing SAT solvers witness the fact that implementing additional deduction rules in CDCL solvers leverages the efficiency of state-of-the-art SAT solving further. ...
In this paper we establish formal underpinnings of inprocessing SAT solving via an abstract inprocessing framework that covers a wide range of modern SAT solving techniques. ...
S (subsumption) C is subsumed in F . HS (hidden subsumption) HLA(F, C) is subsumed in F . AS (asymmetric subsumption) ALA(F, C) is subsumed in F . T (tautology) C is a tautology. ...
doi:10.1007/978-3-642-31365-3_28
fatcat:xwdkffjoxzgbfae42h64rfrkzm
Algebraic optimization of recursive queries
1992
Data & Knowledge Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the PRISMA project we have developed a tightly-coupled distributed database, on a multiprocessor machine, with two user interfaces: SQL and PRISMAIog. ...
Over the past few years, much attention has been paid to deductive databases. They offer a logic-based interface, and allow formulation of complex recursive queries. ...
Deductive databases In deductive databases there are two main optimization strategies for recursive programs. ...
doi:10.1016/0169-023x(92)90029-b
fatcat:tcydmhdf6zcgri3ty3dmhgmd5i
« Previous
Showing results 1 — 15 out of 132 results