scientific article; zbMATH DE number 176241

MaRDI QIDQ4035345zbMATH OpenFDO

Authors Jeffrey D. Ullman

Publication date 18 May 1993

zbMATH Keywords

chain rulesdecidabilityfactoring logic programslogical rulesparallelizabilityqueries

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15) Formal languages and automata (68Q45)

Review text

[For the entire collection see Zbl 0753.00031.] We shall summarize the relationship between languages and logical rules. There is a natural reduction from context-free grammars to a special case of logical rules called ``chain rules. We are able to answer difficult questions about logical queries through language-theoretic notations and results. The areas addressed include decidability, parallelizability, and the ability of factor logic programs into smaller components.

Recommendations

• scientific article; zbMATH DE number 176242
• scientific article; zbMATH DE number 3874667
• Comparison of expressive power of some query languages for databases
• Implementation of logical query languages for databases
• Logic as a query language: From Frege to XML

Cited in

(8)

• scientific article; zbMATH DE number 176242 (Why is no real title available?)
• Introduction to the language kernel from SQL-99
• scientific article; zbMATH DE number 847943 (Why is no real title available?)
• Syntax and semantics of hybrid database languages
• scientific article; zbMATH DE number 7301303 (Why is no real title available?)
• A practical theory of language-integrated query
• scientific article; zbMATH DE number 975699 (Why is no real title available?)
• Database semantics for natural language

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035345)