Results 1 - 10 of 9,458

The Fuzzy Linguistic Description Logic ALCF L

by Dzung Dinh-khac, Steffen Hölldobler, Technische Universität Dresden, Dinh-khang Tran
"... We present the fuzzy linguistic description logic ALCF L, an instance of the description logic framework L-ALC with the certainty lattice characterized by a hedge algebra. Beside constructors of L-ALC, ALCF L allows the modification by hedges. ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
We present the fuzzy linguistic description logic ALCF L, an instance of the description logic framework L-ALC with the certainty lattice characterized by a hedge algebra. Beside constructors of L-ALC, ALCF L allows the modification by hedges.

The Subsumption Problem of the Fuzzy Description Logic ALCF H

by Steffen Hölldobler, Hans-peter Störr - In Proceedings of the 10th International Conference on Information Processing and Managment of Uncertainty in Knowledge-Based Systems, (IPMU-04 , 2004
"... We present the fuzzy description logic ALCF H where primitive concepts are modified by means of hedges taken from hedge algebras. ALCF H is strictly more expressive than Fuzzy-ALC defined in [9]. We show that given a linearly ordered set of hedges primitive concepts can be modified to any desired de ..."
Abstract - Cited by 15 (2 self) - Add to MetaCart
We present the fuzzy description logic ALCF H where primitive concepts are modified by means of hedges taken from hedge algebras. ALCF H is strictly more expressive than Fuzzy-ALC defined in [9]. We show that given a linearly ordered set of hedges primitive concepts can be modified to any desired

The Fuzzy Description Logic ALCF H with Hedge Algebras as Concept Modifiers

by unknown authors
"... In this paper we present the fuzzy description logic ALCF H introduced, where primitive concepts are modified by means of hedges taken from hedge algebras. ALCF H is strictly more expressive than Fuzzy-ALC defined in [11]. We show that given a linearly ordered set of hedges primitive concepts can be ..."
Abstract - Add to MetaCart
In this paper we present the fuzzy description logic ALCF H introduced, where primitive concepts are modified by means of hedges taken from hedge algebras. ALCF H is strictly more expressive than Fuzzy-ALC defined in [11]. We show that given a linearly ordered set of hedges primitive concepts can

The fuzzy description logic ALCFLH

by Steffen Hölldobler, Nguyen Hoang Nga, Technische Universität Dresden, Tran Dinh Khang - In International workshop on Description Logics. CEUR , 2005
"... We present the fuzzy description logic ALCF LH. ALCF LH is based on ALCF H, but linear hedges are used instead of exponential ones. This allows to solve the entailment and the subsumption problem in a fuzzy description logic, where arbitrary concepts and roles may be modified. 1 ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
We present the fuzzy description logic ALCF LH. ALCF LH is based on ALCF H, but linear hedges are used instead of exponential ones. This allows to solve the entailment and the subsumption problem in a fuzzy description logic, where arbitrary concepts and roles may be modified. 1

Description Logic Programs: Combining Logic Programs with Description Logic

by Benjamin N. Grosof, Ian Horrocks , 2002
"... We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR) ..."
Abstract - Cited by 529 (46 self) - Add to MetaCart
We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR

Dynamic Logic

by David Harel, Dexter Kozen, Jerzy Tiuryn - Handbook of Philosophical Logic , 1984
"... ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possibl ..."
Abstract - Cited by 1012 (7 self) - Add to MetaCart
possible values a 2 N. This operation becomes explicit in DL in the form of the program x := ?, called a nondeterministic or wildcard assignment. This is a rather unconventional program, since it is not effective; however, it is quite useful as a descriptive tool. A more conventional way to obtain a

Tractable reasoning and efficient query answering in description logics: The DL-Lite family

by Diego Calvanese, G. De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati - J. OF AUTOMATED REASONING , 2007
"... We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, b ..."
Abstract - Cited by 497 (123 self) - Add to MetaCart
We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base

Constraint Logic Programming: A Survey

by Joxan Jaffar, Michael J. Maher
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract - Cited by 869 (25 self) - Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve

THE FUZZY DESCRIPTION LOGIC ALCFLH

by Tran Dinh Khang
"... In this paper, we present the fuzzy description logic ALCF LH. ALCF LH is based on ALCF H, but linear hedges are used instead of exponential ones. This allows to solve the entailment and the subsumption problem in a fuzzy description logic, where arbitrary concepts and roles may be modified. KEY WOR ..."
Abstract - Add to MetaCart
In this paper, we present the fuzzy description logic ALCF LH. ALCF LH is based on ALCF H, but linear hedges are used instead of exponential ones. This allows to solve the entailment and the subsumption problem in a fuzzy description logic, where arbitrary concepts and roles may be modified. KEY

RACER system description

by Volker Haarslev, Ralf Möller , 2001
"... Abstract. RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first full-fledged ABox description logic system for a very expressive logic and is based on optimized sound and complete algorithms. RACER also implements a decision procedure for modal logic satisfiability proble ..."
Abstract - Cited by 452 (41 self) - Add to MetaCart
Abstract. RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first full-fledged ABox description logic system for a very expressive logic and is based on optimized sound and complete algorithms. RACER also implements a decision procedure for modal logic satisfiability
Results 1 - 10 of 9,458