Inference by enumeration
n
Depth-first enumeration of all models is sound and complete
n
For
n
symbols, time complexity is
O(2
n
)
, space complexity is
O(n)
This is a Model Checking version of proof
