A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Inductive Equivalence of Logic Programs
[chapter]
2005
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/11536314_19
fatcat:ytly42423rd5hbxn2wzr4x5n74