A view of the current hypertext technology and how it can be greatly aided through the use of artificial intelligence, especially expert systems shells, is provided. The proposed hypertext technology will contribute to the development of more advanced and sophisticated hypertext documents which can support built-in intelligence with memory retention capabilities.<>
{"title":"The role of expert system shells in hypertext technology","authors":"I. Hilerio, R. Lippert, Weidong Chen","doi":"10.1109/TAI.1992.246444","DOIUrl":"https://doi.org/10.1109/TAI.1992.246444","url":null,"abstract":"A view of the current hypertext technology and how it can be greatly aided through the use of artificial intelligence, especially expert systems shells, is provided. The proposed hypertext technology will contribute to the development of more advanced and sophisticated hypertext documents which can support built-in intelligence with memory retention capabilities.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126826748","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 task of implementing a simple rule-based production system in terms of a hybrid symbolic/connectionist architecture is discussed. The aim is to achieve parallel execution of rules. The architecture uses a local representation and builds upon prior work, which resulted in the symbolic/connectionist expert system development tool SC-net. The Hybrid Symbolic/Connectionist Production System (HSC-PS) reported supports two types of working memory elements, the attribute/value pair and the object/attribute/value triplet. HSC-PS can provide variable binding in an individual condition and across conditions and variable value instantiation from the left-hand side to the right-hand side in a rule. The network is constructed from production rules such that only one value is bound to a variable at any one time. An implementation of the farmer's dilemma planning problem is given to illustrate the potential of this approach.<>
{"title":"A hybrid/symbolic connectionist production system","authors":"K. Sanou, S. G. Romaniuk, L. Hall","doi":"10.1109/TAI.1992.246374","DOIUrl":"https://doi.org/10.1109/TAI.1992.246374","url":null,"abstract":"The task of implementing a simple rule-based production system in terms of a hybrid symbolic/connectionist architecture is discussed. The aim is to achieve parallel execution of rules. The architecture uses a local representation and builds upon prior work, which resulted in the symbolic/connectionist expert system development tool SC-net. The Hybrid Symbolic/Connectionist Production System (HSC-PS) reported supports two types of working memory elements, the attribute/value pair and the object/attribute/value triplet. HSC-PS can provide variable binding in an individual condition and across conditions and variable value instantiation from the left-hand side to the right-hand side in a rule. The network is constructed from production rules such that only one value is bound to a variable at any one time. An implementation of the farmer's dilemma planning problem is given to illustrate the potential of this approach.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129668108","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 representation for design cases and a method for indexing known cases to ease their retrieval, given the specification of a new problem, are presented. Each description includes structural and performance characteristics. Methods to retrieve known cases, to match them to often incomplete problem specifications, and to adapt them to solve the problem are devised.<>
{"title":"On reusing linkage designs","authors":"A. Bose, Maria L. Gini, D. Riley, A. Esterline","doi":"10.1109/TAI.1992.246367","DOIUrl":"https://doi.org/10.1109/TAI.1992.246367","url":null,"abstract":"A representation for design cases and a method for indexing known cases to ease their retrieval, given the specification of a new problem, are presented. Each description includes structural and performance characteristics. Methods to retrieve known cases, to match them to often incomplete problem specifications, and to adapt them to solve the problem are devised.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126991946","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 model of induction is presented. Knowledge that people use for inductive concept learning is represented explicitly in terms of default schemas. Therefore, concept learning can be viewed as nonmonotonic reasoning in default logic. A computational procedure is also provided as an implementation of the idea presented.<>
{"title":"Concept learning in default logic","authors":"Zhaogang Qian, K. Irani","doi":"10.1109/TAI.1992.246410","DOIUrl":"https://doi.org/10.1109/TAI.1992.246410","url":null,"abstract":"A model of induction is presented. Knowledge that people use for inductive concept learning is represented explicitly in terms of default schemas. Therefore, concept learning can be viewed as nonmonotonic reasoning in default logic. A computational procedure is also provided as an implementation of the idea presented.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122248041","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}
If a well-structured concurrent program is represented as a Petri net, it is possible to analyze the network for deadlock. By well-structured concurrent program is meant one in which levels of nesting follow structured programming tenets. Program liveness is defined for a well-structured concurrent program represented as a Pefri net, a Prolog program which will analyze the Petri net for deadlock is presented, and it is proved that the program truly implements the specification of program liveness.<>
{"title":"Logical development of a Petri net deadlock analysis program","authors":"D. Cooke","doi":"10.1109/TAI.1992.246407","DOIUrl":"https://doi.org/10.1109/TAI.1992.246407","url":null,"abstract":"If a well-structured concurrent program is represented as a Petri net, it is possible to analyze the network for deadlock. By well-structured concurrent program is meant one in which levels of nesting follow structured programming tenets. Program liveness is defined for a well-structured concurrent program represented as a Pefri net, a Prolog program which will analyze the Petri net for deadlock is presented, and it is proved that the program truly implements the specification of program liveness.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"270 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132563818","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}
G2 is an object-oriented development and deployment environment, combining rule-based and procedural reasoning, user interface graphics, database interface capabilities, dynamic simulation, and real-time execution in a single package. The applications of G2 typically have large knowledge bases, with tens of thousands of objects, and generally real-time execution is required. The online installations span the process industries, discrete manufacturing, aerospace, telecommunications, electric utilities, and others. Primarily these installations have been implemented directly by plant engineers, who have defined the knowledge contained in the applications using G2's structured natural language and active-object graphics. The design of G2 is described.<>
{"title":"The G2 development and deployment environment","authors":"Robert L. Moore","doi":"10.1109/TAI.1992.246450","DOIUrl":"https://doi.org/10.1109/TAI.1992.246450","url":null,"abstract":"G2 is an object-oriented development and deployment environment, combining rule-based and procedural reasoning, user interface graphics, database interface capabilities, dynamic simulation, and real-time execution in a single package. The applications of G2 typically have large knowledge bases, with tens of thousands of objects, and generally real-time execution is required. The online installations span the process industries, discrete manufacturing, aerospace, telecommunications, electric utilities, and others. Primarily these installations have been implemented directly by plant engineers, who have defined the knowledge contained in the applications using G2's structured natural language and active-object graphics. The design of G2 is described.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131570335","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 classification of different dynamic worlds is presented. A detailed model of a dynamic world where changes occur in edge costs around a zero mean is provided. A formal analysis of the model suggests that the static rank ordering of solution paths is preserved in the model. Two real-time search algorithms, DYNORAII and RTA*, for the real-time path planning problem are analyzed. Results on the path planning problem using the proposed dynamic model of graphs are given. The ability of DYNORAII and RTA* to minimize response times in dynamic environments has been evaluated experimentally. It is found that DYNORAII outperforms RTA* in minimizing response times.<>
{"title":"Evaluation of real-time search algorithms in dynamic worlds (summary of results)","authors":"S. Shekhar, B. Hamidzadeh","doi":"10.1109/TAI.1992.246379","DOIUrl":"https://doi.org/10.1109/TAI.1992.246379","url":null,"abstract":"A classification of different dynamic worlds is presented. A detailed model of a dynamic world where changes occur in edge costs around a zero mean is provided. A formal analysis of the model suggests that the static rank ordering of solution paths is preserved in the model. Two real-time search algorithms, DYNORAII and RTA*, for the real-time path planning problem are analyzed. Results on the path planning problem using the proposed dynamic model of graphs are given. The ability of DYNORAII and RTA* to minimize response times in dynamic environments has been evaluated experimentally. It is found that DYNORAII outperforms RTA* in minimizing response times.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133552026","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}
Considerable work has been done on parallelizing compilers for production languages, but the results are inadequate for tasks with large-scale parallelism. It is argued that explicitly parallel production languages are necessary for such tasks. PPL (Parallel Production Language), an explicitly parallel production language, is described. PPL is closely related to the OPS family of languages and is based primarily on OPS5.<>
在为生产语言并行化编译器方面已经做了大量的工作，但是对于具有大规模并行性的任务来说，结果是不够的。有人认为明确的并行生产语言对于这样的任务是必要的。描述了一种显式并行生产语言PPL (Parallel Production Language)。PPL与OPS语言家族密切相关，主要基于ops5.1 . bb0
{"title":"PPL: an explicitly parallel production language for large scale parallelism","authors":"A. Acharya","doi":"10.1109/TAI.1992.246458","DOIUrl":"https://doi.org/10.1109/TAI.1992.246458","url":null,"abstract":"Considerable work has been done on parallelizing compilers for production languages, but the results are inadequate for tasks with large-scale parallelism. It is argued that explicitly parallel production languages are necessary for such tasks. PPL (Parallel Production Language), an explicitly parallel production language, is described. PPL is closely related to the OPS family of languages and is based primarily on OPS5.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117169225","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}
Issues pertinent to the concurrent execution of rules in a database management system (DBMS) are studied. Rules are modeled as database transactions. As such, they should follow serializability as their correctness criterion for execution. Rule execution has the additional constraint that the rules, conditions must be true in the database for the actions that execute, and rules must fail when their conditions are not true any longer. Based on this observation, two locking-based protocols are discussed. Information on the possible conflicts between conditions and actions of rules is used to provide greater concurrent access to the relations, based on a new lock paradigm. A simulation testbed was developed in order to study the rule features and database characteristics that play an important role in the performance of concurrent production rule execution.<>
{"title":"Experiments on the concurrent rule execution in database systems","authors":"A. Delis, L. Raschid, T. Sellis","doi":"10.1109/TAI.1992.246437","DOIUrl":"https://doi.org/10.1109/TAI.1992.246437","url":null,"abstract":"Issues pertinent to the concurrent execution of rules in a database management system (DBMS) are studied. Rules are modeled as database transactions. As such, they should follow serializability as their correctness criterion for execution. Rule execution has the additional constraint that the rules, conditions must be true in the database for the actions that execute, and rules must fail when their conditions are not true any longer. Based on this observation, two locking-based protocols are discussed. Information on the possible conflicts between conditions and actions of rules is used to provide greater concurrent access to the relations, based on a new lock paradigm. A simulation testbed was developed in order to study the rule features and database characteristics that play an important role in the performance of concurrent production rule execution.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121886469","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 approach is presented to the invariant recognition of objects under dynamic perceptual conditions. In this approach, images of a sequence are used to adapt object descriptions to perceived online variabilities of object characteristics. This adaptation is made possible by the closed-loop integration of recognition processes of computer vision together with an incremental machine learning process. The experiments presented were run for the texture recognition problem and were limited to a partially supervised evolution of concept descriptions (models) rather than utilizing a fully autonomous model evolution. Obtained results are evaluated using the criteria of system recognition effectiveness and recognition stability.<>
{"title":"A learning-based evolution of concept descriptions for an adaptive object recognition","authors":"P. Pachowicz","doi":"10.1109/TAI.1992.246422","DOIUrl":"https://doi.org/10.1109/TAI.1992.246422","url":null,"abstract":"An approach is presented to the invariant recognition of objects under dynamic perceptual conditions. In this approach, images of a sequence are used to adapt object descriptions to perceived online variabilities of object characteristics. This adaptation is made possible by the closed-loop integration of recognition processes of computer vision together with an incremental machine learning process. The experiments presented were run for the texture recognition problem and were limited to a partially supervised evolution of concept descriptions (models) rather than utilizing a fully autonomous model evolution. Obtained results are evaluated using the criteria of system recognition effectiveness and recognition stability.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116787564","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
扫码关注我们
求助内容：
应助结果提醒方式：