Using automata theory for characterizing the semantics of terminological cycles

DOI10.1007/BF02127747zbMATH Open0891.68111DBLPjournals/amai/Baader96WikidataQ57383740 ScholiaQ57383740MaRDI QIDQ1380409FDOQ1380409

Authors: Franz Baader 

Publication date: 4 March 1998

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

Recommendations

• scientific article; zbMATH DE number 67500
• scientific article; zbMATH DE number 1149405
• Satisfiability and reasoning mechanism of terminological cycles in description logic \(v\mathcal L\)
• Terminological reasoning is inherently intractable

zbMATH Keywords

finite automataterminological cycles

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• Generalized satisfiability for the description logic \(\mathcal{ALC}\)
• Title not available (Why is that?)
• 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\mathcal 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)