Soft Set Theoretic on Marriage Problem Predicate Task.

on Abstract . This report is about theoretical study of soft sets on Marriage Problem Predicate with its tabular representation defined over universe sets, U with set of parameters from the sentence predicates of the case examples used in the research exploration.


Introduction
Molodtsov [11] defined the soft set in the following way. Let U be an initial universe set and E be a set of parameters. Let P(U) denotes the power set of U and A subset E. In other words, a soft set over U is a parametrized family of subsets of the universe U. For e member of A. F(E) may be considered as the set of e-approximate elements of the soft set (F, A). Clearly, a soft set is not a set. For illustration, Molodtsov considered several examples in [11] one of which is presented below. EXAMPLE 2.1. Suppose the following. U is the set of houses under consideration. E is the set of parameters. Each parameter is a word or a sentence. E = {expensive; beautiful; wooden; cheap; in the green surroundings; modern; in good repair; in bad repair}.
In this case, to define a soft set means to point out expensive houses, beautiful houses, and so on. The soft set (F, E) describes the "attractiveness of the houses" which Mr. X (say) is going to buy. We consider below the same example in more detail for our next discussion. Suppose that there are six houses in the universe U given by U = {hl, h2, h3, h4 , h5, h6) and E= {el, e2, e3, e4, e5): where el stands for the parameter 'expensive', e2 stands for the parameter 'beautiful', e3 stands for the parameter 'wooden', e4 stands for the parameter 'cheap', e5 stands for the parameter 'in the green surroundings'.
The soft set (F, E) is a parametrized family {F(e_i), i = 1,2,3,. ,8} of subsets of the set U and gives us a collection of approximate descriptions of an object. I will illustrate the use of predicate sentence from the celebrated Marriage Problem case example to create first tabular representation on soft set and then generate the parametrized family. Marriage Problem is about sentences or phrases and counting problems. It is logical structured and involves discrete operations like subtraction, addition and multiplication. It is about alphanumeric labeling of sentences or phrases and proofing of combinatorial enumerations. The theory of combinatorics of sentences or phrases or words is called Letter Combinatorics (LC) with 8 bulletin requirements. A Marriage Problem (MP) made up of 5 sentences is used in the exploit of letter combinatorics. A generating function is calculated for MP to handle constraints of arrangement /selection and the combinatorial enumerations of MP. The predicate sentences are made from [5]. This work looks at soft set concepts on and tabular representation of predicates. The Marriage Problem states that; (1) Damn it. (

2) What's wrong? (3) It is a combination of 46 letters. (4) Akua will not marry you. (5) Pokua will not marry you.
This research is organised as follows : • Show the parametrized family of soft set from the initial universe set, • A Look again on the predicate sentences with soft set on tabular representation.

Soft Set on Tabular Representation
The next predicate is to determine if a sentence is a question or not. There is only one question in all the five sentences. It is represented as mpsentenceask predicate sentence. This category predicate is important in this work. This will take on two passing values of sentence number and an indicator of a question or not. Yes(Y will be 1) indicates a pass value whiles No(N will be 0) does not. The following question stances are: General Predicate : mpsentenceask (sentence _no, response).
The third round tried to bring out a solution in the context of problem solving. The 4 and 5 statements are involved with names of female sex. These are Akua and Pokua. The fact base for this representation is captured with predicate sentences, mpnamsex. These will include the following : • mpnamsex(1, no). • mpnamsex(2, no). • mpnamsex (3, no). • mpnamsex(4, yes). • mpnamsex(5, yes).

Conclusion
This work on tabular representation and soft computing concludes with the following remarks: • Six soft response set are achieved.
• Table representation of the soft set is achieved.
• Look at approximation in terms of predicate name and approximate value set is achieved. • The universe of marriage Problem Predicate is achieved.