In many dynamic application domains, the environment changes during problem solving. A problem solver, in these applications, does not have complete information about the task and resources, a priori. The problem solver is required to use up-to-date information that becomes available on line. It must use this information to avoid producing solutions that are obsolete by the time they are to be executed. The problem solver has to be opportunistic, in order to take immediate advantage of resources that become available and remain available for a short period of time. How opportunistic the algorithm should be depends on the degree of dynamicity in the environment. In this paper, we propose an algorithm which performs problem solving on line in order to obtain new information about the availability of resources in the system. The proposed algorithm adjusts itself automatically to adapt to the degree of dynamicity in the environment. We introduce a model of dynamicity in a graph representation of a task. We provide theoretical and empirical analyses of our algorithm for a routing problem in the proposed dynamic model. Our theoretical analyses demonstrate the correctness and completeness properties of our algorithm. Results of our performance-comparison experiments show that the proposed algorithm performs as well as the best of the candidate algorithms under a wide range of experiment parameters. The results also show that the proposed algorithm is capable of automatically adapting to the degree of dynamicity in the environment.
{"title":"Opportunistic behavior and its automatic adjustment in dynamic task domains","authors":"B. Hamidzadeh, A. Afshar","doi":"10.1109/TAI.1996.560474","DOIUrl":"https://doi.org/10.1109/TAI.1996.560474","url":null,"abstract":"In many dynamic application domains, the environment changes during problem solving. A problem solver, in these applications, does not have complete information about the task and resources, a priori. The problem solver is required to use up-to-date information that becomes available on line. It must use this information to avoid producing solutions that are obsolete by the time they are to be executed. The problem solver has to be opportunistic, in order to take immediate advantage of resources that become available and remain available for a short period of time. How opportunistic the algorithm should be depends on the degree of dynamicity in the environment. In this paper, we propose an algorithm which performs problem solving on line in order to obtain new information about the availability of resources in the system. The proposed algorithm adjusts itself automatically to adapt to the degree of dynamicity in the environment. We introduce a model of dynamicity in a graph representation of a task. We provide theoretical and empirical analyses of our algorithm for a routing problem in the proposed dynamic model. Our theoretical analyses demonstrate the correctness and completeness properties of our algorithm. Results of our performance-comparison experiments show that the proposed algorithm performs as well as the best of the candidate algorithms under a wide range of experiment parameters. The results also show that the proposed algorithm is capable of automatically adapting to the degree of dynamicity in the environment.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"3 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":"121280900","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}
Humans reason about different aspects of space (such as relative orientation, cardinal directions, distance, size and shape of objects) quite easily. With the aim of simulating human behavior, several models for these spatial concepts have been developed. Cognitive considerations have made these frameworks qualitative because it seems to deal better with the imprecision that human perception provides. Unfortunately no operational model which allows to reason with all these spatial aspects in an integrated way has been developed up to now. The first aim of our research has been the integration of different spatial concepts which is accomplished by the definition of an operational model based on first order predicate logic. Constraint logic programming extended with constraint handling rules provides the level of abstraction suited for the integration of qualitative relative orientation and qualitative distance. The second aim of our work is to apply qualitative spatial reasoning to robot path planning.
{"title":"Enhancing qualitative relative orientation with qualitative distance for robot path planning","authors":"M. Monferrer, F. T. Lobo","doi":"10.1109/TAI.1996.560449","DOIUrl":"https://doi.org/10.1109/TAI.1996.560449","url":null,"abstract":"Humans reason about different aspects of space (such as relative orientation, cardinal directions, distance, size and shape of objects) quite easily. With the aim of simulating human behavior, several models for these spatial concepts have been developed. Cognitive considerations have made these frameworks qualitative because it seems to deal better with the imprecision that human perception provides. Unfortunately no operational model which allows to reason with all these spatial aspects in an integrated way has been developed up to now. The first aim of our research has been the integration of different spatial concepts which is accomplished by the definition of an operational model based on first order predicate logic. Constraint logic programming extended with constraint handling rules provides the level of abstraction suited for the integration of qualitative relative orientation and qualitative distance. The second aim of our work is to apply qualitative spatial reasoning to robot path planning.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"22 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":"125932720","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}
We describe constraint solving using a rule-based approach. The distinction made between deduction rules and strategies by computational systems allows us to improve our understanding of the existing algorithms for solving binary CSPs (constraint satisfaction problems) once they are expressed as rewriting rules coordinated by strategies.
{"title":"Binary CSP solving as an inference process","authors":"Carlos Castro","doi":"10.1109/TAI.1996.560786","DOIUrl":"https://doi.org/10.1109/TAI.1996.560786","url":null,"abstract":"We describe constraint solving using a rule-based approach. The distinction made between deduction rules and strategies by computational systems allows us to improve our understanding of the existing algorithms for solving binary CSPs (constraint satisfaction problems) once they are expressed as rewriting rules coordinated by strategies.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"58 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":"126859629","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 presents Nestor, a hypertext system on the World Wide Web dedicated to the consultation of technical documents at France Telecom. Assuming the double hypothesis that navigations carried out by the user have on one hand a goal and on the other become more and more efficient through time, the connectionist approach aims to find relevant implicit links. Discovering these informal and useful links can be seen as a concrete realisation of what Vannevar Bush, one of the pioneers of hypertext, imagined, namely, the activity of trail blazers.
{"title":"Nestor: a trail blazer for hypertext","authors":"Y. Marchand, Jean-Luc Guérin","doi":"10.1109/TAI.1996.560737","DOIUrl":"https://doi.org/10.1109/TAI.1996.560737","url":null,"abstract":"The paper presents Nestor, a hypertext system on the World Wide Web dedicated to the consultation of technical documents at France Telecom. Assuming the double hypothesis that navigations carried out by the user have on one hand a goal and on the other become more and more efficient through time, the connectionist approach aims to find relevant implicit links. Discovering these informal and useful links can be seen as a concrete realisation of what Vannevar Bush, one of the pioneers of hypertext, imagined, namely, the activity of trail blazers.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"6 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":"125198904","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 concept of "natural language edit controls" (NLECs) is introduced. NLECs are special-purpose devices within graphical user interfaces (GUIs) for inputting part of a user's query in natural language which, when combined with other GUI controls for inputting the remainder of the query, can be used to build the most effective interface for a particular application. NLECs require less grammatical and lexical information than the equivalent component of a traditional natural language interface; hence their customization and maintenance costs tend to be lower.
{"title":"Natural language edit controls: constrained natural language devices in user interfaces","authors":"Gary Hall, F. Popowich, D. Fass","doi":"10.1109/TAI.1996.560793","DOIUrl":"https://doi.org/10.1109/TAI.1996.560793","url":null,"abstract":"The concept of \"natural language edit controls\" (NLECs) is introduced. NLECs are special-purpose devices within graphical user interfaces (GUIs) for inputting part of a user's query in natural language which, when combined with other GUI controls for inputting the remainder of the query, can be used to build the most effective interface for a particular application. NLECs require less grammatical and lexical information than the equivalent component of a traditional natural language interface; hence their customization and maintenance costs tend to be lower.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"26 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":"130979335","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}
We describe an approach, supported by a tool called ASTREE, designed to automate the construction of a model of problem solving behaviour in cases where skeletal models cannot be reused. In ASTREE, such a construction is an identification of methods capable of achieving user specified tasks. The identification process is based on matching elements specified in the task to be achieved and elements in the expertise ontology that expresses conceptualizations of domain knowledge. We argue that a well defined expertise ontology provides strong constraints for the creation of a model of problem solving behaviour. The article focuses on the main techniques that ASTREE uses in the identification process.
{"title":"Use of expertise ontologies in the knowledge engineering process","authors":"C. Reynaud, Françoise Tort","doi":"10.1109/TAI.1996.560436","DOIUrl":"https://doi.org/10.1109/TAI.1996.560436","url":null,"abstract":"We describe an approach, supported by a tool called ASTREE, designed to automate the construction of a model of problem solving behaviour in cases where skeletal models cannot be reused. In ASTREE, such a construction is an identification of methods capable of achieving user specified tasks. The identification process is based on matching elements specified in the task to be achieved and elements in the expertise ontology that expresses conceptualizations of domain knowledge. We argue that a well defined expertise ontology provides strong constraints for the creation of a model of problem solving behaviour. The article focuses on the main techniques that ASTREE uses in the identification process.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"117 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":"132300607","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 author presents le Salon, a tool for the construction and management of virtual places on the World Wide Web. Users are represented by interface agents that interact with each other and with independent artificial agents. All interactions follow a strict protocol which allows for partial grounding of the exchanged concepts. He believes that such grounding might lead to a more successful integration of artificial agents in environments designed for human actors.
{"title":"Le Salon, where agents meet actors","authors":"F. V. Aeken","doi":"10.1109/TAI.1996.560745","DOIUrl":"https://doi.org/10.1109/TAI.1996.560745","url":null,"abstract":"The author presents le Salon, a tool for the construction and management of virtual places on the World Wide Web. Users are represented by interface agents that interact with each other and with independent artificial agents. All interactions follow a strict protocol which allows for partial grounding of the exchanged concepts. He believes that such grounding might lead to a more successful integration of artificial agents in environments designed for human actors.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"61 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":"115881390","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 great deal of emphasis in classical AI planning research has been placed on search-control issues in plan generation, while the issue of knowledge representation and acquisition of models for use with classical planning engines has been largely ignored. Work in knowledge-based planning, on the other hand, is often associated with 'scruffy' AI, there being no standard representation languages with associated formal semantics for encoding domain models. In this paper we describe a method to create a planning domain model which preserves the domain independence, generality and 'clean' properties of generative planners to which the model can be attached. Our method is based an lifting the level of domain representation from the literal-centred, to the object-centred. This object-centred method has the advantage that it naturally allows for the creation of a supporting tools environment to help in (i) the creation and validation of a precise planning model, and (ii) the speed-up of plan generation.
{"title":"Object-centred planning: lifting classical planning from the literal level to the object level","authors":"T. McCluskey, D. Kitchin, J. Porteous","doi":"10.1109/TAI.1996.560475","DOIUrl":"https://doi.org/10.1109/TAI.1996.560475","url":null,"abstract":"A great deal of emphasis in classical AI planning research has been placed on search-control issues in plan generation, while the issue of knowledge representation and acquisition of models for use with classical planning engines has been largely ignored. Work in knowledge-based planning, on the other hand, is often associated with 'scruffy' AI, there being no standard representation languages with associated formal semantics for encoding domain models. In this paper we describe a method to create a planning domain model which preserves the domain independence, generality and 'clean' properties of generative planners to which the model can be attached. Our method is based an lifting the level of domain representation from the literal-centred, to the object-centred. This object-centred method has the advantage that it naturally allows for the creation of a supporting tools environment to help in (i) the creation and validation of a precise planning model, and (ii) the speed-up of plan generation.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"97 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":"127381620","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 Oz Scheduler; a workbench for scheduling problems. Through a graphical interface, the user can freely combine the elements that define a scheduling strategy. Such elements include constraints with different propagation behavior or distribution and search strategies. Exploring the possible combinations can lead to better solutions. Recent and successful techniques for scheduling are incorporated. Resulting from the selections made, a constraint problem is generated dynamically. For this problem, the solution statistics and the search can be inspected by several graphical tools. The functionality can be extended by sending messages to the Scheduler. The functionality and the implementation of the Oz Scheduler are discussed. The overall performance of the Scheduler for standard benchmarks is comparable to state-of-the-art special-purpose systems for scheduling. The implementation is based on the concurrent constraint language Oz.
{"title":"Oz Scheduler: a workbench for scheduling problems","authors":"J. Würtz","doi":"10.1109/TAI.1996.560445","DOIUrl":"https://doi.org/10.1109/TAI.1996.560445","url":null,"abstract":"This paper describes the Oz Scheduler; a workbench for scheduling problems. Through a graphical interface, the user can freely combine the elements that define a scheduling strategy. Such elements include constraints with different propagation behavior or distribution and search strategies. Exploring the possible combinations can lead to better solutions. Recent and successful techniques for scheduling are incorporated. Resulting from the selections made, a constraint problem is generated dynamically. For this problem, the solution statistics and the search can be inspected by several graphical tools. The functionality can be extended by sending messages to the Scheduler. The functionality and the implementation of the Oz Scheduler are discussed. The overall performance of the Scheduler for standard benchmarks is comparable to state-of-the-art special-purpose systems for scheduling. The implementation is based on the concurrent constraint language Oz.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"55 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":"114520619","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 system is described that uses a mixed-level representation of (part of) the meaning of natural language documents (based on standard Horn clause logic) and a variable-depth search strategy that distinguishes between the different levels of abstraction in the knowledge representation to locate specific passages in the documents. Mixed-level representations as well as variable depth search strategies are applicable in fields outside that of NLP.
{"title":"Deduction over mixed-level logic representations for text passage retrieval","authors":"Michael Hess","doi":"10.1109/TAI.1996.560480","DOIUrl":"https://doi.org/10.1109/TAI.1996.560480","url":null,"abstract":"A system is described that uses a mixed-level representation of (part of) the meaning of natural language documents (based on standard Horn clause logic) and a variable-depth search strategy that distinguishes between the different levels of abstraction in the knowledge representation to locate specific passages in the documents. Mixed-level representations as well as variable depth search strategies are applicable in fields outside that of NLP.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"52 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":"130116103","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
扫码关注我们
求助内容：
应助结果提醒方式：