|
Size: 201
Comment:
|
Size: 523
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| * AffineMotion * CompleteLogic What does it mean for a logic to be complete * FirstOrderPredicateLogic * FirstOrderPredicateLogicQuatifiers |
|
| Line 6: | Line 10: |
| * LinearlyDecomposable * OpenShortPathFirst OSPF |
* LinearlyDecomposableDomains * LinkState * ["Model"] of a logic formula * OpenShortestPathFirst OSPF * PredicateSymbols |
| Line 9: | Line 16: |
| * ["Satisfiable"] * UnaryConstraintDomain * ["Valid"] Logic Formula |
CompleteLogic What does it mean for a logic to be complete
- ["Model"] of a logic formula
- ["Satisfiable"]
- ["Valid"] Logic Formula
