Answer Set Programming

A declarative problem-solving paradigm in which search problems are encoded as logic programs whose stable models (answer sets) correspond to solutions; nonmonotonic constructs and default negation express alternatives and constraints compactly.