WE INTRIDUCE THE GENERAL NOTION OF A CONFLUENT LP - SYSTEM, WHICH IS A REWRINTING SYSTEM ON THE SET OF ALL LOGIC PROGRAMS OVER A SIGNATURE C. SUCH A SYSTEM IS BASED ON CERTAIN TRANSFORMATION RULES AND INDUCES A SEMANTICS SEM IN A NATURAL WAY. WE SHOW THAT MUST OF THE WELL - KNOWN SEMANTICS FOR NORMAL LOGIC PROGRAMS ARE INDUCED BY CONFLUENT LP - SYSTEMS. MOREOVER, WE SHOW BY INTRODUCING SEVERAL NEW TRANSFORMATION RULES THAT THE CORRESPONDING LP - SYSTEMS INDUCE INTERESTING SEMANTICS WHICH ARE POLYNOMIAL TIME COMPUTABLE AND EXTEND WFS. MOREOVER WE USE OUR APPROACH TO DEFINE NEW SEMANTICS FOR DISJUNTIVE PROGRAMS.WE INTRIDUCE THE GENERAL NOTION OF A CONFLUENT LP - SYSTEM, WHICH IS A REWRINTING SYSTEM ON THE SET OF ALL LOGIC PROGRAMS OVER A SIGNATURE C. SUCH A SYSTEM IS BASED ON CERTAIN TRANSFORMATION RULES AND INDUCES A SEMANTICS SEM IN A NATURAL WAY. WE SHOW THAT MUST OF THE WELL - KNOWN SEMANTICS FOR NORMAL LOGIC PROGRAMS ARE INDUCED BY CONFLUENT LP - SYSTEMS. MOREOVER, WE SHOW BY INTRODUCING SEVERAL NEW TRANSFORMATION RULES THAT THE CORRESPONDING LP - SYSTEMS INDUCE INTERESTING SEMANTICS WHICH ARE POLYNOMIAL TIME COMPUTABLE AND EXTEND WFS. MOREOVER WE USE OUR APPROACH TO DEFINE NEW SEMANTICS FOR DISJUNTIVE PROGRAMS.