Constraint structures are presented as a new knowledge structure to encode both engineering part designs and constraints on those designs. Using a common representational form for both designs and constraints results in a number of practical advantages for a design evaluation system grounded on constraint structures. First, a graph unification algorithm generalized to operate on constraint structures is used as a mathematically elegant means of applying constraints to designs. As a side-effect of constraint structure unification, constraints are attached to design representations. Once the constraints become a part of the design representation, a part is able automatically to reevaluate relevant constraints following interactive changes to design parameters without re-invoking the unification algorithm.<>
{"title":"Feature-based design evaluation through constraint structure unification","authors":"K. Godden","doi":"10.1109/TAI.1991.167085","DOIUrl":"https://doi.org/10.1109/TAI.1991.167085","url":null,"abstract":"Constraint structures are presented as a new knowledge structure to encode both engineering part designs and constraints on those designs. Using a common representational form for both designs and constraints results in a number of practical advantages for a design evaluation system grounded on constraint structures. First, a graph unification algorithm generalized to operate on constraint structures is used as a mathematically elegant means of applying constraints to designs. As a side-effect of constraint structure unification, constraints are attached to design representations. Once the constraints become a part of the design representation, a part is able automatically to reevaluate relevant constraints following interactive changes to design parameters without re-invoking the unification algorithm.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114600114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
General-purpose knowledge representation systems serve two important purposes. First, such a system allows a knowledge engineer to model a new domain without being hampered by some special-purpose mechanism and without having to invent new tools. Second, knowledge stored in a general-purpose system becomes a resource that can be utilized by many users and applications within an organization. Three important requirements on such systems are that they be extensible and that they allow control of inference and temporal reasoning. A description is presented of the language features provided to meet these requirements and the mechanisms that are used to implement them efficiently in the KNOWBEL knowledge representation system.<>
{"title":"Metalevel and temporal reasoning in KNOWBEL: features and implementation","authors":"B. M. Kramer","doi":"10.1109/TAI.1991.167053","DOIUrl":"https://doi.org/10.1109/TAI.1991.167053","url":null,"abstract":"General-purpose knowledge representation systems serve two important purposes. First, such a system allows a knowledge engineer to model a new domain without being hampered by some special-purpose mechanism and without having to invent new tools. Second, knowledge stored in a general-purpose system becomes a resource that can be utilized by many users and applications within an organization. Three important requirements on such systems are that they be extensible and that they allow control of inference and temporal reasoning. A description is presented of the language features provided to meet these requirements and the mechanisms that are used to implement them efficiently in the KNOWBEL knowledge representation system.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114991930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
It is argued that some failure in the existing expert systems mainly results from the ill-organized knowledge bases. The authors propose an effective structure for a knowledge base called a solution-oriented structure, which is different from various existing knowledge base structures. Using several strategies of machine learning, an expert system tool called THOUGHT can reorganize the systematic structure into a solution-oriented structure. On the basis of the solution-oriented structure, THOUGHT can perform the three-level inference for solving different kinds of problems. The solution-oriented structure of the knowledge base is efficient and effective on large, complicated knowledge bases and time critical situations.<>
{"title":"Refinement of the structure of knowledge base by learning","authors":"Chengjiang Mao, J. Hong","doi":"10.1109/TAI.1991.167104","DOIUrl":"https://doi.org/10.1109/TAI.1991.167104","url":null,"abstract":"It is argued that some failure in the existing expert systems mainly results from the ill-organized knowledge bases. The authors propose an effective structure for a knowledge base called a solution-oriented structure, which is different from various existing knowledge base structures. Using several strategies of machine learning, an expert system tool called THOUGHT can reorganize the systematic structure into a solution-oriented structure. On the basis of the solution-oriented structure, THOUGHT can perform the three-level inference for solving different kinds of problems. The solution-oriented structure of the knowledge base is efficient and effective on large, complicated knowledge bases and time critical situations.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115105996","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The methods of fast hypothetical reasoning systems developed for propositional logic cannot be applicable in a straightforward manner to the predicate-logic case. A fast hypothetical reasoning mechanism that is effective for predicate-logic knowledge (actually for function-free predicate Horn-clause knowledge) is presented. A reasoning method developed in the deductive database area is effectively applied to this mechanism.<>
{"title":"An efficient hypothetical reasoning system for predicate-logic knowledge-base","authors":"Akiko Kondo, Toshiro Makino, M. Ishizuka","doi":"10.1109/TAI.1991.167116","DOIUrl":"https://doi.org/10.1109/TAI.1991.167116","url":null,"abstract":"The methods of fast hypothetical reasoning systems developed for propositional logic cannot be applicable in a straightforward manner to the predicate-logic case. A fast hypothetical reasoning mechanism that is effective for predicate-logic knowledge (actually for function-free predicate Horn-clause knowledge) is presented. A reasoning method developed in the deductive database area is effectively applied to this mechanism.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116248945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abduction is the process of generating the best explanation as to why a fact is observed given what is already known. A real problem in this area is the selective generation of hypotheses that have some reasonable prospect of being valid. The author proposes the notion of skeptical abduction as a model to face this problem. After providing a definition of abductive reasoning, skeptical abduction and specific abduction are compared in a logical framework. The mechanism of abductive reasoning in propositional logic is investigated and its generalization to first-order logic is discussed.<>
{"title":"Mechanizing skeptical abduction and its applications to artificial intelligence","authors":"P. Marquis","doi":"10.1109/TAI.1991.167108","DOIUrl":"https://doi.org/10.1109/TAI.1991.167108","url":null,"abstract":"Abduction is the process of generating the best explanation as to why a fact is observed given what is already known. A real problem in this area is the selective generation of hypotheses that have some reasonable prospect of being valid. The author proposes the notion of skeptical abduction as a model to face this problem. After providing a definition of abductive reasoning, skeptical abduction and specific abduction are compared in a logical framework. The mechanism of abductive reasoning in propositional logic is investigated and its generalization to first-order logic is discussed.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116445194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Estella general analysis tool (E-GAT) is a computer-aided software engineering tool for performing response time analysis of real-time production systems written in the EQL rule-based language. E-GAT detects potential timing errors statically, making it a powerful aid for the rapid prototyping and development of expert systems with guaranteed response time. It is based on a powerful analysis methodology which exploits the identification of rule sets satisfying certain general behavior constraint assertions. A description is presented of the implementation of E-GAT with efficient algorithms.<>
{"title":"Implementing a tool for timing analysis of real-time production systems","authors":"A. Cheng","doi":"10.1109/TAI.1991.167045","DOIUrl":"https://doi.org/10.1109/TAI.1991.167045","url":null,"abstract":"The Estella general analysis tool (E-GAT) is a computer-aided software engineering tool for performing response time analysis of real-time production systems written in the EQL rule-based language. E-GAT detects potential timing errors statically, making it a powerful aid for the rapid prototyping and development of expert systems with guaranteed response time. It is based on a powerful analysis methodology which exploits the identification of rule sets satisfying certain general behavior constraint assertions. A description is presented of the implementation of E-GAT with efficient algorithms.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125868337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
An intelligent electronic secretary service is described which was developed as an example of providing communication services using artificial intelligence (AI) techniques. It processes incoming calls in much the same way as a human secretary. (1) It automatically modifies or supplements incorrect or missing user instructions in dealing with incoming calls. (2) It automatically extends its knowledge base for individual users using a learning function. Its knowledge bases include the following: knowledge about users to infer the user's status; knowledge about services to infer the effect of asking for a particular service; and knowledge about services used to infer whether the service asked for is suited to the user's status. The learning function is based on the process of induction.<>
{"title":"An intelligent network service prototype using knowledge processing","authors":"T. Ide, A. Hakata, M. W. Kim","doi":"10.1109/TAI.1991.167126","DOIUrl":"https://doi.org/10.1109/TAI.1991.167126","url":null,"abstract":"An intelligent electronic secretary service is described which was developed as an example of providing communication services using artificial intelligence (AI) techniques. It processes incoming calls in much the same way as a human secretary. (1) It automatically modifies or supplements incorrect or missing user instructions in dealing with incoming calls. (2) It automatically extends its knowledge base for individual users using a learning function. Its knowledge bases include the following: knowledge about users to infer the user's status; knowledge about services to infer the effect of asking for a particular service; and knowledge about services used to infer whether the service asked for is suited to the user's status. The learning function is based on the process of induction.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127323666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The capability of the multilayer feedforward layered neural network with Omega -shaped activation functions is studied. The authors prove that a three layer neural network with any continuous Omega -shaped activation function can approximate any continuous function in the multidimensional real space. Further theoretical extensions to the generalized Omega -shaped function are also explored. One example of this kind of neural network is the Hermite network.<>
{"title":"The capability of feedforward neural networks with Omega -shaped activation functions","authors":"Yiwei Chen, F. Bastani","doi":"10.1109/TAI.1991.167096","DOIUrl":"https://doi.org/10.1109/TAI.1991.167096","url":null,"abstract":"The capability of the multilayer feedforward layered neural network with Omega -shaped activation functions is studied. The authors prove that a three layer neural network with any continuous Omega -shaped activation function can approximate any continuous function in the multidimensional real space. Further theoretical extensions to the generalized Omega -shaped function are also explored. One example of this kind of neural network is the Hermite network.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130839884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A novel digital network architecture, the sequential pipelined neurocomputer (SPIN), is proposed. The SPIN processor emulates neural networks, producing high performance with minimal hardware by sequentially processing each neuron in the modeled completely connected network with a pipelined physical neuron structure. In addition to describing SPIN, performance equations are estimated for the ring systolic, the recurrent systolic array, and the neuromimetic neurocomputer architectures, three previously reported schemes for the emulation of neural networks, and a comparison with the SPIN architecture is reported.<>
{"title":"SPIN: a sequential pipelined neurocomputer","authors":"S. Vassiliadis, G. Pechanek, J. Delgado-Frías","doi":"10.1109/TAI.1991.167078","DOIUrl":"https://doi.org/10.1109/TAI.1991.167078","url":null,"abstract":"A novel digital network architecture, the sequential pipelined neurocomputer (SPIN), is proposed. The SPIN processor emulates neural networks, producing high performance with minimal hardware by sequentially processing each neuron in the modeled completely connected network with a pipelined physical neuron structure. In addition to describing SPIN, performance equations are estimated for the ring systolic, the recurrent systolic array, and the neuromimetic neurocomputer architectures, three previously reported schemes for the emulation of neural networks, and a comparison with the SPIN architecture is reported.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130902480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Exploration is made of how methods of truth maintenance may be applied in the engineering of integrated, dynamic systems. In the life of a large system, it is not possible to foresee every significant event which may affect the behavior of the system. Truth maintenance techniques may prove useful in the production and maintenance of these large systems. A discussion is presented of how it is the decision making aspects of a system which change. Both the information on which the authors base their decisions and strategies for decision making change. Truth maintenance is discussed with respect to preserving the models of specifications and the models of programs.<>
{"title":"The correspondence between methods of artificial intelligence and the production and maintenance of evolutionary software","authors":"C. Ramamoorthy, D. Cooke","doi":"10.1109/TAI.1991.167083","DOIUrl":"https://doi.org/10.1109/TAI.1991.167083","url":null,"abstract":"Exploration is made of how methods of truth maintenance may be applied in the engineering of integrated, dynamic systems. In the life of a large system, it is not possible to foresee every significant event which may affect the behavior of the system. Truth maintenance techniques may prove useful in the production and maintenance of these large systems. A discussion is presented of how it is the decision making aspects of a system which change. Both the information on which the authors base their decisions and strategies for decision making change. Truth maintenance is discussed with respect to preserving the models of specifications and the models of programs.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133415588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：