« Programmation par ensembles réponses » : différence entre les versions
m (Remplacement de texte — « [http » par « * [http ») |
m (ClaireGorjux a déplacé la page Answer set programming vers Programmation par ensembles réponses) |
(Aucune différence)
| |
Version du 12 mai 2021 à 10:12
en construction
Définition
...
Français
...
Anglais
Answer set programming
Answer set programming (ASP) is 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. 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[1][2] and the use of Prolog-style query evaluation for solving problems arising in these applications.
Contributeurs: Claire Gorjux, Jean Benoît Morel, wiki
