Scholarlink

We consider generalizing path functional dependencies (PFDs) in Boolean complete feature logics to path description dependencies (PDDs) that now allow occurrences of inverse features. In particular, allowing such occurrences in component path descriptions of PDDs leads to a circumstance in which different notions of path agreement are now possible. We explore the cases of set intersection, set equality and non-empty set equality, studying in particular the decidability and complexity of entailment under combinations of these notions of path agreement.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Equality Generating Dependencies in Description Logics via Path Agreements

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Eva Feng,
  • Enrico Franconi,
  • Peter F. Patel-Schneider,
  • David Toman,
  • Grant Weddell

摘要

We consider generalizing path functional dependencies (PFDs) in Boolean complete feature logics to path description dependencies (PDDs) that now allow occurrences of inverse features. In particular, allowing such occurrences in component path descriptions of PDDs leads to a circumstance in which different notions of path agreement are now possible. We explore the cases of set intersection, set equality and non-empty set equality, studying in particular the decidability and complexity of entailment under combinations of these notions of path agreement.