Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94最新文献

筛选
英文 中文
Designing a tool to allow updates during plan recognition-challenges and applications 设计一个工具,允许在计划识别挑战和应用程序期间进行更新
R. Cohen, B. Spencer, Patrick M. Hoyt
{"title":"Designing a tool to allow updates during plan recognition-challenges and applications","authors":"R. Cohen, B. Spencer, Patrick M. Hoyt","doi":"10.1109/TAI.1994.346512","DOIUrl":"https://doi.org/10.1109/TAI.1994.346512","url":null,"abstract":"Traditionally, plan recognition is defined as the process of matching a set of observations from a user to a library of possible plans in a domain, indicating the possible candidate plans of the user. We have developed a system which allows updates to the plan library during plan recognition and which amends the list of candidate plans, without having to restart the plan recognition process. This work builds on H. Kautz's model (1987) of plan recognition and applies truth maintenance. We describe a graphic-oriented tool which we have developed for users of our system. We comment on the insights which we have gained, about the kinds of users and the kinds of modifications which we might want to accommodate. We emphasize the significance of the system, allowing incomplete or incorrect libraries to be amended. We summarize the challenges which remain, both for interface design and plan recognition. Finally, we elaborate on the potential use of our system for a variety of artificial intelligence applications including knowledge based systems, cooperative AI and natural language understanding.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116972230","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}
引用次数: 3
Pattern theoretic knowledge discovery 模式理论知识发现
J. Goldman
{"title":"Pattern theoretic knowledge discovery","authors":"J. Goldman","doi":"10.1109/TAI.1994.346400","DOIUrl":"https://doi.org/10.1109/TAI.1994.346400","url":null,"abstract":"Future research directions in knowledge discovery in databases (KDD) include the ability to extract an overlying concept relating useful data. Current limitations involve the search complexity to find that concept and what it means to be \"useful.\" The pattern theory research crosses over in a natural way to the aforementioned domain. The goal of this paper is threefold. First, we present a new approach to the problem of learning by discovery and robust pattern finding. Second, we explore the current limitations of a pattern theoretic approach as applied to the general KDD problem. Third, we exhibit its performance with experimental results on binary functions, and we compare those results with C4.5. This new approach to learning demonstrates a powerful method for finding patterns in a robust manner.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115698199","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}
引用次数: 13
Galois Lattice: a framework for concept learning. Design, evaluation and refinement 伽罗瓦晶格:概念学习的框架。设计、评估和改进
E. Mephu-nguifo
{"title":"Galois Lattice: a framework for concept learning. Design, evaluation and refinement","authors":"E. Mephu-nguifo","doi":"10.1109/TAI.1994.346456","DOIUrl":"https://doi.org/10.1109/TAI.1994.346456","url":null,"abstract":"The previously-reported LEGAL system is an empirical machine learning system based on Galois Lattice. Its aim is first to produce a semi-lattice from a concept denoted by a set of objects which are described with binary attributes. Then using some selected attribute conjunctions in the semi-lattice and a majority vote principle, LEGAL predicts new examples from unseen objects. This paper describes a new version LEGAL-E and its application to two biological problems: the prediction of splice junctions sites and the promoter recognition. Results obtained are far better than those of some symbolic learning systems, and are as better as those of some best neural networks methods. Moreover some empirical properties shared by LEGAL-E and neural networks are described. Finally this paper shows how the semi-lattice can be used as a dynamic neural network architecture in order to combine both learning techniques for knowledge refinement.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114162885","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}
引用次数: 19
A graphical environment for formally developing object-oriented software 用于正式开发面向对象软件的图形化环境
B. Cheng, E. Y. Wang, R. H. Bourdeau
{"title":"A graphical environment for formally developing object-oriented software","authors":"B. Cheng, E. Y. Wang, R. H. Bourdeau","doi":"10.1109/TAI.1994.346517","DOIUrl":"https://doi.org/10.1109/TAI.1994.346517","url":null,"abstract":"This paper describes a graphics-based software development environment that takes advantage of the visual nature of the Object Modeling Technique (OMT) notation and the benefits of formal methods. We have developed a prototype environment, VISUALSPECS, which enables a user to perform object-oriented analysis graphically using the OMT notation. VISUALSPECS generates a formal specification of the object-model, which can be systematically analyzed for completeness and consistency prior to implementation. The formal specifications can be used to guide the formal software. This graphical environment facilitates the development of reliable software using formal methods, enables automated of requirements and design information, and promotes software design reuse based on graphical notations.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122024401","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}
引用次数: 21
Model-based identification of primary causes 基于模型的主要原因识别
M. Tomasena
{"title":"Model-based identification of primary causes","authors":"M. Tomasena","doi":"10.1109/TAI.1994.346413","DOIUrl":"https://doi.org/10.1109/TAI.1994.346413","url":null,"abstract":"In this paper we describe a model-based diagnosis system for dynamic processes. Modelling relies on a causal graph whose nodes represent significant process variables and whose arcs represent causal relations. Each arc has an associated propagation function that represents the way in which a change in a variable is propagated to another. Different modes of behaviour are defined through the association of different propagation functions to arcs. Propagation functions are defined in a qualitative arithmetic allowing the use of numerical values and the use of some approximate values.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126015017","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}
引用次数: 0
An arc-consistency algorithm optimal in the number of constraint checks 一种约束检查次数最优的圆弧一致性算法
C. Bessiere, Jean-Charles Régin
{"title":"An arc-consistency algorithm optimal in the number of constraint checks","authors":"C. Bessiere, Jean-Charles Régin","doi":"10.1109/TAI.1994.346465","DOIUrl":"https://doi.org/10.1109/TAI.1994.346465","url":null,"abstract":"C. Bessiere and M.O. Cordier (1994) said that the AC-6 arc consistency algorithm is optimal in time on constraint networks where nothing is known about the constraint semantics. However, in constraint networks, it is always assumed that constraints are bidirectional. None of the previous algorithms achieving arc-consistency (AC-3, AC-4, AC-6) use constraint bidirectionality. We propose here an improved version of AC-6 which uses this property. Then, we claim that our new algorithm is optimal in the number of constraint checks performed (i.e. given a variable, value, and arc ordering, it performs the minimum possible number of constraint checks according to these orders).<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121863719","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}
引用次数: 21
Fuzzy expert system shells 模糊专家系统外壳
M. Umano, I. Hatono, H. Tamura
{"title":"Fuzzy expert system shells","authors":"M. Umano, I. Hatono, H. Tamura","doi":"10.1109/TAI.1994.346492","DOIUrl":"https://doi.org/10.1109/TAI.1994.346492","url":null,"abstract":"For developing fuzzy control systems and fuzzy expert systems, we have several shells. We describe two shells for expert systems, FPS (Fuzzy Production System) developed by the authors and FINEST (Fuzzy Inference Environment Software with Tuning) being developed in LIFE (Laboratory for International Fuzzy Engineering Research). FPS facilitates both forward and backward fuzzy reasoning. FINEST is a GUI-based shell using an extended fuzzy reasoning method with a tuning facility and all knowledge is represented by units.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121984035","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}
引用次数: 4
Distributed belief revision versus distributed truth maintenance 分布式信念修正与分布式真理维护
A. Dragoni, P. Puliti
{"title":"Distributed belief revision versus distributed truth maintenance","authors":"A. Dragoni, P. Puliti","doi":"10.1109/TAI.1994.346451","DOIUrl":"https://doi.org/10.1109/TAI.1994.346451","url":null,"abstract":"This paper outlines a distinction between distributed truth maintenance and distributed belief revision. The latter has a more complex conceptualization than the former and it needs the evaluation of special features as the relationship between the informant's reliability and the information's credibility. We point out some criteria to judge the qualities of a distributed belief revision strategy from a global perspective. However, the performances of such a strategy can be estimated only on a simulation basis. The general framework for assumption-based distributed belief revision that we present has been tested on our specific \"CLUEDO\" multi-agent simulation testbed. The model has been continuously improved during many cycles of modification of the model, simulation, and evaluation of the performances, till the results presented in this paper are achieved.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131284034","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}
引用次数: 42
R-calculus: a logical approach for knowledge base maintenance r演算:知识库维护的逻辑方法
Wei Li, N. Shen, Ju Wang
{"title":"R-calculus: a logical approach for knowledge base maintenance","authors":"Wei Li, N. Shen, Ju Wang","doi":"10.1109/TAI.1994.346387","DOIUrl":"https://doi.org/10.1109/TAI.1994.346387","url":null,"abstract":"The concepts of maintenance sequence of a knowledge base and their limits are introduced. Some concepts used in maintenance of knowledge bases, such as new laws, user's rejections, and reconstructions of a base are defined; the related theorems are proposed. Some computational aspects of reconstructions are studied; an R-calculus is given to deduce a reconstruction when a base meets a rejection. Especially, an R-calculus for logic programming is provided and implemented to do it. Finally, the theory is compared with AGM's theory of belief revision.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130571913","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}
引用次数: 8
Finite domain constraints in the ML functional language ML函数语言中的有限域约束
E. Chailloux, C. Codognet, P. Codognet
{"title":"Finite domain constraints in the ML functional language","authors":"E. Chailloux, C. Codognet, P. Codognet","doi":"10.1109/TAI.1994.346401","DOIUrl":"https://doi.org/10.1109/TAI.1994.346401","url":null,"abstract":"We propose an extension of the ML language for handling constraints in finite domains, as originally proposed by the CHIP Constraint Logic Programming Language, following and attending techniques originating from Constraint Satisfaction Problems. This makes it possible for the programmer to declaratively combine in a single application both purely functional parts and constraint solving parts for efficient handling of discrete search problems. In order to show the effectiveness of this approach, we present a simple demonstrative problem-solving example using finite domain constraints such as linear equations and disequations.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"238 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130390835","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信