Recently, in (Loyer & Straccia 2005) the Any-World Assumption (AWA) has been introduced for normal logic programs as a generalization of the well-known notions of Closed World Assumption (CWA) and the Open World Assumption (OWA). The AWA allows any assignment (i.e. interpretation), over a truth space (bilattice), to be a default assumption and, thus, the CWA and OWA are just special cases. While a declarative and a fixed-point characterization for normal logic programs under the AWA has been given in (Loyer & Straccia 2005), the topic of this paper is to provide a simple, yet general top-down query answering procedure for this setting.
展开▼
