- search hit 1 of 1
Grounding and Solving in Answer Set Programming
- Answer set programming is a declarative problem-solving paradigm that rests upon a work flow involving modeling, grounding, and solving. While the former is described by Gebser and Schaub (2016), we focus here on key issues in grounding, or how to systematically replace object variables by ground terms in an effective way, and solving, or how to compute the answer sets, of a propositional logic program obtained by grounding.
| Author details: | Benjamin KaufmannGND, Nicola Leone, Simona Perri, Torsten H. SchaubORCiDGND |
|---|---|
| ISSN: | 0738-4602 |
| Title of parent work (English): | AI magazine |
| Publisher: | Association for the Advancement of Artificial Intelligence |
| Place of publishing: | Menlo Park |
| Publication type: | Article |
| Language: | English |
| Year of first publication: | 2016 |
| Publication year: | 2016 |
| Release date: | 2020/03/22 |
| Volume: | 37 |
| Number of pages: | 8 |
| First page: | 25 |
| Last Page: | 32 |
| Funding institution: | DFG [SCHA 550/8, SCHA 550/9]; MIUR under PON project SI-LAB BA2KNOW Business Analitycs to Know; Regione Calabria, programme POR Calabria FESR |
| Peer review: | Referiert |
| Institution name at the time of the publication: | Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik |
