Phil Vasey. Qualified answers and their application to transformation. In G. Goos and J. Hartmanis, editors, Proceedings of the 3rd International Conference on Logic Programming, number 225 in LNCS, pages 425--432, London, 1986. Springer-Verlag.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....124 rather than teach(Imielinski,x) a binary predicate, with Imielinski as one of the arguments to the predicate. Work proceeded from intensional answers to conditional answers, characterized by Sergot [1983] and Demolombe [1992, 1997] and identified by others interested in question answering [Vasey, 1986, Wolstenholme, 1988, Gilbert, 1988] With the exception of Michalski [1993] most of the work on conditional answers has focused on ground answers. The hypothetical component of such answers is seen to coincide in many cases with an abducible hypothesis [Kakas et al. 1998] We have elucidated ....

Phil Vasey. Qualified answers and their application to transformation. In G. Goos and J. Hartmanis, editors, Proceedings of the 3rd International Conference on Logic Programming, number 225 in LNCS, pages 425--432, London, 1986. Springer-Verlag.

....successful, failed, or infinite. Sometimes, however, we shall use derivations that end in a clause that could possibly be resolved with a program clause. We shall refer to these derivations as partial derivations. A partial derivation with a single subgoal initial goal yields a conditional answer [26]. Such an answer is a clause in which the head is the subgoal in the initial goal of that derivation with the composition of the substitutions applied to it, and the body is the set of subgoals in the last goal of that derivation. 4.2 Example We illustrate our method with the following program ....

Phil Vasey. Qualified answers and their application to transformation. In Proceedings of the Third International Logic Programming Conference, pages 425--432. SpringerVerlag Lecture Notes in Computer Science 225, 1986. 32

....of trial recruitment for this very reason in a project called T Helper [33] a follow on activity from work on the ONCOCIN system. We shall investigate the same problem but armed with different tools of analysis which exploit more obviously symbolic approaches to identify the qualifications [35, 37] necessary for eligibility. This approach can be viewed as the generation of incomplete arguments which need to be repaired and subsequently structured in some framework of logical uncertainty [7] so that eligibility can be suitably qualified. ACKNOWLEDGEMENTS The development of OaSiS has been ....

Vasey, P., Qualified answers and their application to transformation. Proc 3rd International Conference on Logic Programming, July 1986, London, UK. (Ed E Shapiro), Springer-Verlag.

.... t(F ) X = F : F : X) F : F : X) Z X : Y 1 = Z Y 1 = Y 2 ; Y 2 = Z F : X = Z 2 ; F : Z 2 = Z X : Y = Z apply(X; Y; Z) apply(F; X; Z 2 ) F : Z 2 = Z X : Y = Z apply(X; Y; Z) apply(F; X; Z 2 ) apply(F; Z 2 ; Z) The derivation is incomplete; it yields a conditional answer [8, 5] which is a clause where the initial goal with the cumulative substitution applied to it is the head and the final goal statement as body. The derivation proves that this conditional answer is logically implied by the input clauses of the SLD derivation. As far as we know the first logic program ....

P. Vasey. Qualified answers and their application to transformation. In Proceedings of the Third International Logic Programming Conference, pages 425--432, 1986.

....is to transfer these constraints to another solver, which employs interval narrowing for constraint solving, for further scrutiny, in the hope that the solver may narrow some intervals or reveal inconsistency. Thus, computation results given by our system are interpreted as conditional answers [54, 13]. Lemma 5.5: Assume that we have a linear system with m equalities of n variables. The incremental preconditioner update algorithm with inconsistency and redundancy detection has worst case time complexity O(n 2 (n m) Proof: We consider the most complicated case where there are n ....

....goal is empty; finitely failed if it is finite but the last goal has one or more atoms. The generalized M derivation ends with a floundered goal if the last goal has one or more stable constraints. Floundered goal gives incomplete solutions and should be interpreted as conditional answers [54]. Suppose a non empty goal G 1 ; Delta Delta Delta ; G n is derived from G 0 and is a composition of all the substitutions. The clause (G 0 G 1 ; Delta Delta Delta ; G n ) is a conditional answer to the original goal. 6.2 The CIAL Architecture Figure 4 gives an overview of the ....

P. Vasey. Qualified answers and their application to transformation. In Proceedings of the Third International Logic Programming Conference, pages 425--432, 1986.

....naturally covers the case when X=Y. Contrast this with the user defined constraint in the head of the original SiR that clearly cannot match = Now max can be defined by SiRs as follows. max(X,Y,Z) X= Y Y=Z. max(X,Y,Z) Y= X X=Z. max(X,Y,X) Y= X. 4 Also called qualified answer in [Va86]. max(X,Y,Y) X= Y. max(X,Y,Z) X= Z,Y= Z. max(X,Y,Z1) max(X,Y,Z2) Z1=Z2,max(X,Y,Z1) However, the CS for max is not complete, i.e. there are satisfiable or (worse) unsatisfiable constraint goals which are neither simplifiable nor callable. For example, the query max(X,7,9) results in ....

Vasey P., Qualified Answers and their Application to Transformation, Proc of the Third Intl Conf on Logic Programming 1986, pp. 425-432.

....the CIAL system is to transfer these constraints to another solver, which employs interval narrowing for constraint solving, for further scrutiny, in the hope that the solver may narrow some intervals or reveal inconsistency. Thus, computation results of CIAL are interpreted as conditional answers [20, 5]. Lemma 3.1 Assume that we have a linear system with m equalities of n variables. The incremental preconditioner update algorithm with inconsistency and redundancy detection has worst case time complexity O(n 2 (n m) Proof: We consider the most complicated case where there are n independent ....

P. Vasey. Qualified answers and their application to transformation. In Proceedings of the Third International Logic Programming Conference, pages 425--432, 1986.

....floating point system. Domain splitting can be used to narrow intervals to a desirable width but it may not find solutions either. Floundering can still occur. We call the floundered goals incomplete solutions. Logically, incomplete solutions can be interpreted as qualified or conditional answers [40, 4]. Let P be a logic program with domain variables and G a goal. Suppose, we have derived from G a non empty goal G 1 ; G n , with being the composition of all substitutions so far. The clause (G G 1 ; G n ) is a conditional answer to the original goal. From the soundness ....

Vasey, P., Qualified answers and their application to transformation. In Proceedings of the Third International Logic Programming Conference, pages 425--432, 1986.

....of knowledge, not just data, in a similar way to other systems [2] where the communication is about lamdba formulas; or the communication of inductive inferences as in [3] a work on multi agent learning systems. The specialisation calculus is also related to other work on conditioned answers [4, 16, 19] and on the treatment of unknown information [21] It allows us to obtain conditioned answers after the specialisation of a rule base with the known information. Our system is able to give back useful answers even in the case of partially known information. The main difference of specialisation ....

Phil Vasey. Qualified answers and their application to transformation. In G. Goos and J. Hartmanis, editors, Third International Conference in Logic Programming, LNCS 225, pages 425--432. Springer--Verlag, 1986.

No context found.

Vasey, P. (1986), `Qualified Answers and Their Application to Transformation', Proceedings of Third Int. Conf. on Logic Programming, Imperial College, London, July, 1986.

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