Name
Abstract | ||
|---|---|---|
In answer-set programming (ASP), programs can be viewed as specifications of finite Herbrand structures. Other logics can be (and, in fact, were) used towards the same end and can be taken as the basis of declarative programming systems of similar functionality as ASP. We discuss here one such logic, the logic FO(ID), and its implementation IDP3. The choice is motivated by notable similarities between ASP and FO(ID), even if both approaches trace back to different origins |
Year | Venue | Field |
|---|---|---|
2016 | AI Magazine | Knowledge representation and reasoning,Programming language,Computer science,Algorithm,First-order logic,Artificial intelligence,Declarative programming |
DocType | Volume | Issue |
Journal | 37 | 3 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maurice Bruynooghe | 1 | 2767 | 226.05 |
| Marc Denecker | 2 | 1626 | 106.40 |
| Miroslaw Truszczynski | 3 | 1494 | 162.36 |