Dear All

Lets restrict ourselfs to logical theories which consist only of formulas P1 -> .. Pn -> Q, i.e. propositional horn clauses expressed with implication. Lets only assume a subset of minimal logic, no (->R), only (->L).

My starting point is the following very primitive calculus:

P in G               P -> A in G  G => P  G, A => Q  
------- (init)       ------------------------------ (->L)
G => P                          G => Q

When we focus the (->L) that the head of A matches the goal Q, then we get backward chaining.

P1 -> .. Pn -> Q in G  G => P1  ... G => Pn
-------------------------------------------- (->L Backward)
                  G => Q

Now I am experimenting with another variant of (->L). Instead of requiring that the head machtes the goal, I require that the first atom in the body is already given:

P -> A in G     P in G     G, A => Q
---------------------------------- (->L Forward)
            G => Q

Is forward chaining also a from of focusing? What calculi have been developed for forward chaining.

Best Regards

P.S.: Question is inspired by the restate calculus in How establish conversion of cut-free proof into uniform proof?

P.S.S.: Here is an example of a backward chaining proof:

-------------- (init)
p, p -> q |- p
-------------- (->L Back)
p, p -> q |- q 

And here is an example of a forward chaining proof:

----------------- (init)
p, p -> q, q |- q
----------------- (->L Forward)
p, p -> q |- q