Middle History of Logic Programming: Resolution, Planner, Edinburgh LCF, Prolog, Simula, and the Japanese Fifth Generation Project

Details Middle History of Logic Programming: Resolution, Planner, Edinburgh LCF, Prolog, Simula, and the Japanese Fifth Generation Project Middle History of Logic Programming: Resolution, Planner, Edinburgh LCF, Prolog, Simula, and the Japanese Fifth Generation Project

2009-04-20

arxiv.org/abs/0904.3036v23

Computer Science

Logic in Computer Science

configurations vs. global states

Scientific paper

Logic Programming can be broadly defined as "using logic to infer computational steps from existing propositions" However, mathematical logic cannot always infer computational steps because computational systems make use of arbitration for determining which message is processed next by a recipient that is sent multiple messages concurrently. Since arrival orders are in general indeterminate, they cannot be inferred from prior information by mathematical logic alone. Therefore mathematical logic cannot in general implement computation. Consequently, Procedural Embedding of Knowledge is strictly more general than Logic Programming. This conclusion is contrary to Robert Kowalski who stated "Looking back on our early discoveries, I value most the discovery that computation could be subsumed by deduction." Nevertheless, logic programming (like functional programming) can be a useful programming idiom. Over the course of history, the term "functional programming" has grown more precise and technical as the field has matured. Logic Programming should be on a similar trajectory. Accordingly, "Logic Programming" should have a general precise characterization. Kowalski's approach has been to advocate limiting Logic Programming to backward-chaining only inference based on resolution using reduction to conjunctive normal form in a global states model. In contrast, our approach is explore Logic Programming building on the logical inference of computational steps using inconsistency-robust reasoning in a configurations model. Because contemporary large software systems are pervasively inconsistent, it is not safe to reason about them using classical logic, e.g., using resolution theorem proving.

Affiliated with

Also associated with

No associations

Rating

Middle History of Logic Programming: Resolution, Planner, Edinburgh LCF, Prolog, Simula, and the Japanese Fifth Generation Project does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Middle History of Logic Programming: Resolution, Planner, Edinburgh LCF, Prolog, Simula, and the Japanese Fifth Generation Project, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Middle History of Logic Programming: Resolution, Planner, Edinburgh LCF, Prolog, Simula, and the Japanese Fifth Generation Project will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-174182