Partial evaluation of queries in deductive databases

Sakama, Chiaki

doi:10.1007/bf03037140

Cited by 4 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The specialisation calculus is also related to other work on conditioned answers 4, 16,19] and on the treatment of unknown information 21]. It allows us to obtain conditioned answers after the specialisation of a rule base with the known information.…”

Section: Discussionmentioning

confidence: 99%

Specialisation calculus and communication

Puyol-Gruart

Godo

Sierra

1998

International Journal of Approximate Reasoning

View full text Add to dashboard Cite

In this paper we propose a deductive calculus aiming at improving the query/simple-answer communication behaviour of many intelligent systems. In an uncertain reasoning context this behaviour consists of getting certainty values for propositions as answers to queries. Instead, with our calculus, answers to queries will become sets of formulas: a set of propositions and a set of specialised rules containing propositions for which the truth value is unknown in their left part. This type of behaviour is much more informative because it returns to users not only the answer to a query but all the relevant information, related to the answer, necessary to, possibly, improve the solution. To exemplify the general approach a family of propositional rule-based languages founded on multiple-valued logics is presented and formalised. The deductive system de ned on top of these languages is based on a Specialisation Inference Rule (SIR): (A1^A2 ^An ! P; V); (A1; V 0)`(A2^: : :^An ! P; V 00), where V , V 0 and V 00 are truth intervals. This inference rule provides a way of generating rules containing less conditions in their premise by eliminating the conditions for which a de nitive truth value already exists. The soundness and atom completeness of the deductive system are proved. The implementation of this deductive calculus is based on partial deduction techniques. Finally, an example of the application of the specialisation calculus to a multi-agent system is provided.

show abstract

Section: Discussionmentioning

confidence: 99%

Specialisation calculus and communication

Puyol-Gruart

Godo

Sierra

1998

International Journal of Approximate Reasoning

View full text Add to dashboard Cite

show abstract

“…Specialization of these algorithms [9] for a given scene have yielded better performance rather than general purpose approaches. Similarly in databases [10], general purpose queries have been transformed into specific programs optimized for a given input. Similarly, training neural networks [11] for a given scenario has improved its performance.…”

Section: Specialization Mechanisms Applied To Different Domainsmentioning

confidence: 99%

Towards highly optimized real-time middleware for software product-line architectures

et al. 2006

View full text Add to dashboard Cite

show abstract

“…We informally introduce a few such meta-level specifications, that rely on meta-programming [58,62,63,59]. Finally, we briefly mention further applications of meta-level specifications towards enhanced database management systems.…”

Section: Introductionmentioning

confidence: 99%

Towards intelligent databases

Bry¹

1993

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Partial evaluation of queries in deductive databases

Cited by 4 publications

References 6 publications

Specialisation calculus and communication

Specialisation calculus and communication

Towards highly optimized real-time middleware for software product-line architectures

Towards intelligent databases

Contact Info

Product

Resources

About