Loading...
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 40873 (02)
- University: Sharif University of Technology
- Department: Mathematical Sciences
- Advisor(s): Ardeshir, Mohammad
- Abstract:
- Description logic is a family of knowledge representive languages which represents knowledge via propositional logic (first order logic) propositions and constructors and applies its services for reasoning and consistency checking. Nowadays description logic and its popular reasoner FaCT++ which applies tablue reasoning technique are widely used in applications such as semantic web and onthologies. Model checking is a technique for systems and models verification and to guarantee the accuracy of design. Given a model description and a specification formula, the model checker verifies the model against the specification and decides if the model satisfies the description or not. Main model checking approaches are Binary decision diagrams (BDDs) and satisfiability solving (SAT). Both these methods encounter state space explosion problem. This problem restricts the functionality of model checkers to restricted sized models. Importance of model checking makes it worthwhile to explore alternative technologies, in the hope of enabling the application of the technique to a wider class of systems. Due to the spirit of model checking problems and description logic structure and applications, it seems an interesting approach to encode a model checking problem to a problem in description logic and apply its reasoning services for solving it. Here it represents a brief review on description logic, takes a look at main model checking problems and gives two different encodings of a model checking problem to a consistency check in description logic. At the end we introduce a few tools for description logic.
- Keywords:
- Description Logic ; Model Cheking ; Tablue Reasoning Technique ; Reasoning Complexity
-
محتواي پايان نامه
- view