Answer set programming

Answer set programming is a form of declarative programming oriented towards difficult (primarily NP-hard) search problems. It is based on the stable model 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.

Autorentext

Domenec Aran, PhD. Universitat Autonoma de Barcelona, Fulbright-GenCat: University of Massachusetts-Amherst.

Klappentext

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Answer set programming is a form of declarative programming oriented towards difficult (primarily NP-hard) search problems. It is based on the stable model 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.