Recursively indefinite databases
From MaRDI portal
Publication:688672
DOI10.1016/0304-3975(93)90223-GzbMATH Open0797.68046OpenAlexW2168790889MaRDI QIDQ688672FDOQ688672
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
Recommendations
query answeringDatalog programhypergraph edge replacement graph grammarsindefinite informationlogical databasepartial knowledgerecursively indefinite databases
Cites Work
- Relationships between nondeterministic and deterministic tape complexities
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- On the representation and querying of sets of possible worlds
- Alternation
- Incomplete deductive databases
- The Semantics of Predicate Logic as a Programming Language
- Circumscription - a form of non-monotonic reasoning
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Some computational aspects of circumscription
- Querying logical databases
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- On the equivalence of recursive and nonrecursive Datalog programs
- The complexity of querying indefinite data about linearly ordered domains
- Mathematical Foundations of Computer Science 2005
- Web-like databases, non-well-founded sets and inductive definability
- Databases over a fixed infinite universe
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recursive queries and context-free graph grammars
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)