Answer　set　programming,　called　ASP,　is　an　important　declarative　language　for　knowledge　representation　and　reasoning,　and　is　also　a　mature　tool　for　deriving　potential　facts.　However,　RDF　only　provides　a　simple　data　infrastructure　for　Semantic　Web,　which　not　only　ignores　the　classical　negation,　but　also　doesn＇t　support　inference　rules.　To　this　problem,　we　introduce　the　classical　negation　of　ASP　into　RDF,　and　develop　a　new　knowledge　representation　form　for　Semantic　Web,　called　inverted　left　perpendicularRDF.　In　addition,　we　use　the　inference　rules　of　ASP　to　discover　the　implicit　facts.　Finally,　we　show　an　example　for　the　applications.