Strategies for the computation of conditional answers
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/374591
Tipus de documentText en actes de congrés
Data publicació1990
EditorUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 4.0 Internacional
Abstract
We consider bere non-Horn Deductive Data Bases {DDB). In this con text there are many queries whose answer is : I don't know. A first approach to reduce the number of such answers is to add information, like default rules, in order to automatically generate assumptions. The second approach, which is adopted in this paper, is to provide to tbe user the conditions that guarantee the validity of the answer. These conditional answers are generated by standard reasoning, and not by default reasoníng.
Then the problem is the following : if T represents the DDB and q the query, and iI there is no direct answer to q, we want to produce the more general conctitions c such that : T |- q <- c. We present two strategies, GASP and GALP, designed for this purpose. They are defined by meta rules, and the meta.rules can be used for a least fixpoint operator definition. We show that the GASP strategy is always more efficient than GALP, but the GALP strategy can be adapted in order to compute ground conditional answers. The least fucpoint operator associated to GRALP (the strategy adapted from GALP) computes the answer in a finite number of steps, even if the DDB contains recursive definitions.
CitacióDemolombe, R. Strategies for the computation of conditional answers. A: . Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics, 1990, p. 49-71.
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
1DAISD_03 Strategies for the computation.pdf | 899,6Kb | Visualitza/Obre |