25 February 2004
CS 3243 - Logical Agents (part 2)
4
Inference by enumeration
nDepth-first enumeration of all models is sound and complete
n
n
n
n
n
n
n
n
n
nFor n symbols, time complexity is O(2n), space complexity is O(n)
This is a Model Checking version of proof