User loginNavigation 
Computation is not subsumed by deduction (contra claim by Kowalski)The challenge to the generality of Logic Programs as a foundation for computation was officially thrown in The Challenge of Open Systems [Hewitt 1985] to which [Kowalski 1988b] replied in LogicBased Open Systems. This was followed up with Guarded Horn clause languages: are they deductive and logical? [Hewitt and Agha 1988] in the context of the Japanese Fifth Generation Project (see section below). All of this was against Kowalski who stated â€œLooking back on our early discoveries, I value most the discovery that computation could be subsumed by deduction.â€ [Kowalski 1988]. However (contrary to Kowalski), computation in general is not subsumed by deduction. Mathematical models of computation do not determine particular computations as follows: The Actor Model makes use of arbitration for determining which message is next in the reception order of an Actor that is sent multiple messages concurrently. For example Arbiters can be used in the implementation of the reception order of messages sent to an Actor which are subject to indeterminacy in their reception order. Since reception orders are in general indeterminate, they cannot be inferred from prior information by mathematical logic alone. Therefore mathematical logic cannot implement computation in open systems. Consequently, Logic Programs can axiomatize but not in general implement computation. Shared financial accounts had been developed as a paradigmatic example of Actors [Hewitt, Bishop and Steiger 1973]. For example in ActorScript, a simple account can be implemented as follows: CreateEuroAccount.[startingBalance:Euros] â‰¡ Actor with currentBalance:=startingBalanceâ—Š implements Account using GetBalance[]â†’ currentBalanceÂ¶ Deposit[anAmount]â†’ Void afterward currentBalance:=currentBalance+anAmountÂ¶ Withdraw[anAmount]â†’ (anAmount > currentBalance) Â¿ True â† Throw OverdrawnException[]; False â† Void afterward currentBalance:=currentBalanceâ€“anAmount ?Â§â–® However, the above program cannot be implemented using logical deduction. The Procedural Embedding paradigm is strictly more general than the Logic Program paradigm. Nevertheless, Logic Programs (like Functional Programs) can be a useful idiom. For more information see Inconsistency Robustness in Logic Programs. By Hewitt at 20131208 02:15  LtU Forum  previous forum topic  next forum topic  other blogs  4259 reads

Browse archivesActive forum topics 
Recent comments
2 days 3 hours ago
2 days 4 hours ago
2 days 21 hours ago
6 days 15 hours ago
6 days 21 hours ago
6 days 23 hours ago
1 week 9 hours ago
1 week 2 days ago
1 week 3 days ago
1 week 3 days ago