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
Formal Methods in Databases and Software Engineering
Lakshmanan, Intuitionistic interpretation of deductive databases with incomplete information, Theoretical Computer Science 133 (1994) 267-306. ... Finally, we illustrate by example a method for transforming embedded implications into deductive databases with nulls. ... Datalog, the language of function-free Horn clauses, is the vehicle query language for deductive databases  . ...doi:10.1007/978-1-4471-3213-4_11 fatcat:zrleuoerozdy5dsiadtieo2ycq
Lakshmanan, Intuitionistic interpretation of deductive databases with incomplete information, Theoretical Computer Science 133 (1994) 267-306. ... Finally, we illustrate by example a method for transforming embedded implications into deductive databases with nulls. ... Datalog, the language of function-free Horn clauses, is the vehicle query language for deductive databases  . ...doi:10.1016/0304-3975(94)90191-0 fatcat:tjqjie43djftbc5floiq7qacyu
Traditional rule-based languages for deductive databases do not exploit the polymorphic nature of certain computations. ... Thus, the family of implicational embedded dependencies introduced and studied by R. Fagin can be included in the family of conditional embedded implicational dependencies. ...
The recognition problem for high-order objects is also investigated.” 94d:68033 68P15 03B70 Freitag, Burkhard (D-MUTU-D; Munich) Extending deductive database languages by embedded implications. ... Summary: “A bottom-up, set-oriented evaluation scheme for a de- ductive database query language with embedded implications is defined. ...
Expert rules obtained in practical case studies are represented as declarative rules in a deductive database. The expert rules are annotated by information describing their provenance and confidence. ... As the logical syntax of rules had been a problem in previous applications of deductive databases, we use specially designed domainspecific languages to make the rule syntax easier for non-programmers. ... We use the deductive database system DDbase, which works with an extension of Datalog, a logic programming language extending the well-known relational query language Sql. ...doi:10.4230/oasics.slate.2016.7 dblp:conf/slate/SeipelWANW16 fatcat:kkvkzquzlvdqfl2gsztezy3z5a
Summary: “This article introduces a temporal deductive database system featuring a logic programming language and an algebraic front-end. ... When needed during the evaluation of TRA expressions, slices of temporal relations over intervals can be retrieved from a given temporal deductive database by bottom-up evaluation strategies. ...
Lecture Notes in Computer Science
The semantics of answer sets () provides a flexible tool for interpreting various forms of extended logic programs and deductive databases. ... In particular, it is applicable to extended disjunctive databases whose rules may contain two kinds of negation as well as disjunctive conclusions. ... Acknowledgements This is a preliminary version of a paper extending research reported by the author at the 4th International Workshop on Extensions of Logic Programming in St Andrews and at the 2nd International ...doi:10.1007/3-540-58025-5_60 fatcat:cdguvxxwrfarrprfk7d5ymlmqa
Readings in Artificial Intelligence and Databases
There are two main parts to the paper, devoted respectively to conventional databases and deductive databases. ... In the first part, we focus on query languages, integrity modeling and maintenance, query optimization, and data dependencies. ... Support for the work on this paper was received by Herv~ Gallaire from Compagnie G~n~rale d'l~lectricit~ ...doi:10.1016/b978-0-934613-53-8.50020-0 fatcat:3jx23cl5czbclooawzwnzckxey
There are two main parts to the paper, devoted respectively to conventional databases and deductive databases. ... In the first part, we focus on query languages, integrity modeling and maintenance, query optimization, and data dependencies. ... Support for the work on this paper was received by Herv~ Gallaire from Compagnie G~n~rale d'l~lectricit~ ...doi:10.1145/356924.356929 fatcat:ecummytddreebcif2pnfzp4td4
Intuitionistic logic programming provides the notion of embedded implication in rule bodies, which can be used to reason about a current database modified by the antecedent. ... This can be applied to a system that translates SQL to Datalog to solve SQL WITH queries, for which relations are locally defined and can therefore be understood as added to the current database. ... Acknowledgements Thanks to the anonymous referees for their suggestions to improve this work, which has been partially supported by the Spanish MINECO project CAVI-ART (TIN2013-44742-C4-3-R), Madrid regional ...arXiv:1608.03535v2 fatcat:rfl3r47t2ff3to7piwwlj6dngm
The results of this comparison provide a rationale for the design and implementation of a new database system based on an Extended Object-Oriented model. ... The new model, the Prometheus Object-Oriented Model (POOM) and its query language Prometheus Object-Oriented Language (POOL), are discussed in relation to the requirements of taxonomic data and the Prometheus ... The Prometheus project was funded by BBSRC/ESPRC grants 95/BIF10516 & 754/BIF10518. ...doi:10.2307/1554970 fatcat:4bz4kafqinhf3hsfjyx4j52ps4
To address this limitation, we have developed a deductive database language in which a user can create hypotheses and draw inferences from them. ... Deductive databases are poor at tasks such as planning and design, where one must explore the consequences of hypothetical actions and possibilities. ... With this convention, a rulebase R and a predicate OUT uniquely define a database query. The language of embedded implications thus defines a set of queries. ...doi:10.1016/s0743-1066(96)00107-0 fatcat:f7x3tg6jczexlhndkf4lijro44
96m:68040 96m:68040 68P15 20M10 Herrmann, Christian (D-DARM; Darmstadt) On the undecidability of implications between embedded multivalued database dependencies. ... The main result is that both the strong and the weak well-founded semantics are preserved by the extended unfold transformation. ...
As a result, the actual modeling Dsl becomes executable; the declarative forward-chaining evaluation of deductive databases can be understood by the domain experts. ... In this paper, we discuss its representation by defining domain-specific languages ( Dsl s) for declarative expert rules. ... Rules in deductive databases and logic programming A deductive database (DDB) is a database which may carry out deductions based not only on facts but also on rules which are also stored in the database ...doi:10.1016/j.cl.2017.06.006 fatcat:htmoymfmfjex3jpwzolfdraira
Lecture Notes in Computer Science
Programming, Deductive databases, or Modal Logic languages (e.g., epistemic logic), etc..) are unsuccessful [9,10]. ... We extend the original syntax of such RDF sublanguge, which has only conjunction operator, by defining negation, disjunction and implication algebraic operators. ... Now we will extend this simple algebra for triples (T , ) by other RDF connectives: ∼ for negation, for disjunction, and → for implication. ...doi:10.1007/11766254_60 fatcat:nd3qxphv7zapznegdybap4z77e
« Previous Showing results 1 — 15 out of 11,515 results