Abstract

Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Kl-one. During the last decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety of description logics can be decided using tableau-like algorithms. This is not very surprising since description logics have turned out to be closely related to propositional modal logics and logics of programs (such as propositional dynamic logic), for which tableau procedures have been quite successful. ER -

Description

SpringerLink - Journal Article

Links and resources

Tags

community

  • @ramaz
  • @deynard
  • @marciomr
  • @casi
  • @dblp
@casi's tags highlighted