We goal of the work is to derive four-voice music pieces from given musical plans, which describe the harmonic flow and the intentions of a desired composition. We developed the experimentation platform COMPOzE for intention based composition. COMPOzE is based on constraint programming over finite domains of integers. We argue that constraint programming provides a suitable technology for this task and that the libraries and tools available for the constraint programming system Oz effectively support the implementation of COMPOzE. This work links the research areas of automatic music composition on one hand and finite domain constraint programming on the other, and contributes the tool COMPOzE, which practically demonstrates the potential of constraint programming to open up new areas of application for automatic music composition.
{"title":"COMPOzE-intention-based music composition through constraint programming","authors":"M. Henz, Stefan Lauer, D. Zimmermann","doi":"10.1109/TAI.1996.560441","DOIUrl":"https://doi.org/10.1109/TAI.1996.560441","url":null,"abstract":"We goal of the work is to derive four-voice music pieces from given musical plans, which describe the harmonic flow and the intentions of a desired composition. We developed the experimentation platform COMPOzE for intention based composition. COMPOzE is based on constraint programming over finite domains of integers. We argue that constraint programming provides a suitable technology for this task and that the libraries and tools available for the constraint programming system Oz effectively support the implementation of COMPOzE. This work links the research areas of automatic music composition on one hand and finite domain constraint programming on the other, and contributes the tool COMPOzE, which practically demonstrates the potential of constraint programming to open up new areas of application for automatic music composition.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115380929","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}
Feedback in neural networks is essential. Without it, true dynamics would be lacking. For this reason, many well known models include feedback connections (e.g. Hopfield, ART, neocognitron). Neural networks with feedback are, however, likely to be unstable if not carefully designed. In this paper, we show how to incorporate long-range feedback in a class of dynamically stable nonlinear neural networks.
{"title":"Neural networks with long-range feedback: design for stable dynamics","authors":"R. Braham","doi":"10.1109/TAI.1996.560462","DOIUrl":"https://doi.org/10.1109/TAI.1996.560462","url":null,"abstract":"Feedback in neural networks is essential. Without it, true dynamics would be lacking. For this reason, many well known models include feedback connections (e.g. Hopfield, ART, neocognitron). Neural networks with feedback are, however, likely to be unstable if not carefully designed. In this paper, we show how to incorporate long-range feedback in a class of dynamically stable nonlinear neural networks.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116436323","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}
Forward checking (FC) is one of the most popular algorithms used to solve constraint satisfaction problems. A lazy variant of FC has been proposed called minimal forward checking (MFC). Previous empirical results suggest that MFC substantially outperforms FC when the fail first (FF) heuristic is not used. These results also suggest that the laziness of MFC can have substantial negative effects when the FF heuristic is used. To overcome this problem two extensions to the MFC algorithm are proposed, a new heuristic, called extra pruning (EXP), and the addition of conflict-directed backjumping (CBJ). An empirical investigation on a large test suite of hard randomly generated problems suggests that adding both EXP and CBJ to MFC-FF (MFC-CBJ-EXP-FF) is the best forward checking algorithm. Some theoretical relationships among the various algorithms are discussed.
{"title":"An empirical investigation of the forward checking algorithm and its derivatives","authors":"Michael J. Dent, Robert E. Mercer","doi":"10.1109/TAI.1996.560463","DOIUrl":"https://doi.org/10.1109/TAI.1996.560463","url":null,"abstract":"Forward checking (FC) is one of the most popular algorithms used to solve constraint satisfaction problems. A lazy variant of FC has been proposed called minimal forward checking (MFC). Previous empirical results suggest that MFC substantially outperforms FC when the fail first (FF) heuristic is not used. These results also suggest that the laziness of MFC can have substantial negative effects when the FF heuristic is used. To overcome this problem two extensions to the MFC algorithm are proposed, a new heuristic, called extra pruning (EXP), and the addition of conflict-directed backjumping (CBJ). An empirical investigation on a large test suite of hard randomly generated problems suggests that adding both EXP and CBJ to MFC-FF (MFC-CBJ-EXP-FF) is the best forward checking algorithm. Some theoretical relationships among the various algorithms are discussed.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116444701","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 aim of the paper is to describe a temporal constraint based solver for (job shop) scheduling problems. The heart of the solver is a "well behaved" restriction of the framework of TCSPs defined by R. Dechter, I. Meiri and J. Pearl (1991): the restriction is an algebra and expresses convex constraints or unions of two such constraints. We give a general description of the solver and show its completeness.
本文的目的是描述一个基于时间约束的作业车间调度问题求解器。求解器的核心是R. Dechter, I. Meiri和J. Pearl(1991)定义的tsps框架的“表现良好”的限制:该限制是一个代数，表示凸约束或两个此类约束的并集。给出了求解器的一般描述，并证明了其完备性。
{"title":"AI tools in scheduling problem solving: a solver based on a \"well-behaved\" restriction of TCSPs","authors":"Said Belhadji, A. Isli","doi":"10.1109/TAI.1996.560772","DOIUrl":"https://doi.org/10.1109/TAI.1996.560772","url":null,"abstract":"The aim of the paper is to describe a temporal constraint based solver for (job shop) scheduling problems. The heart of the solver is a \"well behaved\" restriction of the framework of TCSPs defined by R. Dechter, I. Meiri and J. Pearl (1991): the restriction is an algebra and expresses convex constraints or unions of two such constraints. We give a general description of the solver and show its completeness.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"37 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114046538","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}
This paper describes the design and implementation of a nurse rostering system using a redundant modeling approach. Nurse rostering is defined as a process of generating timetables for specifying the work shifts of nurses over a given period of time. This process is difficult because the human roster planner has to ensure that every rostering decision made complies with a mixture of hard hospital rules and soft nurse preference rules. Moreover, some nurse shift pre-assignments often break the regularity of wanted (or unwanted) shifts and reduce the choices for other unfilled slots. Soft constraints amount to disjunction, which can be modeled as choices in the search tree. This approach, although straightforward, incurs overhead in the search of solution. We propose redundant modeling, an effective way to speed up constraint propagation through cooperations among different models for the same problem, as a means to reduce search time. Experiments and pilot testing of the system confirm the feasibility of our method.
{"title":"A constraint-based nurse rostering system using a redundant modeling approach","authors":"B. Cheng, Jimmy Ho-man Lee, J. C. K. Wu","doi":"10.1109/TAI.1996.560444","DOIUrl":"https://doi.org/10.1109/TAI.1996.560444","url":null,"abstract":"This paper describes the design and implementation of a nurse rostering system using a redundant modeling approach. Nurse rostering is defined as a process of generating timetables for specifying the work shifts of nurses over a given period of time. This process is difficult because the human roster planner has to ensure that every rostering decision made complies with a mixture of hard hospital rules and soft nurse preference rules. Moreover, some nurse shift pre-assignments often break the regularity of wanted (or unwanted) shifts and reduce the choices for other unfilled slots. Soft constraints amount to disjunction, which can be modeled as choices in the search tree. This approach, although straightforward, incurs overhead in the search of solution. We propose redundant modeling, an effective way to speed up constraint propagation through cooperations among different models for the same problem, as a means to reduce search time. Experiments and pilot testing of the system confirm the feasibility of our method.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128408340","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}
Many real-world problems involve measures of objectives that may be dynamically optimized. The application of evolutionary algorithms in time dependent optimization is receiving growing interest as potential applications are numerous ranging from mobile robotics to real time process command. Moreover, constant evaluation functions skew results relative to natural evolution so that it has become a promising gap to combine effectiveness and diversity in a genetic algorithm. This paper features both theoretical and empirical analysis of the behavior of genetic algorithms in such an environment. It presents a comparison between the effectiveness of traditional sample genetic algorithm (SGA) and the dual genetic algorithm (DGA) which is revealed to be a particularly adaptive tool for optimizing a lot of diversified classes of functions. This comparison has been performed on a model of a dynamical environment. Its characteristics are analyzed in order to establish the basis of a testbed for further experiments. We discuss fundamental properties that explain the effectiveness of the dual paradigm to manage dynamical environments.
{"title":"An evolutionary approach for time dependant optimization","authors":"P. Collard, C. Escazut, Alessio Gaspar","doi":"10.1109/TAI.1996.560392","DOIUrl":"https://doi.org/10.1109/TAI.1996.560392","url":null,"abstract":"Many real-world problems involve measures of objectives that may be dynamically optimized. The application of evolutionary algorithms in time dependent optimization is receiving growing interest as potential applications are numerous ranging from mobile robotics to real time process command. Moreover, constant evaluation functions skew results relative to natural evolution so that it has become a promising gap to combine effectiveness and diversity in a genetic algorithm. This paper features both theoretical and empirical analysis of the behavior of genetic algorithms in such an environment. It presents a comparison between the effectiveness of traditional sample genetic algorithm (SGA) and the dual genetic algorithm (DGA) which is revealed to be a particularly adaptive tool for optimizing a lot of diversified classes of functions. This comparison has been performed on a model of a dynamical environment. Its characteristics are analyzed in order to establish the basis of a testbed for further experiments. We discuss fundamental properties that explain the effectiveness of the dual paradigm to manage dynamical environments.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129442947","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 framework for the development of a pumping system decision support tool based on artificial intelligence techniques has been investigated. Pump fault detection and diagnosis are key requirements of the decision support tool. Artificial Neural Networks (ANNs) were proposed for condition monitoring data interpretation utilising quantitative performance data. In the analysis, the Cumulative Sum (Cusum) charting procedure was successful in incipient fault identification. Various preprocessing techniques were investigated to obtain maximum diagnostic information despite the inherent problems of real industrial data. The orthonormal technique highlighted good generalisation ability in fast machine learning time. ANNs were successful for accurate, incipient diagnosis of pumping machinery fault conditions based on real industrial data corresponding to historical pump faults.
{"title":"Development of a pumping system decision support tool based on artificial intelligence","authors":"P. Ilott, A. Griffiths","doi":"10.1109/TAI.1996.560460","DOIUrl":"https://doi.org/10.1109/TAI.1996.560460","url":null,"abstract":"A framework for the development of a pumping system decision support tool based on artificial intelligence techniques has been investigated. Pump fault detection and diagnosis are key requirements of the decision support tool. Artificial Neural Networks (ANNs) were proposed for condition monitoring data interpretation utilising quantitative performance data. In the analysis, the Cumulative Sum (Cusum) charting procedure was successful in incipient fault identification. Various preprocessing techniques were investigated to obtain maximum diagnostic information despite the inherent problems of real industrial data. The orthonormal technique highlighted good generalisation ability in fast machine learning time. ANNs were successful for accurate, incipient diagnosis of pumping machinery fault conditions based on real industrial data corresponding to historical pump faults.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120908183","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}
Describes a practicable approach to extend relational databases to deductive databases by using a two-level knowledge representation mechanism. By this approach, we developed a deductive database add-in module that can be easily integrated with relational databases. Therefore, users can get deductive reasoning functionality without changing their favourite relational databases and query languages. This approach proved to be efficient on knowledge base organization and reasoning in real-world applications.
{"title":"A practical approach to knowledge representation and reasoning in relational databases","authors":"Jie Cheng, D. Bell, Weiru Liu","doi":"10.1109/TAI.1996.560791","DOIUrl":"https://doi.org/10.1109/TAI.1996.560791","url":null,"abstract":"Describes a practicable approach to extend relational databases to deductive databases by using a two-level knowledge representation mechanism. By this approach, we developed a deductive database add-in module that can be easily integrated with relational databases. Therefore, users can get deductive reasoning functionality without changing their favourite relational databases and query languages. This approach proved to be efficient on knowledge base organization and reasoning in real-world applications.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127691034","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 paper investigates a local approach for reasoning with conditional knowledge bases (with default rules of the form "generally, if /spl alpha/ then /spl beta/" and having possibly so,ne exceptions). The idea is that when a conflict appears (due to observing exceptional situations), one first localizes the sets of pieces of information which are responsible for conflicts. Next, using a specificity principle (subclasses must be preferred to general classes), the authors attach priorities to default rules inside each conflict. These priorities, implicitly computed from the knowledge base, reflect the hierarchical structure of the knowledge base. Lastly, they rank-order and solve conflicts in a way that only minimal sets of rules are given up from the knowledge base in order to restore its consistency. This local method of dealing with conflicts addresses correctly the well known problems of specificity, irrelevance, blocking of inheritance, etc.
本文研究了一种使用条件知识库进行推理的局部方法(默认规则的形式为“通常，if /spl alpha/ then /spl beta/”，并且可能有例外)。其思想是，当冲突出现时(由于观察到异常情况)，人们首先定位导致冲突的信息集。接下来，使用专用性原则(子类必须优先于一般类)，作者将优先级附加到每个冲突中的默认规则上。这些优先级，从知识库隐式计算，反映了知识库的层次结构。最后，他们对冲突进行排序，并以一种仅从知识库中放弃最小规则集的方式解决冲突，以恢复知识库的一致性。这种处理冲突的局部方法正确地解决了众所周知的专一性、不相关性、继承阻塞等问题。
{"title":"A local approach to reasoning with conditional knowledge bases","authors":"S. Benferhat, Laurent Garcia","doi":"10.1109/TAI.1996.560732","DOIUrl":"https://doi.org/10.1109/TAI.1996.560732","url":null,"abstract":"The paper investigates a local approach for reasoning with conditional knowledge bases (with default rules of the form \"generally, if /spl alpha/ then /spl beta/\" and having possibly so,ne exceptions). The idea is that when a conflict appears (due to observing exceptional situations), one first localizes the sets of pieces of information which are responsible for conflicts. Next, using a specificity principle (subclasses must be preferred to general classes), the authors attach priorities to default rules inside each conflict. These priorities, implicitly computed from the knowledge base, reflect the hierarchical structure of the knowledge base. Lastly, they rank-order and solve conflicts in a way that only minimal sets of rules are given up from the knowledge base in order to restore its consistency. This local method of dealing with conflicts addresses correctly the well known problems of specificity, irrelevance, blocking of inheritance, etc.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126360239","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}
Examines the pedagogical effectiveness of a natural language exploratory tool developed to supplement a hypermedia learning environment. The learning environment includes an authoring tool with which the relationships between entities can be easily expressed. These relationships are utilised directly by a natural language interface to engage the learner. By closely analysing the activities of learners using the tool, this study compares natural language exploration with the basic interaction provided by hypermedia environments. To facilitate this study, extensive data was compiled using both qualitative and quantitative techniques. Analysis of learner interactions revealed differences in their interactive behaviour. The group engaged in a discourse was more likely to be examining a coherent set of entities at any one time, and was less likely to experience feelings of disorientation. It is concluded that the natural language tool supports a wide range of learning styles.
{"title":"A comparative evaluation of a natural language exploration tool within a hypermedia environment","authors":"Mark A. Edwards, H. M. Powell, D. Palmer-Brown","doi":"10.1109/TAI.1996.560796","DOIUrl":"https://doi.org/10.1109/TAI.1996.560796","url":null,"abstract":"Examines the pedagogical effectiveness of a natural language exploratory tool developed to supplement a hypermedia learning environment. The learning environment includes an authoring tool with which the relationships between entities can be easily expressed. These relationships are utilised directly by a natural language interface to engage the learner. By closely analysing the activities of learners using the tool, this study compares natural language exploration with the basic interaction provided by hypermedia environments. To facilitate this study, extensive data was compiled using both qualitative and quantitative techniques. Analysis of learner interactions revealed differences in their interactive behaviour. The group engaged in a discourse was more likely to be examining a coherent set of entities at any one time, and was less likely to experience feelings of disorientation. It is concluded that the natural language tool supports a wide range of learning styles.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"439 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125763548","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
扫码关注我们
求助内容：
应助结果提醒方式：