Recursively indefinite databases
From MaRDI portal
Publication:688672
DOI10.1016/0304-3975(93)90223-GzbMath0797.68046OpenAlexW2168790889MaRDI QIDQ688672
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
query answeringDatalog programhypergraph edge replacement graph grammarsindefinite informationlogical databasepartial knowledgerecursively indefinite databases
Related Items
On the equivalence of recursive and nonrecursive Datalog programs, The complexity of querying indefinite data about linearly ordered domains
Cites Work
- Querying logical databases
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Circumscription - a form of non-monotonic reasoning
- On the representation and querying of sets of possible worlds
- Incomplete deductive databases
- Relationships between nondeterministic and deterministic tape complexities
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Some computational aspects of circumscription
- Alternation
- The Semantics of Predicate Logic as a Programming Language
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item