Recursively indefinite databases

DOI10.1016/0304-3975(93)90223-GMaRDI QIDQ688672zbMATH OpenOpenAlexFDO

Authors Ron van der Meyden

Publication date 6 December 1993

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(93)90223-g

zbMATH Keywords

query answeringDatalog programhypergraph edge replacement graph grammarsindefinite informationlogical databasepartial knowledgerecursively indefinite databases

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 219217
• A time bound on the materialization of some recursively defined views
• Completeness results for recursive data bases
• Data independent recursion in deductive databases
• Recursive queries and context-free graph grammars

Cites work

• scientific article; zbMATH DE number 4035178 (Why is no real title available?)
• scientific article; zbMATH DE number 4047053 (Why is no real title available?)
• scientific article; zbMATH DE number 4049099 (Why is no real title available?)
• scientific article; zbMATH DE number 4060749 (Why is no real title available?)
• scientific article; zbMATH DE number 4106286 (Why is no real title available?)
• scientific article; zbMATH DE number 17563 (Why is no real title available?)
• scientific article; zbMATH DE number 44213 (Why is no real title available?)
• scientific article; zbMATH DE number 67825 (Why is no real title available?)
• Alternation
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Circumscription - a form of non-monotonic reasoning
• Incomplete deductive databases
• On the representation and querying of sets of possible worlds
• Querying logical databases
• Relationships between nondeterministic and deterministic tape complexities
• Some computational aspects of circumscription
• The Semantics of Predicate Logic as a Programming Language
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

Cited in

(8)

• Recursive queries and context-free graph grammars
• On the equivalence of recursive and nonrecursive Datalog programs
• The complexity of querying indefinite data about linearly ordered domains
• Databases over a fixed infinite universe
• Mathematical Foundations of Computer Science 2005
• Web-like databases, non-well-founded sets and inductive definability
• scientific article; zbMATH DE number 219217 (Why is no real title available?)
• scientific article; zbMATH DE number 1414296 (Why is no real title available?)

This page was built for publication: Recursively indefinite databases

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