Premium
System LS: A Three‐Tiered Nonmonotonic Reasoning System
Author(s) -
Ford Marilyn
Publication year - 2004
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/j.0824-7935.2004.00231.x
Subject(s) - transitive relation , monotonic function , non monotonic logic , computer science , artificial intelligence , benchmark (surveying) , theoretical computer science , mathematics , combinatorics , mathematical analysis , geodesy , geography
In this paper, a formal system of nonmonotonic reasoning is developed, which takes as its inspiration the manner in which some people make logically justifiable conclusions about nonmonotonic reasoning problems.
The people, when asked about individuals, compare the logical strength of the arguments relating any sets to which the individual belongs, to other sets. A three‐tiered system of rules including rules of System P as well as Transitivity and Monotonicity is developed. The system, known as System LS for logical strength, deals with three levels of non‐strict relationships:α 1 β α are normally β(more than half of the α are β);α 2 β some α are β;α 3 β a relationship, α 3 β , has been derived but it is possible that no α are β.The rules of the system give the logical consequences of the relationships between the sets in the premises at the three levels. Several problems, including some well‐known benchmark problems, are discussed, illustrating the inferences that System LS derives.