Deciding the ALCNIR+-Satisfiability with a Fully Tiered Clause

Abstract:

Article Preview

In contrast with Tableau algorithm, this paper presented a totally new approach to check the satisfiabilities of acyclic ALCNIR+-concepts―FTC algorithm. This calculus can make a direct judgment on the satisfiability of an acyclic ALCNIR+-concept by translating its description into a fully tiered clause whose satisfiability is directly available. FTC algorithm eliminates description overlaps to largest extent as it works on concept description directly. Therefore, FTC algorithm has notably better performance than Tableaux by saving a lot of spatial costs.

Info:

Periodical:

Key Engineering Materials (Volumes 439-440)

Edited by:

Yanwen Wu

Pages:

1337-1342

DOI:

10.4028/www.scientific.net/KEM.439-440.1337

Citation:

H. M. Gu et al., "Deciding the ALCNIR+-Satisfiability with a Fully Tiered Clause", Key Engineering Materials, Vols. 439-440, pp. 1337-1342, 2010

Online since:

June 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.