<< Chapter < Page | Chapter >> Page > |
We summarize the details of how we choose to model WaterWorld boards in first-order logic: exactly what relations we make up, and the formaldomain axioms which capture the game's rules.
This will follow almost exactly the same pattern as our WaterWorld model in propositional logic . However, we will take advantage of the additional flexibility providedby first-order logic.
Rather than modeling only the default 64 WaterWorld board;, we will be able to model any board representable by our relations.This will allow boards of any size and configuration, with one major constrainteach location can have at most three neighboring pirates.
Our domain is simply the set of all board locations. This set can be arbitrarily largeeven infinite!
The board configuration is given by the binaryneighborrelation $\mathrm{nhbr}$ .
The next relations correspond directly to the propositions in the propositional logic model.
In addition, to have encode the domain axioms for an arbitrary domain, we also need an equality relation over our domain of locations.As is traditional, we will use infix notation for this relation, for example, $x=y$ . Furthermore, we will allow ourselves to write $x\neq y$ as shorthand for $\neg (x=y)$ . Thus, we do not need a distinct inequality relation.
Note that these relations describe the state of the underlying boardthe modeland not our particular view of it. Our particular view will be reflected in which formulaswe'll accept as premises. So we'll accept $\mathrm{has2}(A)$ as a premise only when $A$ has been exposed and shows a 2.
Many of our axioms correspond directly, albeit much more succinctly, with those of the propositional model. In addition, we have axioms that specify that our neighbor and equalityrelations are self-consistent.
Axioms asserting that the neighbor relation is anti-reflexive and symmetric:
Axioms asserting that=truly is an equality relation,
Axioms asserting that the neighbor counts are correct. Each of these is of the formif location $x$ has $n$ neighboring pirates, then there are $n$ distinct unsafe neighbors of $x$ , and any other distinct neighbor $x$ is safe.We use the equality relation to specify the distinctness of each neighbor.
In addition, we want the implications to go the opposite way. Otherwise, each of $\mathrm{has0}$ , $\mathrm{has1}$ , $\mathrm{has2}$ , and $\mathrm{has3}$ could always be false, while still satisfying the above!For brevity, we elide the details in the following list:
Axioms asserting that the neighbor counts are consistent. While redundant, including axioms like the following can be convenient.
Note that this set of axioms is not quite complete, as explored in an exercise .
Notification Switch
Would you like to follow the 'Intro to logic' conversation and receive update notifications?