# Difference between revisions of "Membership in Goal"

imported>Laurent m (→Goal) |
imported>Nicolas m (→Find a path) |
||

(21 intermediate revisions by 3 users not shown) | |||

Line 1: | Line 1: | ||

+ | {{TOCright}} | ||

= Objective = | = Objective = | ||

Line 24: | Line 25: | ||

This part explains how the tactic (MembershipGoalTac) associated to the reasoner MembershipGoal is working. | This part explains how the tactic (MembershipGoalTac) associated to the reasoner MembershipGoal is working. | ||

=== Goal === | === Goal === | ||

− | The tactic (as the reasoner) | + | The tactic (as the reasoner) works only on goals of the form : |

*<math>\cdots~\in~\cdots</math> | *<math>\cdots~\in~\cdots</math> | ||

− | For | + | For example: |

*<math>f(x)\in g\otimes h</math> | *<math>f(x)\in g\otimes h</math> | ||

*<math>x\in A\cprod\left(B\cup C\right)</math> | *<math>x\in A\cprod\left(B\cup C\right)</math> | ||

*<math>x\mapsto y\in A\cprod B</math> | *<math>x\mapsto y\in A\cprod B</math> | ||

− | In the | + | In the last example, the reasoner will not try to prove that <math>x</math> belongs to <math>A</math> and <math>y</math> belongs to <math>B</math>, but that the maplet <math>x\mapsto y</math> belongs to the Cartesian product <math>A\cprod B</math>. |

=== Hypotheses === | === Hypotheses === | ||

− | Now we have to find hypotheses leading to discharge the sequent. To do so, the tactic | + | Now we have to find hypotheses leading to discharge the sequent. To do so, the tactic looks for two kinds of hypothesis : |

− | #the ones related to the left member of the goal <math>\left( x\in S\right)</math> ( | + | #the ones related to the left member of the goal <math>\left( x\in S\right)</math> (which will be used as a starting point): |

#*<math>x\in \cdots</math> | #*<math>x\in \cdots</math> | ||

#*<math>\cdots\mapsto x\mapsto\cdots\in\cdots</math> | #*<math>\cdots\mapsto x\mapsto\cdots\in\cdots</math> | ||

Line 40: | Line 41: | ||

#*<math>\left\{\cdots, \cdots\mapsto x\mapsto\cdots,\cdots\right\}=/\subset/\subseteq\cdots</math> | #*<math>\left\{\cdots, \cdots\mapsto x\mapsto\cdots,\cdots\right\}=/\subset/\subseteq\cdots</math> | ||

#*<math>f\ovl\left\{\cdots, x, \cdots\right\}=/\subset/\subseteq\cdots</math> | #*<math>f\ovl\left\{\cdots, x, \cdots\right\}=/\subset/\subseteq\cdots</math> | ||

− | #the ones denoting inclusion ( | + | #the ones denoting inclusion (which will be used to find a path from a starting point to the goal) : |

#*<math>\cdots\subset\cdots</math> | #*<math>\cdots\subset\cdots</math> | ||

#*<math>\cdots\subseteq\cdots</math> | #*<math>\cdots\subseteq\cdots</math> | ||

#*<math>\cdots=\cdots</math> | #*<math>\cdots=\cdots</math> | ||

− | Then, it will search a link between | + | Then, it will search a link between these hypotheses so that the sequent can be discharged. |

=== Find a path === | === Find a path === | ||

− | Now that we | + | Now that we have found all the hypotheses that could be useful to the reasoner, it remains to find a path among these hypotheses leading to discharge the sequent. Depending on the relations on each side of the inclusion, we will act differently. <math>f</math> always denotes an expression (it may be a domain, a range, etc.). |

#The following sequent is provable because <math>f\subseteq \varphi (f)</math>. | #The following sequent is provable because <math>f\subseteq \varphi (f)</math>. | ||

#*<math>x\in f,\quad \varphi (f)\subseteq g\quad\vdash\quad x\in g</math> | #*<math>x\in f,\quad \varphi (f)\subseteq g\quad\vdash\quad x\in g</math> | ||

Line 68: | Line 69: | ||

#*<math>x\in ran(f),\quad f\subseteq A\cprod B\quad\vdash\quad x\in B</math> | #*<math>x\in ran(f),\quad f\subseteq A\cprod B\quad\vdash\quad x\in B</math> | ||

− | By using these inclusions | + | By using these inclusions the tactic tries to find a path among the recovered hypotheses. Every one of them should only be used once, avoiding possible infinite loop <math>\left(A\subseteq B,\; B\subseteq A\right)</math>. |

+ | |||

+ | Since Rodin 3.0, the path search is delegated to the [http://www.sat4j.org Sat4j] solver. The problem encoding to SAT is done by representing each inclusion of the form <math>A\subseteq B</math> into the clause <math>\{\lnot x\in A,\; x\in B\}</math> and feeding the solver with all clauses that derive from the hypotheses and the negation of the goal. As soon as the solver reports the problem as unsatisfiable, the tactic obtains an unsat core and traces it back to the corresponding hypotheses. | ||

== Reasoner == | == Reasoner == | ||

Line 80: | Line 83: | ||

==== Input ==== | ==== Input ==== | ||

− | Then, it checks that the input is a hypothesesReasonerInput (an input with an array of predicates). Every given predicates must be | + | Then, it checks that the input is a hypothesesReasonerInput (an input with an array of predicates). Every given predicates must be a hypothesis of the sequent. Only one must be a membership with the same member as the goal so that there are no ambiguity. All the other ones must denote set inclusion or equality. |

==== Find a path ==== | ==== Find a path ==== | ||

Line 88: | Line 91: | ||

==== Trusted Base ==== | ==== Trusted Base ==== | ||

− | At that point, the reasoner performs the same jobs as the tactic which is quite complicated. That poses one problem : it is hard to | + | At that point, the reasoner performs the same jobs as the tactic which is quite complicated. That poses one problem : it is hard to prove the reasoner to be sound (only doing what it was meant to, not discharging sequents that cannot be proved). Because the reasoner is in the trusted base, we should be absolutely sure of what it performs. How to validate the found path ? |

− | As we know, the reasoner condense several inferences rules in only one proof rule. To validate the found path, we have to validate every single inference rule. To achieve it, we | + | As we know, the reasoner condense several inferences rules in only one proof rule. To validate the found path, we have to validate every single inference rule. To achieve it, we create, internally to the reasoner, a small proof tree built from internal proof rules (implemented in class Rules). Each rule contains one predicate and an array of rules (its antecedents). When the path is searched, the corresponding rule is created. When the path is found, we check that the predicate of the root rule is the same as the goal. If not, it means the found path was incorrect, so the reasoner fails, else the sequent is discharged. |

Example of rules : | Example of rules : | ||

:<math>name\;of\;the\;rule\quad\frac{predicate\;of\;first\;antecedent\cdots predicate\;of\;last\;antecedent}{consequent\;of\;that\;rule}\left[parameters\right]</math> | :<math>name\;of\;the\;rule\quad\frac{predicate\;of\;first\;antecedent\cdots predicate\;of\;last\;antecedent}{consequent\;of\;that\;rule}\left[parameters\right]</math> | ||

:<math>Hypothesis\quad\frac{}{predicate}\left[predicate\right]</math> | :<math>Hypothesis\quad\frac{}{predicate}\left[predicate\right]</math> | ||

− | :<math> | + | :<math>IncludeBunion\quad\frac{A\bunion B\bunion C\bunion D\subseteq Z}{B\bunion C\subseteq Z}\left[B,~C\right]</math> |

:<math>Composition\quad\frac{x\in A,~A\subseteq B}{x\in B}\left[~\right]</math> | :<math>Composition\quad\frac{x\in A,~A\subseteq B}{x\in B}\left[~\right]</math> | ||

= Implementation = | = Implementation = | ||

− | This section | + | This section explains how the reasoner has been implemented. |

− | === | + | === Hypotheses === |

− | + | From the hypotheses, the reasoner derives new hypotheses leading to discharge the sequent. As explained in the design decision part, there are two kinds of hypotheses which are recovered (membership and inclusion). So, we developped two extractors which extract useful predicates from the hypotheses with these [[#Inference rules|inference rules]]. For each new hypothesis a rationale is built, this rationale contains the derived predicate and a rule used as a justification. | |

− | + | ||

− | + | === Find a path === | |

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | For | ||

− | |||

− | + | Let's consider the following sequent : <math> x \in B,\quad f \ovl \{ x \mapsto y \} \in A \rel B,\quad dom(A \cprod B) \subseteq C,\quad A \binter B\binter C \subseteq D \quad\vdash\quad x\in D </math> | |

− | |||

− | |||

− | |||

− | |||

− | A | + | From the hypotheses and the negation of the goal the reasoner derives new predicates. |

+ | For instance, from the hypothesis "<math> f \ovl \{ x \mapsto y \} \in A \rel B </math>" the reasoner derives the predicates <math>x \in A</math> and <math>x \in dom(A \cprod B)</math>. | ||

+ | |||

+ | Afterwards, the reasoner has to encode the new predicates in SAT clauses. For this purpose, it converts all new hypotheses in SAT proposition by extracting all set contained into the predicate. And then, it encodes the proposition SAT in Dimacs CNF format. Finally, the clauses encoded are inserted one by one into the SAT problem until the solver reports the problem as unsatisfiable in order to obtain a minimal solution to the SAT core. | ||

+ | |||

+ | {| class="wikitable" style="text-align:center; width:80%;" | ||

+ | |+ SAT problem encoding | ||

+ | |- | ||

+ | ! scope=col | Sequent | ||

+ | ! scope=col | SAT proposition | ||

+ | ! scope=col | Dimacs CNF format | ||

+ | |- | ||

+ | |<math>x \in B</math> | ||

+ | |<math>x \in B</math> | ||

+ | |<math>2</math> | ||

+ | |- | ||

+ | |<math>x \in A</math> | ||

+ | |<math>x \in A</math> | ||

+ | |<math>3</math> | ||

+ | |- | ||

+ | |<math>x \in dom(A \cprod B)</math> | ||

+ | |<math>x \in dom(A \cprod B)</math> | ||

+ | |<math>4</math> | ||

+ | |- | ||

+ | |<math>dom(A \cprod B) \subseteq C</math> | ||

+ | |<math> \lnot x \in dom(A \cprod B),\quad x \in C </math> | ||

+ | |<math>-4 \quad 5 </math> | ||

+ | |- | ||

+ | |<math>A \binter B \binter C \subseteq D</math> | ||

+ | |<math>\lnot x \in A, \quad \lnot x \in B, \quad \lnot x \in C, \quad x \in D </math> | ||

+ | |<math>-3 \quad -2 \quad -5 \quad 1</math> | ||

+ | |- | ||

+ | |<math> \vdash\quad x \in D </math> | ||

+ | |<math>\lnot x \in D</math> | ||

+ | |<math>-1</math> | ||

+ | |} | ||

+ | |||

+ | Afterwards, the reasoner traces each clause of the explanation returned by the SAT solver back to the corresponding hypotheses. However, the clauses returned by the SAT solver are sorted by their insertion order in the SAT core. So the reasoner reorders them by using topological sorting. Specifically, when the reasoner adds a rationale, we are guaranteed that all rationales on which it depends are already in the list. | ||

+ | |||

+ | Now, the reasoner has to build the path, for each hypothesis into the list, a new rationale is built and saved into an array at the index of the list. If the hypothesis denotes a membership, the rationale is directly saved into the array. Else the reasoner retrieves from the array all rationales on which it depends and then from these rationales it builds a new rationale and saves it into the array. | ||

− | + | However, the path building is unidirectional, it works with a sat problem with clauses containing whith at most one positive literal. Indeed, the current version can't find a path with hypotheses in the following form : | |

+ | * <math> x \in ... \binter / \bunion ... </math> | ||

+ | * <math> ... \subseteq ... \binter / \bunion ... </math> | ||

− | |||

− | + | An example of found path in a tree form: | |

− | + | Comp: <math> x \in D </math> | |

+ | ├── Hyp: <math> A \binter B \binter C \subseteq D </math> | ||

+ | └── Inter: <math> x \in A \binter B \binter C </math> | ||

+ | ├── Hyp: <math> x \in A </math> | ||

+ | ├── Hyp: <math> x \in B </math> | ||

+ | └── Comp: <math> x \in C </math> | ||

+ | ├── Hyp: <math> dom(A \cprod B) \subseteq C </math> | ||

+ | └── Hyp: <math> x \in dom(A \cprod B) </math> | ||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | + | Finally, the reasoner checks that the generated rule from the rationale is equal to the goal. If so, the sequent is discharged. Else, a failure is returned | |

− | |||

− | |||

+ | = Inference rules = | ||

− | + | Here the rules that should be implemented for the reasoner MembershipGoal. | |

{| class="wikitable" style="text-align:center; width:80%;" | {| class="wikitable" style="text-align:center; width:80%;" | ||

− | |+ | + | |+ Inference rules for the reasoner MembershipGoal |

|- | |- | ||

− | ! scope=col | | + | ! scope=col | Inference Rule |

− | ! scope=col | | + | ! scope=col | Side condition |

− | ! scope=col | | + | ! scope=col | Implemented |

− | |||

|- | |- | ||

− | |<math> | + | |align="left"|<math> x\in A,\;\; A\subseteq B\vdash x\in B </math> |

− | + | |align="left"| | |

− | + | |<math>\checkmark</math> | |

− | |<math>\ | ||

|- | |- | ||

− | |<math> | + | |align="left"|<math> A\subset B\vdash A\subseteq B </math> |

− | | | + | |align="left"| |

− | | | + | |<math>\checkmark</math> |

− | |<math>\ | ||

|- | |- | ||

− | |<math> | + | |align="left"|<math> A=B\vdash A\subseteq B</math> |

− | | | + | |align="left"| |

− | | | + | |<math>\checkmark</math> |

− | |<math>\ | ||

|- | |- | ||

− | |<math> | + | |align="left"|<math> A=B\vdash B\subseteq A</math> |

− | | | + | |align="left"| |

− | | | + | |<math>\checkmark</math> |

− | |<math>\ | ||

|- | |- | ||

− | |<math> | + | |align="left"|<math> A\subseteq B\vdash \dom(A)\subseteq\dom(B)</math> |

− | + | |align="left"| | |

− | + | |<math>\checkmark</math> | |

− | |<math>\ | ||

|- | |- | ||

− | |<math> | + | |align="left"|<math> A\subseteq B\vdash \ran(A)\subseteq\ran(B)</math> |

− | + | |align="left"| | |

− | + | |<math>\checkmark</math> | |

− | |<math>\ | ||

|- | |- | ||

− | |<math>dom(dom( | + | |align="left"|<math> x\in\dom(A\cprod B)\vdash x\in A</math> |

− | |<math>\left | + | |align="left"| |

− | |<math> | + | |<math>\checkmark</math> |

− | |<math>\left | + | |- |

+ | |align="left"|<math> y\in\ran(A\cprod B)\vdash y\in B</math> | ||

+ | |align="left"| | ||

+ | |<math>\checkmark</math> | ||

+ | |- | ||

+ | |align="left"|<math> x\mapsto y\in f\vdash x\in\dom(f)</math> | ||

+ | |align="left"| | ||

+ | |<math>\checkmark</math> | ||

+ | |- | ||

+ | |align="left"|<math> x\mapsto y\in f\vdash y\in\ran(f)</math> | ||

+ | |align="left"| | ||

+ | |<math>\checkmark</math> | ||

+ | |- | ||

+ | |align="left"|<math> \left\{a,\cdots,x,\cdots, z\right\}\subseteq A\vdash x\in A</math> | ||

+ | |align="left"| | ||

+ | |<math>\checkmark</math> | ||

+ | |- | ||

+ | |align="left"|<math> f\ovl\cdots\ovl g\ovl\cdots\ovl h\subseteq A\vdash g\ovl\cdots\ovl h\subseteq A</math> | ||

+ | |align="left"| | ||

+ | |<math>\checkmark</math> | ||

+ | |- | ||

+ | |align="left"|<math> f\in A\;op\;B\vdash f\subseteq A\cprod B</math> | ||

+ | |align="left"|where <math>\mathit{op}</math> is one of <math>\rel</math>, <math>\trel</math>, <math>\srel</math>, <math>\strel</math>, <math>\pfun</math>, <math>\tfun</math>, <math>\pinj</math>, <math>\tinj</math>, <math>\psur</math>, <math>\tsur</math>, <math>\tbij</math> | ||

+ | |<math>\checkmark</math> | ||

+ | |- | ||

+ | |align="left"|<math>e\subseteq f,\;\; f\setminus g\subseteq h\quad\vdash\quad e\setminus g\subseteq h</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>g\subseteq k,\;\; f\setminus g\subseteq h \quad\vdash\quad f\setminus k\subseteq h</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>e\subseteq f\setminus g,\;\; f\subseteq h\quad\vdash\quad e\subseteq h\setminus g</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>e\subseteq f\setminus g,\;\; k\subseteq g \quad\vdash\quad e\subseteq f\setminus k</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>e\subseteq f,\;\; f\ranres B\subseteq g \quad\vdash\quad e\ranres B\subseteq g</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>A\subseteq B ,\;\; f\ranres B\subseteq g \quad\vdash\quad f\ranres A\subseteq g</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>f\subseteq g\ranres A ,\;\; g\subseteq h \quad\vdash\quad f\subseteq h\ranres A</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>f\subseteq g\ranres A ,\;\; A\subseteq B \quad\vdash\quad f\subseteq g\ranres B</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>A\subseteq B ,\;\; B\domres f\subseteq g \quad\vdash\quad A\domres f\subseteq g</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>e\subseteq f ,\;\; B\domres f\subseteq g \quad\vdash\quad B\domres e\subseteq g</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>f\subseteq A\domres g ,\;\; A\subseteq B \quad\vdash\quad f\subseteq B\domres g</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>f\subseteq A\domres g ,\;\; g\subseteq h \quad\vdash\quad f\subseteq A\domres h</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>e\subseteq f ,\;\; f\ransub A\subseteq g \quad\vdash\quad e\ransub A\subseteq g</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>f\ransub A\subseteq g ,\;\; A\subseteq B \quad\vdash\quad f\ransub B\subseteq g</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>f\subseteq g\ransub A ,\;\; g\subseteq h \quad\vdash\quad f\subseteq h\ransub A</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>f\subseteq g\ransub B ,\;\; A\subseteq B \quad\vdash\quad f\subseteq g\ransub A</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>A\domsub f\subseteq g ,\;\; A\subseteq B \quad\vdash\quad B\domsub f\subseteq g</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>e\subseteq f ,\;\; A\domsub f\subseteq g \quad\vdash\quad A\domsub e\subseteq g</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>A\subseteq B ,\;\; f\subseteq B\domsub g \quad\vdash\quad f\subseteq A\domsub g</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>f\subseteq A\domsub g ,\;\; g\subseteq h \quad\vdash\quad f\subseteq A\domsub h</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>e\subseteq f ,\;\; f\ovl g\ovl\cdots\ovl h\subseteq k \quad\vdash\quad e\ovl g\ovl\cdots\ovl h\subseteq k</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>f\subseteq g\ovl h\ovl\cdots\ovl k ,\;\; e\subseteq g \quad\vdash\quad f\subseteq e\ovl h\ovl\cdots\ovl k</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>Z\subseteq B,\;\; A\bunion\cdots\bunion B\bunion\cdots\bunion C\subseteq D\quad\vdash\quad A\bunion\cdots\bunion Z\bunion\cdots\bunion C\subseteq D</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>B\subseteq Z ,\;\; D\subseteq A\bunion\cdots\bunion B\bunion\cdots\bunion C \quad\vdash\quad D\subseteq A\bunion\cdots\bunion Z\bunion\cdots\bunion C</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>Z\subseteq B,\;\; A\binter\cdots\binter B\binter\cdots\binter C\subseteq D\quad\vdash\quad A\binter\cdots\binter Z\binter\cdots\binter C\subseteq D</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>B\subseteq Z ,\;\; D\subseteq A\binter\cdots\binter B\binter\cdots\binter C \quad\vdash\quad D\subseteq A\binter\cdots\binter Z\binter\cdots\binter C</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>A\subseteq B,\;\; B\cprod D\subseteq E \quad\vdash\quad A\cprod D\subseteq E</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>C\subseteq D,\;\; B\cprod D\subseteq E \quad\vdash\quad B\cprod C\subseteq E</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>A\subseteq B\cprod D,\;\; B\subseteq C \quad\vdash\quad A\subseteq C\cprod D</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>A\subseteq B\cprod D,\;\; D\subseteq E\quad\vdash\quad A\subseteq B\cprod E</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>\dom(f\domres\prjone)\defi f</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>\dom(f\domres\prjtwo)\defi f</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>\dom(f\domres\id)\defi f</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>\ran(\prjone\ranres f)\defi f</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>\ran(\prjtwo\ranres f)\defi f</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>\ran(\id\ranres f)\defi f</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>\ran(f\domres\prjone)\defi\dom(f)</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>\ran(f\domres\prjtwo)\defi\ran(f)</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

+ | |- | ||

+ | |align="left"|<math>\ran(f\domres\id)\defi f</math> | ||

+ | |align="left"| | ||

+ | |<math></math> | ||

|- | |- | ||

− | |||

− | |||

− | |||

− | |||

|} | |} | ||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

[[Category:Design proposal]] | [[Category:Design proposal]] |

## Latest revision as of 13:50, 5 June 2014

# Objective

This page describes the design of the reasoner MembershipGoal and its associated tactic MembershipGoalTac.

This reasoner discharges sequents whose goal denotes a membership which can be inferred from hypotheses, such as the following:

# Analysis

Usually, such sequents are proved by the external provers PP or ML. But, these provers have several drawbacks :

- They do not report needed hypotheses, so that a conservative choice is made to depend on all hypotheses.
- They take substantial time to prove them (even with the basic example given above, the difference in time execution is noticeable).
- If there are too many hypotheses, or if the expression of the or the intermediate sets is too complicated, they may get lost into details and not discharge.

This is particularly true when in the set expressions of each side of relations are not equal, such as in:

Such a reasoner thus increases the rate of automated proof, faster and with fewer needed hypotheses which makes proof rules more legible and proof replay less sensitive to modifications of the models.

# Design Decision

## Tactic

This part explains how the tactic (MembershipGoalTac) associated to the reasoner MembershipGoal is working.

### Goal

The tactic (as the reasoner) works only on goals of the form :

For example:

In the last example, the reasoner will not try to prove that belongs to and belongs to , but that the maplet belongs to the Cartesian product .

### Hypotheses

Now we have to find hypotheses leading to discharge the sequent. To do so, the tactic looks for two kinds of hypothesis :

- the ones related to the left member of the goal (which will be used as a starting point):
- the ones denoting inclusion (which will be used to find a path from a starting point to the goal) :

Then, it will search a link between these hypotheses so that the sequent can be discharged.

### Find a path

Now that we have found all the hypotheses that could be useful to the reasoner, it remains to find a path among these hypotheses leading to discharge the sequent. Depending on the relations on each side of the inclusion, we will act differently. always denotes an expression (it may be a domain, a range, etc.).

- The following sequent is provable because .
- The following sequent is provable because .
- By keeping the notation we also deduce that :
- For some relations, positions are needed to be known to continue to find hypotheses, but it is not always necessary.

By using these inclusions the tactic tries to find a path among the recovered hypotheses. Every one of them should only be used once, avoiding possible infinite loop .

Since Rodin 3.0, the path search is delegated to the Sat4j solver. The problem encoding to SAT is done by representing each inclusion of the form into the clause and feeding the solver with all clauses that derive from the hypotheses and the negation of the goal. As soon as the solver reports the problem as unsatisfiable, the tactic obtains an unsat core and traces it back to the corresponding hypotheses.

## Reasoner

This part describe how the reasoner MembershipGoal works.

#### Goal

First, it checks that the goal matches the description made in the part tactic : . Thus, we record the member *x* as well as the set *S*

#### Input

Then, it checks that the input is a hypothesesReasonerInput (an input with an array of predicates). Every given predicates must be a hypothesis of the sequent. Only one must be a membership with the same member as the goal so that there are no ambiguity. All the other ones must denote set inclusion or equality.

#### Find a path

With the same reasoning as for the tactic, we try to find a path leading to discharge the goal.

#### Trusted Base

At that point, the reasoner performs the same jobs as the tactic which is quite complicated. That poses one problem : it is hard to prove the reasoner to be sound (only doing what it was meant to, not discharging sequents that cannot be proved). Because the reasoner is in the trusted base, we should be absolutely sure of what it performs. How to validate the found path ?

As we know, the reasoner condense several inferences rules in only one proof rule. To validate the found path, we have to validate every single inference rule. To achieve it, we create, internally to the reasoner, a small proof tree built from internal proof rules (implemented in class Rules). Each rule contains one predicate and an array of rules (its antecedents). When the path is searched, the corresponding rule is created. When the path is found, we check that the predicate of the root rule is the same as the goal. If not, it means the found path was incorrect, so the reasoner fails, else the sequent is discharged.

Example of rules :

# Implementation

This section explains how the reasoner has been implemented.

### Hypotheses

From the hypotheses, the reasoner derives new hypotheses leading to discharge the sequent. As explained in the design decision part, there are two kinds of hypotheses which are recovered (membership and inclusion). So, we developped two extractors which extract useful predicates from the hypotheses with these inference rules. For each new hypothesis a rationale is built, this rationale contains the derived predicate and a rule used as a justification.

### Find a path

Let's consider the following sequent :

From the hypotheses and the negation of the goal the reasoner derives new predicates.
For instance, from the hypothesis "" the reasoner derives the predicates and .

Afterwards, the reasoner has to encode the new predicates in SAT clauses. For this purpose, it converts all new hypotheses in SAT proposition by extracting all set contained into the predicate. And then, it encodes the proposition SAT in Dimacs CNF format. Finally, the clauses encoded are inserted one by one into the SAT problem until the solver reports the problem as unsatisfiable in order to obtain a minimal solution to the SAT core.

Sequent | SAT proposition | Dimacs CNF format |
---|---|---|

Afterwards, the reasoner traces each clause of the explanation returned by the SAT solver back to the corresponding hypotheses. However, the clauses returned by the SAT solver are sorted by their insertion order in the SAT core. So the reasoner reorders them by using topological sorting. Specifically, when the reasoner adds a rationale, we are guaranteed that all rationales on which it depends are already in the list.

Now, the reasoner has to build the path, for each hypothesis into the list, a new rationale is built and saved into an array at the index of the list. If the hypothesis denotes a membership, the rationale is directly saved into the array. Else the reasoner retrieves from the array all rationales on which it depends and then from these rationales it builds a new rationale and saves it into the array.

However, the path building is unidirectional, it works with a sat problem with clauses containing whith at most one positive literal. Indeed, the current version can't find a path with hypotheses in the following form :

An example of found path in a tree form:

Comp: ├── Hyp: └── Inter: ├── Hyp: ├── Hyp: └── Comp: ├── Hyp: └── Hyp:

Finally, the reasoner checks that the generated rule from the rationale is equal to the goal. If so, the sequent is discharged. Else, a failure is returned

# Inference rules

Here the rules that should be implemented for the reasoner MembershipGoal.

Inference Rule | Side condition | Implemented |
---|---|---|

where is one of , , , , , , , , , , | ||