Efficient implementation of non-standard connectives and quantifiers in deductive reasoning systems

Author

Choi, Joongmin ; Shapiro, Stuart C.

Author_Institution

Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA

Volume

i

fYear

1992

fDate

7-10 Jan 1992

Firstpage

381

Abstract

A rule use information (RUI) structure has been proposed to implement nonstandard connectives and quantifiers that generalize conjunction, disjunction, implication, universal quantifier, and existential quantifier. The current implementation of the RUI structure in the SNePS Inference Package (SNIP) maintains a single RUI set for each rule, which causes a combinatorial number of substitution compatibility checks between RUIs as the number of antecedents in a rule and their instances increase. The problem of efficient RUI handling for deduction rules with non-standard connectives and quantifiers is addressed. Two kinds of algorithms are proposed, and methods of distributing RUIs over several sets are discussed. Complexity analyses and test results show that these schemes of RUI set distribution keep the complexity of RUI set handling to polynomial in terms of the number of RUIs and the number of substitution compatibility tests

Keywords

computational complexity; deductive databases; inference mechanisms; knowledge based systems; P-tree algorithm; RUI handling; RUI set distribution; S-indexing algorithm; SNIP; SNePS Inference Package; conjunction; deduction rules; deductive reasoning systems; disjunction; nonstandard connectives; rule use information; substitution compatibility tests; Artificial intelligence; Computer science; Humans; Natural languages; Packaging; Polynomials; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

System Sciences, 1992. Proceedings of the Twenty-Fifth Hawaii International Conference on

Conference_Location

Kauai, HI

Print_ISBN

0-8186-2420-5

Type

conf

DOI

10.1109/HICSS.1992.183186

Filename

183186