caa a22 4500 467988617 CHVBK 20180323112538.0 cr unu---uuuuu 170328e19901001xx s 000 0 eng 10.1007/BF03037516 doi (NATIONALLICENCE)springer-10.1007/BF03037516 Katsuno Hirofumi NTT Basic Research Laboratories, 3-9-11, Midori-cho, Musashino-shi, 180, Tokyo, Japan aut Closed world assumptions having precedence in predicates [Elektronische Daten] [Hirofumi Katsuno] This paper extends Reiter's closed world assumption to cases where the assumption is applied in a precedence order between predicates. The extended assumptions are: thepartial closed world assumption, thehierarchical closed world assumption and thestepwise closed world assumption. The paper also defines an extension of Horn formulas and shows several consistency results about the theory obtained from the extended Horn formulas by applying the proposed assumptions. In particular, the paper shows that both the hierarchical closed world assumption and the stepwise closed world assumption characterize the perfect model of stratified programs. Ohmsha, Ltd. and Springer, 1990 Deductive Database nationallicence Closed World Assumption nationallicence Stratified Program nationallicence Horn Clause nationallicence New Generation Computing Springer-Verlag 8/3(1990-10-01), 185-209 0288-3635 8:3<185 1990 8 354 https://doi.org/10.1007/BF03037516 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF03037516 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Katsuno Hirofumi NTT Basic Research Laboratories, 3-9-11, Midori-cho, Musashino-shi, 180, Tokyo, Japan aut NATIONALLICENCE 773 0- New Generation Computing Springer-Verlag 8/3(1990-10-01), 185-209 0288-3635 8:3<185 1990 8 354 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer