Answer Set Programming

Answer set programming is a form of declarative programming based on the stable model (answer set) semantics of logic programming.

Synonyms: ASP .

How it works

Answer set programming (ASP) is oriented towards difficult (primarily NP-hard) search problems. The computational process employed in the design of many answer set solvers is an enhancement of the DPLL algorithm and, in principle, it always terminates (unlike Prolog query evaluation, which may lead to an infinite loop).

In a more general sense, ASP includes all applications of answer sets to knowledge representation and the use of Prolog-style query evaluation for solving problems arising in these applications.

References

1. Answer set programming. (2023, April 27). In Wikipedia. Link