Using automata theory for characterizing the semantics of terminological cycles
- 1 September 1996
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 18 (2) , 175-219
- https://doi.org/10.1007/bf02127747
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Terminological reasoning is inherently intractableArtificial Intelligence, 1990
- Expressiveness and tractability in knowledge representation and reasoning1Computational Intelligence, 1987
- On the complementation of Büchi automataTheoretical Computer Science, 1986
- Fixed-point extensions of first-order logicAnnals of Pure and Applied Logic, 1986
- Relational queries computable in polynomial timeInformation and Control, 1986
- An Overview of the KL‐ONE Knowledge Representation System*Cognitive Science, 1985
- Fixed-point extensions of first-order logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- On recursive axioms in deductive databasesInformation Systems, 1983
- Fixed point theorems and semantics: a folk taleInformation Processing Letters, 1982
- Naive Set TheoryPublished by Springer Nature ,1974