Programming with Tabling in XSB
David Scott Warren · 1998
I describe how XSB, a tabling Prolog system, can be used effectively to program useful tasks in a variety of domains. The presentation is through the use of examples, with examples being taken from some of the following areas: traditional dynamic programming problems, finite state automata theory, context-free language recognition, parsing and analysis, recursive aggregation, meta-interpreters, program analysis and abstract interpretation, model checking, and abduction. Program analysis and model checking will be emphasized.