A. Momigliano. Minimal negation and hereditary Harrop formulae. In A. Nerode and M. Taitslin, editors, Proceedings of Logical Foundations of Computer Science (Tver '92), volume 620 of LNCS, pages 326-335, Berlin, Germany, July 1992. Springer. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Elimination of Negation in a Logical Framework - Momigliano (3 citations) Self-citation (Momigliano) (Correct)
....of the cut rule or failure of weakening. In the literature the issue has been addressed in essentially three ways: 1. By enforcing a strict distinction between CWA and OWA predicates and applying NF only to the former [10] where the latter would require minimal negation, for example as in [16]. 2. By switching to a modal logic, which is able to take into account arbitrary extensions of the program as possible worlds (see the completion construction in [9] for N Prolog and [4] for Hypothetical Datalog) 3. By embracing the idea of partiality in inductive de nitions and using the rule ....
A. Momigliano. Minimal negation and hereditary Harrop formulae. In A. Nerode and M. Taitslin, editors, Proceedings of Logical Foundations of Computer Science (Tver '92), volume 620 of LNCS, pages 326-335, Berlin, Germany, July 1992. Springer.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC