Equivalence of Logic Programs Under Updates [chapter]

Katsumi Inoue, Chiaki Sakama
2004 Lecture Notes in Computer Science  
P1 and P2 are weakly equivalent if they have the same declarative meaning. P1 and P2 are strongly equivalent if P1∪R and P2∪R have the same declarative meaning for any program R. † These equivalence relations compare capabilities of deductive reasoning between programs.
doi:10.1007/978-3-540-30227-8_17 fatcat:jnclh6ctkjbfbgpkbdflkzbzci