Kulacka, Agnieszka and Schroder, L. and Pattinson, D. (2013) Syntactic Labelled Tableaux for Łukasiewicz Fuzzy ALC. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, 03-09 Aug 2013, Beijing, China.
Abstract
Fuzzy description logics (DLs) serve as a tool to handle vagueness in real-world knowledge. There is particular interest in logics implementing Łukasiewicz semantics, which has a number of favourable properties. Current decision procedures for Łukasiewicz 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 Łukasiewicz 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.
Metadata
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | ISBN: 9781577356332 |
| School: | Birkbeck Faculties and Schools > Faculty of Business and Law > Birkbeck Business School |
| Depositing User: | Agnieszka Kulacka |
| Date Deposited: | 27 Mar 2025 16:46 |
| Last Modified: | 27 Mar 2025 16:46 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/54795 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
