Using automata theory for characterizing the semantics of terminological cycles

DOI10.1007/BF02127747zbMath0891.68111WikidataQ57383740 ScholiaQ57383740MaRDI QIDQ1380409

Franz Baader

Publication date: 4 March 1998

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

finite automataterminological cycles

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of programming languages (68N15) Knowledge representation (68T30)

Related Items (9)

The Fuzzy Description Logic $\mathsf{G}\text{-}{\mathcal{F\!L}_0} $ with Greatest Fixed-Point Semantics ⋮ Reasoning in fuzzy description logics using automata ⋮ Generalized satisfiability for the description logic \(\mathcal{ALC}\) ⋮ Extensions of unification modulo ACUI ⋮ Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ ⋮ Satisfiability and reasoning mechanism of terminological cycles in description logic \(v\mathcal L\) ⋮ Description Logics ⋮ Pathology of collective doxa. Automata models ⋮ Structural subsumption and least common subsumers in a description logic with existential and number restrictions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On recursive axioms in deductive databases
• The complementation problem for Büchi automata with applications to temporal logic
• Fixed-point extensions of first-order logic
• A refined architecture for terminological systems: Terminology = Schema + Views
• Fixed point theorems and semantics: A folk tale
• Reasoning and revision in hybrid representation systems
• On the complementation of Büchi automata
• Terminological reasoning is inherently intractable
• Relational queries computable in polynomial time
• Testing and generating infinite sequences by a finite automaton

This page was built for publication: Using automata theory for characterizing the semantics of terminological cycles