1484

For example, an ASP program encoding a planning scenario has as many models as valid plans. This schema is similar to that underlying the application of propositional satisfiability (SAT) algorithms. In fact, the ranges of applicability of these two techniques are similar. The American Association for Artificial Intelligence, in cooperation with Stanford University's Department of Computer Science, presented the 2001 Spring Symposium Series on Monday through Wednesday, 26 to 28 March 2001, at Stanford University. The symposium began with Bart Selman's invited lecture on randomized methods for SAT.