Abstract
We study a new programming framework based on logic programming where success and failure are replaced by predicates for adequacy and inadequacy. Adequacy allows to extract a result from a partial computation, and inadequacy allows to flexibly constrain the search space. In this parameterized setting, the classical result of independence of the selection rule does not hold. We show that, under certain conditions, whenever there exists an adequate derivation there is one in which only so-called needed atoms are selected. This result is applied in a practical setting where adequacy is expressed using a notion of request.
Original language | English |
---|---|
Title of host publication | Logic Programming |
Subtitle of host publication | Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, Manchester, UK, June 15-19, 1998 |
Editors | Joxan Jaffar |
Publisher | MIT Press |
Pages | 190-205 |
Number of pages | 16 |
ISBN (Print) | 0-262-60031-5 |
Publication status | Published - 1998 |
Event | 15th Joint International Conference and Symposium on Logic Programming, JICSLP 1998 - Manchester, United Kingdom Duration: 15 Jun 1998 → 19 Jun 1998 Conference number: 15 |
Conference
Conference | 15th Joint International Conference and Symposium on Logic Programming, JICSLP 1998 |
---|---|
Abbreviated title | JICSLP |
Country/Territory | United Kingdom |
City | Manchester |
Period | 15/06/98 → 19/06/98 |