Journal of Advanced Computational Intelligence and Intelligent Informatics · 2003 · 40 citations · 5 references
ComputingComputer ScienceMathematicsFormal MethodsKnowledge RepresentationLogicDescription LogicsFormal OntologyFormal SemanticsFuzzy LogicComplexityConcept ExpressivityDescription Logic ReasoningExpressive Description LogicsFuzzy Description LogicsSatisfiabilitySatisfiability ProblemUnsatisfiability
ALCFH is strictly more expressive than Fuzzy‑ALC defined in [11]. This paper introduces the fuzzy description logic ALCFH, where primitive concepts are modified by hedges from hedge algebras. We define ALCFH, present a decision procedure for its unsatisfiability problem, discuss knowledge‑base expansion, and extend prior work to allow modifiers on non‑primitive concepts and to handle concept definitions. Given a linearly ordered set of hedges, primitive concepts can be modified to any desired degree by prefixing them with appropriate chains of hedges.
In this paper we present the fuzzy description logic ALCFH introduced, where primitive concepts are modified by means of hedges taken from hedge algebras. ALCFH is strictly more expressive than Fuzzy- ALC defined in [11]. We show that given a linearly ordered set of hedges primitive concepts can be modified to any desired degree by prefixing them with appropriate chains of hedges. Furthermore, we define a decision procedure for the unsatisfiability problem in ALC FH , and discuss knowledge base expansion when using terminologies, truth bounds, expressivity as well as complexity issues. We extend [8] by allowing modifiers on non-primitive concepts and extending the satisfiability procedure to handle concept definitions.
5
An Overview of Tableau Algorithms for Description Logics
Franz Baader, Ulrike Sattler · Studia Logica · 2001 · 388 citations
An algebraic approach to linguistic hedges in Zadeh's fuzzy logic
Nguyễn Cát Hồ · Fuzzy Sets and Systems · 2002 · 107 citations
Humanities, Mathematics, Logic +7