Guarded logic
From Wikipedia, the free encyclopedia
Guarded logic is a choice set of dynamic logic involved in choices, where outcomes are limited.
A simple example of guarded logic is as follows: if X is true, then Y, else Z can be expressed in dynamic logic as (X?;Y)∪(~X?;Z). This shows a guarded logical choice: if X holds, then X?;Y is equal to Y, and ~X?;Z is blocked, and a ∪block is also equal to Y. Hence, when X is true, the primary performer of the action can only take the Y branch, and when false the Z branch.[1]
A real-world example is the idea of paradox: something cannot be both true and false. A guarded logical choice is one where any change in true affects all decisions made down the line. [2]
References
- ↑ "Formal modeling and analysis of timed system". International Conference on Formal Modelling and Analysis of Timed Systems No4. Paris, France. September 25-27, 2006
- ↑ Nieuwenhuis, Robert; Andrei Voronkov (2001). Logic for Programming, Artificial Intelligence, and Reasoning. Springer. pp. 88–89. ISBN 3-540-42957-3.
This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.