Mixed integer programming methods for computing nonmonotonic deductive databases
-
- Colin Bell
- Univ. of Iowa, Iowa City
-
- Anil Nerode
- Cornell Univ., Ithaca, NY
-
- Raymond T. Ng
- Univ. of British Columbia, Vancouver, B. C., Canada
-
- V. S. Subrahmanian
- Univ. of Maryland, College Park
書誌事項
- 公開日
- 1994-11
- 権利情報
-
- https://www.acm.org/publications/policies/copyright_policy#Background
- DOI
-
- 10.1145/195613.195637
- 公開者
- Association for Computing Machinery (ACM)
この論文をさがす
説明
<jats:p>Though the declarative semantics of both explicit and nonmonotonic negation in logic programs has been studied extensively, relatively little work has been done on computation and implementation of these semantics. In this paper, we study three different approaches to computing stable models of logic programs based on mixed integer linear programming methods for automated deduction introduced by R. Jeroslow. We subsequently discuss the relative efficiency of these algorithms. The results of experiments with a prototype compiler implemented by us tend to confirm our theoretical discussion. In contrast to resolution, the mixed integer programming methodology is both fully declarative and handles reuse of old computations gracefully.</jats:p> <jats:p>We also introduce, compare, implement, and experiment with linear constraints corresponding to four semantics for “explicit” negation in logic programs: the four-valued annotated semantics [Blair and Subrahmanian 1989], the Gelfond-Lifschitz semantics [1990], the over-determined models [Grant and Subrahmanian 1989], the Gelfond-Lifschitz semantics [1990], the over-determined models [Grant and Subrahmanian 1990], and the classical logic semantics. Gelfond and Lifschitz[1990] argue for simultaneous use of two modes of negation in logic programs, “classical” and “nonmonotonic,” so we give algorithms for computing “answer sets” for such logic programs too.</jats:p>
収録刊行物
-
- Journal of the ACM
-
Journal of the ACM 41 (6), 1178-1215, 1994-11
Association for Computing Machinery (ACM)
