Using automata theory for characterizing the semantics of terminological cycles
type: Item
instance of: scholarly article
title: Using automata theory for characterizing the semantics of terminological cycles
zbMATH Open document ID: 0891.68111
DOI: 10.1007/BF02127747
author: Franz Baader
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1998-03-04T00:00:00Z
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68N15
zbMATH DE Number: 1123685
zbMATH Keywords: terminological cycles
zbMATH Keywords: finite automata
Wikidata QID: Q57383740
MaRDI profile type: Publication
cites work: Q3664434
cites work: Q4012241
cites work: A refined architecture for terminological systems: Terminology = Schema + Views
cites work: Q4079524
cites work: Q3743300
cites work: Q4198056
cites work: Fixed-point extensions of first-order logic
cites work: Q4773706
cites work: Q3862379
cites work: Relational queries computable in polynomial time
cites work: Fixed point theorems and semantics: A folk tale
cites work: Q5740435
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Q4124327
cites work: On recursive axioms in deductive databases
cites work: Reasoning and revision in hybrid representation systems
cites work: Terminological reasoning is inherently intractable
cites work: On the complementation of Büchi automata
cites work: Q4012244
cites work: The complementation problem for Büchi automata with applications to temporal logic
cites work: Q4385530
DBLP publication ID: journals/amai/Baader96
description: scientific article; zbMATH DE number 1123685