Open Access
Translator Disclaimer
2014 Optimised ExpTime Tableaux for 𝒮𝒩 over Finite Residuated Lattices
Jian Huang, Xinye Zhao, Jianxing Gong
J. Appl. Math. 2014: 1-15 (2014). DOI: 10.1155/2014/702326

Abstract

This study proposes to adopt a novel tableau reasoning algorithm for the description logic 𝒮𝒩 with semantics based on a finite residuated De Morgan lattice. The syntax, semantics, and logical properties of this logic are given, and a sound, complete, and terminating tableaux algorithm for deciding fuzzy ABox consistency and concept satisfiability problem with respect to TBox is presented. Moreover, based on extended and/or completion-forest with a series of sound optimization technique for checking satisfiability with respect to a TBox in the logic, a new optimized ExpTime (complexity-optimal) tableau decision procedure is presented here. The experimental evaluation indicates that the optimization techniques we considered result in improved efficiency significantly.

Citation

Download Citation

Jian Huang. Xinye Zhao. Jianxing Gong. "Optimised ExpTime Tableaux for 𝒮𝒩 over Finite Residuated Lattices." J. Appl. Math. 2014 1 - 15, 2014. https://doi.org/10.1155/2014/702326

Information

Published: 2014
First available in Project Euclid: 2 March 2015

Digital Object Identifier: 10.1155/2014/702326

Rights: Copyright © 2014 Hindawi

JOURNAL ARTICLE
15 PAGES


SHARE
Vol.2014 • 2014
Back to Top