On Limited Conjunctions and Partial Features in Parameter-Tractable Feature Logics

Abstract

Standard reasoning problems are complete for EXPTIME in common feature-based description logics—ones in which all roles are restricted to being functions. We show how to control conjunctions on left-hand-sides of subsumptions and use this restriction to develop a parameter-tractable algorithm for reasoning about knowledge base consistency. We then show how the resulting logic can simulate partial features, and present algorithms for efficient query answering in that setting.

Cite

Text

McIntyre et al. "On Limited Conjunctions and Partial Features in Parameter-Tractable Feature Logics." AAAI Conference on Artificial Intelligence, 2019. doi:10.1609/AAAI.V33I01.33012995

Markdown

[McIntyre et al. "On Limited Conjunctions and Partial Features in Parameter-Tractable Feature Logics." AAAI Conference on Artificial Intelligence, 2019.](https://mlanthology.org/aaai/2019/mcintyre2019aaai-limited/) doi:10.1609/AAAI.V33I01.33012995

BibTeX

@inproceedings{mcintyre2019aaai-limited,
  title     = {{On Limited Conjunctions and Partial Features in Parameter-Tractable Feature Logics}},
  author    = {McIntyre, Stephanie and Borgida, Alexander and Toman, David and Weddell, Grant E.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2019},
  pages     = {2995-3002},
  doi       = {10.1609/AAAI.V33I01.33012995},
  url       = {https://mlanthology.org/aaai/2019/mcintyre2019aaai-limited/}
}