Robert Kowalski. Logic for Problem Solving. Elsevier Science Publishers, Amsterdam, The Netherlands, 1979.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....makes the search engine orthogonal to the script to be solved. Factoring script and exploration is an important design principle. It follows in spirit one of the main motivations of logic programming which is often referred to by the slogan algorithm logic control , due to Kowalski [72]. 4.5.1 Alternatives A straightforward approach is to use a choice statement for specifying the alternatives with which a space is to be distributed: where the statements # 1 , # n define the alternatives. This approach would statically fix the number of alternatives. The primitive ....

Robert Kowalski. Logic for Problem Solving. Elsevier Science Publishers, Amsterdam, The Netherlands, 1979.

....of justification. In this process of justification the rebutting defeaters and undercutting defeaters play the role of blocking factors they are the relevant factors that can drive an agent to retract certain beliefs. In McDermott and Doyle s nonmonotonic logic [32, 33] Reiter s default logic [39] and Moore s autoepistemic logic [35] the consistency test can be seen as the verification of the nonexistence of relevant information interfering with certain inference. In all these logics there is a general pattern of inference that allows to assume A in the absence of relevant information ....

Reiter, R. A Logic for Default Reasoning. Artificial Intelligence 13, pages 81-132. Elsevier Science Publishers (1980).

....C) 4 . It is remarkable and frustrating that the above monotonic solution in classical logic has not been discovered much earlier. Some people have been experimenting with situation calculus in logic programming ever since the first experiments in Kowalski s Logic for problem solving [21] (first edition in 76) That Prolog with negation as finite failure can be interpreted as a sound theorem prover wrt to the completion of a Prolog program is known since Clark s work [2] in 78. When [18] introduced the YTS problem to show the failure of several nonmonotonic solutions to the frame ....

R.A. Kowalski. Logic for problem solving. Elsevier Science Publisher, 1976.

....attempts to build an abductive proof procedure and to use it in the context of temporal reasoning. Examples can be found in [8] 19] 17] and [11] In our proposal we use the SLDNFA procedure described in [6] and [7] This procedure, an extension of the SLDNF resolution of Logic Programming ([12], 3] that can deal with abductive predicates, can handle deduction as well as abduction and allows for a correct treatment of non ground abducible atoms, which is necessary in our applications. Its soundness and completeness with respect to Console completion semantics are proven in [6] The ....

R. A. Kowalski. Logic for problem solving. Elsevier Science Publisher, 1976.

....C) 5 . It is remarkable and frustrating that the above monotonic solution in classical logic has not been discovered much earlier. Some people have been experimenting with situation calculus in logic programming ever since the first experiments in Kowalski s Logic for problem solving [21] (first edition in 76) That Prolog with negation as finite failure can be interpreted as a sound theorem prover wrt to the completion of a Prolog program is known since Clark s work [2] in 78. When [18] introduced the YTS problem to show the failure of several nonmonotonic solutions to the frame ....

R.A. Kowalski. Logic for problem solving. Elsevier Science Publisher, 1976.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC