Syntactic Labelled Tableaux for Lukasiewicz Fuzzy ALC
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 962-967.
Abstract
Fuzzy description logics (DLs) serve as a tool to handle vagueness in real-world knowledge. There is particular interest in logics implementing Lukasiewicz semantics, which has a number of favourable properties. Current decision procedures for Lukasiewicz fuzzy DLs work by reduction to exponentially large mixed integer programming problems. Here, we present a decision method that stays closer to logical syntax, a labelled tableau algorithm for Lukasiewicz Fuzzy ALC that calls only on (pure) linear programming, and this only to decide atomic clashes. The algorithm realizes the best known complexity bound, NEXPTIME. Our language features a novel style of fuzzy ABoxes that work with comparisons of truth degrees rather than explicit numerical bounds.
@inproceedings{ijcai2013p147,
title = {Syntactic Labelled Tableaux for Lukasiewicz Fuzzy ALC},
author = {Kulacka, Agnieszka and Pattinson, Dirk and Schröder, Lutz},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {962--967},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/147},
}
TY - CPAPER TI - Syntactic Labelled Tableaux for Lukasiewicz Fuzzy ALC AU - Kulacka, Agnieszka AU - Pattinson, Dirk AU - Schröder, Lutz T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 962 EP - 967 UR - https://ijcai.org/proceedings/2013/147 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
