WFS + Branch and Bound = Stable Models
| dc.contributor.author | Subrahmanian, V.S. | en_US |
| dc.contributor.author | Nau, D. | en_US |
| dc.contributor.author | Vago, C. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:51:19Z | |
| dc.date.available | 2007-05-23T09:51:19Z | |
| dc.date.issued | 1992 | en_US |
| dc.description.abstract | Through the semantics of non-monotonic logic programming has been studied extensively, relatively little work has been done on operational aspects of these semantics. In this paper, we develop techniques to compute the well-founded model of a logic program. We describe a prototype implementation and show, based on experimental results, that our technique is more efficient than the standard alternating fixpoint computation. Subsequently, we develop techniques to compute the set of all stable models of a deductive database. These techniques first compute the well- founded semantics and then use an intelligent branch and bound strategy to compute the stable models. We report on our implementation, as well as on experiments that we have conducted on the efficiency of our approach. | en_US |
| dc.format.extent | 2767592 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/5264 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1992-83 | en_US |
| dc.subject | algorithms | en_US |
| dc.subject | computational complexity | en_US |
| dc.subject | knowledge representation | en_US |
| dc.subject | databases | en_US |
| dc.subject | logic programming | en_US |
| dc.subject | Systems Integration | en_US |
| dc.title | WFS + Branch and Bound = Stable Models | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1