Answer set programming is a declarative programming approach used to represent and solve complex search and reasoning problems. Problems are encoded as logic rules, and specialized solvers compute stable models, or answer sets, that correspond to valid solutions.
A form of declarative programming oriented towards difficult (primarily NP-hard) search problems. It is based on the stable model (answer set) semantics of logic programming. In ASP, search problems are reduced to computing stable models, and answer set solversβprograms for generating stable modelsβare used to perform search.