Elimination of Negation in a Logical Framework (2000)
Cached
Download Links
- [www.mcs.le.ac.uk]
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 10 - 3 self |
BibTeX
@TECHREPORT{Momigliano00eliminationof,
author = {Alberto Momigliano},
title = {Elimination of Negation in a Logical Framework},
institution = {},
year = {2000}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Logical frameworks with a logic programming interpretation such as hereditary Harrop formulae (HHF) [15] cannot express directly negative information, although negation is a useful specification tool. Since negation-as-failure does not fit well in a logical framework, especially one endowed with hypothetical and parametric judgements, we adapt the idea of elimination of negation introduced in [21] for Horn logic to a fragment of higher-order HHF. This entails finding a middle ground between the Closed World Assumption usually associated with negation and the Open World Assumption typical of logical frameworks; the main technical idea is to isolate a set of programs where static and dynamic clauses do not overlap.
