Recursively indefinite databases
- 2 August 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 116 (1) , 151-194
- https://doi.org/10.1016/0304-3975(93)90223-g
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On the representation and querying of sets of possible worldsTheoretical Computer Science, 1991
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- Some computational aspects of circumscriptionJournal of the ACM, 1990
- An axiomatic definition of context-free rewriting and its application to NLC graph grammarsTheoretical Computer Science, 1987
- Querying logical databasesJournal of Computer and System Sciences, 1986
- Applications of circumscription to formalizing common-sense knowledgeArtificial Intelligence, 1986
- AlternationJournal of the ACM, 1981
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970