Stable model semantics: Difference between revisions

Content deleted Content added
m Motivation: fix tables
m Motivation: clean up using AWB (10274)
Line 22:
|'''T'''.
|}
 
 
On the other hand, the rules of the given program can be viewed as [[propositional formula]]s if we identify the comma with conjunction <math>\land,</math> the symbol <math>\hbox{not}</math> with negation <math>\neg,</math> and agree to treat <math>F \leftarrow G</math> as the implication <math>G \rightarrow F</math> written backwards. For instance, the last rule of the given program is, from this point of view, alternative notation for the propositional formula