نتایج جستجو برای: backward chaining
تعداد نتایج: 27056 فیلتر نتایج به سال:
Abs t rac t . In this paper we extend work of Treitel and Genesereth for calculating cost estimates for alternative proof methods of logic programs. We consider four methods: (1) forward chaining by semi-n~ive bottom-up evaluation, (2) goM-directed forward chaining by semi-n~ive bottom-up evaluation after Generalized Magic-Sets rewriting, (3) b~ckwaxd chaining by OLD resolution, and (4) memoing...
This article represents one of the contemporary trends in the application of the latest methods of information and communication technology for medicine through an expert system helps the doctor to diagnose some chest diseases which is important because of the frequent spread of chest diseases nowadays in addition to the overlap symptoms of these diseases, which is difficult to right diagnose b...
The PRODIGY project is primarily concerned with the integration of planning and learning. Members of the PRODIGY research group have developed many learning algorithms for improving planning efficiency and plan quality, and for automatically acquiring knowledge about the properties of planning domains. The details of the PRODIGY planning algorithm, however, have not been described in the litera...
The work on Conceptual Modelling performed by our group at PUCRio is surveyed, covering four mutually dependent research topics. Regarding databases as a component of information systems, we extended the scope of the Entity-Relationship model, so as to encompass facts, events and agents in a three-schemata specification method employing a logic programming formalism. Next we proceeded to render...
As computer graphics evolves and expands into an essential component of many interactive systems, it is almost inevitable that the applications themselves become more complex and ambitious. In particular, the interactive system is rapidly becoming the intelligent system: Not only does the interface permit convenient access to the entities and operations of the application, but it also aids and ...
Applying a knowledge-based approach to monitoring and controlling real-time systems is often infeasible because the execution time of backward-chaining queries is unpredictable. In this paper, we show how a decomposition of reasoning into forward and backward inference can bound the execution time of queries. We present a domain modeling technique with algorithms for classifying knowledge into ...
1 Institute of Mathematics and Computer Science Academy of Sciences of Moldova Academiei 5, Chişinău MD-2028 Moldova E-mail: {sivanov,artiom}@math.md 2 Technical University of Moldova, Faculty of Computers, Informatics and Microelectronics, Ştefan cel Mare 168, Chişinău MD-2004 Moldova 3 Università degli Studi di Milano-Bicocca Dipartimento di Informatica, Sistemistica e Comunicazione Viale Sar...
Artificial chemistries are usually used to study what phenomena occur in a given setup, and simulators are the primary tools. This paper attempts to address a reverse question, that is, what setup is required to produce given molecules, using reasoning as the tool. We give a procedure to answer whether specified molecules can be produced in a given system described in our artificial chemistry, ...
Graphplan has attracted considerable interest because of its extremely high performance, but the algorithm's inability to handle action representations more expressive than STRIPS is a major limitation. In particular , extending Graphplan to handle conditional eeects is a surprisingly subtle enterprise. In this paper, we describe the space of possible alternatives, and then concentrate on one p...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید