Open access
Jul 2026
A New Well-Supported Semantics for Description Logic Programs
This work presents a new semantics which evaluates ontological atoms more strictly than the current semantics, which keeps the complexity of its consistency problem NP-complete, rather than increasing it to the second level of the polynomial hierarchy.
Spencer Killen, Jia-Huai You
· Electronic Proceedings in Th... · 0 citations