Pseudo-Boolean Reasoning
Many AI systems represent knowledge in a Boolean form, writing a v b v
c to indicate that at least one of a, b, and c is true. An
alternative, however, is to write this as a+b+c > 0, where each of a,
b, and c is assigned a value of 1 if true or 0 if false.
This notation can be extended to a+b+c > k for some integer k, and it
can be shown that the extended notation is properly more efficient
than the usual one. Weights can also be added to get w*a + u*b + v*c
> k. This is a pseudo-Boolean representation. While in
common use in operations research, little work in AI has focussed on
this kind of description.
CIRL
Work is ongoing to extend some of the existing CIRL search engines
to a pseudo-Boolean setting.
See in particular the pages of
Dixon
and
Ginsberg.
Parent areas:
Language
Implementation:
PLRS
Back to the CIRL Overview Page.