Technical Barriers

• Efficiency
• But now we have fast computers, fast theorem provers,
  and Epilog, Stanford's advanced application-oriented FOTP
• Rule Expression
  Must completely hide formalism
        F(x,do(a,s)) ≡ ϒ_F⁺(x,a,s) ∨ (F(x,s) ∧ ¬ϒ_F^-(x,a,s)
• Business rules now, more is a research topic
• Semantics

This is where web services contribute.

---

---

©2007 Charles Petrie - permission to reproduce widely with attribution