- From: Adrian Walker <adrianw@snet.net>
- Date: Wed, 29 Jun 2005 08:24:46 -0400
- To: Francois Bry <bry@ifi.lmu.de>
- Cc: public-rule-workshop-discuss@w3.org
Bonjour Francois --
Many thanks for your kind comments on the proposal for rule system
interoperability based on messages
(http://www.w3.org/2004/12/rules-ws/paper/19/)
At 09:24 AM 6/29/2005 +0200, you wrote:
>I also like the vision of "Rule Spaces" you suggest in Section 2 of
>http://www.w3.org/2004/12/rules-ws/paper/19/, although I doubt it is
>realizable today as you describe3 it: "A logical model- or fixpoint-theory
>defining exactly what should be inferred from any given set of rules and
>facts." Having such aq theory in a both human and machiune processible
>form is, I believe, not achievable today - maybe in a feew decades.
Well, one example of this is our system that is online at the site
below. Its reasoning engine is based on the model- and fixpoint-theory in
[1], and on the proofs of completeness, soundness and termination of the
rule interpreter in [2].
The theory was developed a decade or so ago, so it's here now (:-)
-- Adrian
[1] Towards a theory of declarative knowledge,
in J. Minker, ed., Foundations of Deductive Databases, pp 89-148, (Morgan
Kaufmann, Washington, 1988).
[2] Backchain Iteration: Towards a Practical Inference Method that is
Simple Enough to be Proved Terminating, Sound and Complete. Journal of
Automated Reasoning, 11:1-22
INTERNET BUSINESS LOGIC (R)
www.reengineeringllc.com
Adrian Walker
Reengineering LLC
PO Box 1412
Bristol
CT 06011-1412 USA
Phone: USA 860 583 9677
Cell: USA 860 830 2085
Fax: USA 860 314 1029
Received on Wednesday, 29 June 2005 12:25:03 UTC