The defining power of stratified and hierarchical logic programs

AbstractWe investigate the defining power of stratified and hierarchical logic programs. As an example for the treatment of negative information in the context of these structured programs we also introduce a stratified and hierarchical closed-world assumption. Our analysis tries to relate the defining power of stratified and hierarchical programs (with and without an appropriate closed-world assumption) very precisely to notions and hierarchies in classical definability theory