Студопедия
Случайная страница | ТОМ-1 | ТОМ-2 | ТОМ-3
АрхитектураБиологияГеографияДругоеИностранные языки
ИнформатикаИсторияКультураЛитератураМатематика
МедицинаМеханикаОбразованиеОхрана трудаПедагогика
ПолитикаПравоПрограммированиеПсихологияРелигия
СоциологияСпортСтроительствоФизикаФилософия
ФинансыХимияЭкологияЭкономикаЭлектроника

Backward Chaining Procedure

Logical Functions | Rules of Inference | Recursive rules of inference | Computational terms |


Читайте также:
  1. A) Procedure of canceling flights under VMC conditions.
  2. Account opening and customer identification procedures/data
  3. Administrative Law and Procedure
  4. Bioprocessing Procedure
  5. Civil Procedure
  6. Communication procedures


How do deductive DBMS infer a response to a given goal?


Consider the previously discussed database dealing with information on programmers and managers employed by a software firm.
A Verifier Goal is interpreted as follows:


Finder goals are interpreted in a similar way:


Consider once again the previously discussed database dealing with information on programmers and managers employed by a software firm.
A Finder Goal is interpreted as follows:

 


Дата добавления: 2015-11-14; просмотров: 67 | Нарушение авторских прав


<== предыдущая страница | следующая страница ==>
Architecture of Deductive Database Systems| Forward Chaining Procedure

mybiblioteka.su - 2015-2024 год. (0.006 сек.)