Using automata theory for characterizing the semantics of terminological cycles
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3817043 (Why is no real title available?)
- scientific article; zbMATH DE number 3976991 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 67500 (Why is no real title available?)
- scientific article; zbMATH DE number 67503 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 3450200 (Why is no real title available?)
- scientific article; zbMATH DE number 6606365 (Why is no real title available?)
- A refined architecture for terminological systems: Terminology = Schema + Views
- Fixed point theorems and semantics: A folk tale
- Fixed-point extensions of first-order logic
- On recursive axioms in deductive databases
- On the complementation of Büchi automata
- Reasoning and revision in hybrid representation systems
- Relational queries computable in polynomial time
- Terminological reasoning is inherently intractable
- Testing and generating infinite sequences by a finite automaton
- The complementation problem for Büchi automata with applications to temporal logic
Cited in
(10)- Generalized satisfiability for the description logic \(\mathcal{ALC}\)
- scientific article; zbMATH DE number 67500 (Why is no real title available?)
- Reasoning in fuzzy description logics using automata
- Description Logics
- Pathology of collective doxa. Automata models
- Generalized satisfiability for the description logic \(\mathcal{ALC}\) (extended abstract)
- Extensions of unification modulo ACUI
- The fuzzy description logic \(\mathsf{G}\)-\({\mathcal{FL}_0}\) with greatest fixed-point semantics
- Satisfiability and reasoning mechanism of terminological cycles in description logic v L
- Structural subsumption and least common subsumers in a description logic with existential and number restrictions
This page was built for publication: Using automata theory for characterizing the semantics of terminological cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380409)
