The profile grammar distinguishes positions where existential and universal restrictions are allowed. Section 4 supplies the RL description logic restrictions and Section 5 gives complexity tables. The EL profile here includes bottom and disjointness; its satisfiability result should not be confused with the trivial satisfiability of EL without bottom.

Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3. Home

Incoming links (3)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version