Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium最新文献

{"title":"Attempto Controlled English Meets the Challenges of Knowledge Representation, Reasoning, Interoperability and User Interfaces","authors":"Norbert E. Fuchs, K. Kaljurand, G. Schneider","doi":"10.5167/UZH-33148","DOIUrl":"https://doi.org/10.5167/UZH-33148","url":null,"abstract":"We present Attempto Controlled English — a user- \u0000friendly first-order logic language with a rich English \u0000syntax — and its associated tools, and demonstrate how \u0000they meet the challenges of knowledge representation, \u0000reasoning, interoperability and user interfaces created \u0000by large software projects like the semantic web.","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"2 1","pages":"664-669"},"PeriodicalIF":0.0,"publicationDate":"2006-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88493410","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}

{"title":"Automated Population of Cyc: Extracting Information about Named-entities from the Web","authors":"Purvesh Shah, David Schneider, Cynthia Matuszek, Robert C. Kahlert, Bjørn Aldag, David Baxter, J. Cabral, M. Witbrock, Jon Curtis","doi":"10.13016/M2NS0M20T","DOIUrl":"https://doi.org/10.13016/M2NS0M20T","url":null,"abstract":"Populating the Cyc Knowledge Base (KB) has been a manual process until very recently. However, there is currently enough knowledge in Cyc for it to be feasible to attempt to acquire additional knowledge autonomously. This paper describes a system that can collect and validate formally represented, fully-integrated knowledge from the Web or any other electronically available text corpus, about various entities of interest (e.g. famous people, organizations, etc.). Experimental results and lessons learned from their analysis are presented.","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"42 1","pages":"153-158"},"PeriodicalIF":0.0,"publicationDate":"2006-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73407177","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}

{"title":"Multi-Dimensional Dependency Grammar as Multigraph Description","authors":"Ralph Debusmann, G. Smolka","doi":"10.22028/D291-25855","DOIUrl":"https://doi.org/10.22028/D291-25855","url":null,"abstract":"Extensible Dependency Grammar (XDG) is new, modular grammar formalism for natural language. An XDG analysis is a multi-dimensional dependency graph, where each dimension represents a different aspect of natural language, e.g. syntactic function, predicate-argument structure, information structure etc. Thus, XDG brings together two recent trends in computational linguistics: the increased application of ideas from dependency grammar and the idea of multi-layered linguistic description. In this paper, we tackle one of the stumbling blocks of XDG so far—its incomplete formalization. We present the first complete formalization of XDG, as a description language for multigraphs based on simply typed lambda calculus. Introduction Extensible Dependency Grammar (XDG) (Debusmann et al. 2004) brings together two recent trends from computational linguistics: 1. dependency grammar 2. multi-layered linguistic description Firstly, the ideas of dependency grammar, lexicalization, the head-dependent asymmetry, valency etc., have become more and more popular in computational linguistics. Most of the popular grammar formalisms like Combinatorial Categorial Grammar (CCG) (Steedman 2000), Headdriven Phrase Structure Grammar (HPSG) (Pollard & Sag 1994), Lexical Functional Grammar (LFG) (Bresnan 2001) and Tree Adjoining Grammar (TAG) (Joshi 1987) have already adopted these ideas. Moreover, the most successful approaches statistical parsing crucially depend on notions from dependency grammar (Collins 1999), and new treebanks based on dependency grammar are being developed for various languages, e.g. the Prague Dependency Treebank (PDT) for Czech and the TiGer Dependency Bank for German. Secondly, many treebanks such as the Penn Treebank, the TiGer Treebank and the PDT are continuously being extended with additional layers of annotation in addition to the syntactic layer, i.e. they become more and more multilayered. For example, the PropBank (Kingsbury & Palmer Copyright c © 2006, American Association for Artificial Intelligence (www.aaai.org). All rights reserved. 2002) (Penn Treebank), the SALSA project (Erk et al. 2003) (TiGer Treebank) and the tectogrammatical layer (PDT) add a layer of predicate-argument structure. Other added layers concern information structure (PDT) and discourse structure as in the Penn Discourse Treebank (Webber et al. 2005). These additional layers of annotation are often dependencylike, i.e. could be straightforwardly represented in a framework for dependency grammar which is multi-layered. XDG is such a framework. It has already been successfully applied to model a relational syntax-semantics interface (Debusmann et al. 2004) and to model the relation between prosodic structure and information structure in English (Debusmann, Postolache, & Traat 2005). We hope to soon be able to employ XDG to directly make use of the information contained in the new multi-layered treebanks, e.g. for the automatic induction of multi-layered grammars for parsi","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"6 1","pages":"740-745"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78457700","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}

{"title":"Product-based Causal Networks and Quantitative Possibilistic Bases","authors":"S. Benferhat, F. Khellaf, A. Mokhtari","doi":"10.1142/S0218488505003618","DOIUrl":"https://doi.org/10.1142/S0218488505003618","url":null,"abstract":"In possibility theory, there are two kinds of possibilistic causal networks depending if possibilistic conditioning is based on the minimum or on the product operator. Similarly there are also two kinds of possibilistic logic: standard (min-based) possibilistic logic and quantitative (product-based) possibilistic logic. Recently, several equivalent transformations between standard possibilistic logic and min-based causal networks have been proposed. This paper goes one step further and shows that product-based causal networks can be encoded into product-based knowledge bases. The converse transformation is also provided.","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"11 1","pages":"832-837"},"PeriodicalIF":0.0,"publicationDate":"2005-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88633629","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}

{"title":"A Mutual Influence Algorithm for Multiple Concurrent Negotiations","authors":"K. Lam, Ho-fung Leung","doi":"10.1007/11552451_136","DOIUrl":"https://doi.org/10.1007/11552451_136","url":null,"abstract":"","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"76 1","pages":"836-837"},"PeriodicalIF":0.0,"publicationDate":"2005-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91295462","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}

{"title":"SpaceCAPS: Automated Mission Planning for the TechSat 21 Formation-Flying Cluster Experiment","authors":"J. Mohammed","doi":"10.21236/ada440102","DOIUrl":"https://doi.org/10.21236/ada440102","url":null,"abstract":"This paper describes a project concerned with the development of a mission planning system to provide automated planning assistance for the Air Force TechSat 21 formation-flying satellite cluster experiment: Spacecraft Cluster Automatic Planner/Scheduler (SpaceCAPS). The project’s focus is on planning and scheduling for payload management, but the system serves as a central planning system for planning and scheduling of all spacecraft functions. The paper describes some of the planning and scheduling requirements for cluster payload management, and describes a system for optimization of the mission plan for the TechSat 21 space-based radar surveillance system.","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"9 1","pages":"24-27"},"PeriodicalIF":0.0,"publicationDate":"2002-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91142700","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}

{"title":"Exploring Unknown Structured Environments","authors":"Jonathan F. Diaz, A. Stoytchev, R. Arkin","doi":"10.21236/ada443608","DOIUrl":"https://doi.org/10.21236/ada443608","url":null,"abstract":"This paper presents perceptual algorithms for corridor navigation, door detection and entry that can be used for exploration of an unknown floor of a building. The algorithms are fairly robust to sensor noise, do not use odometric data, and can be implemented on a low end PC. The primary sensor used is a laser range scanner.","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"68 1","pages":"145-149"},"PeriodicalIF":0.0,"publicationDate":"2001-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82606473","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}

{"title":"Probabilistic Planning for Behavior-Based Robots","authors":"Amin Atrash, Sven Koenig","doi":"10.21236/ada443594","DOIUrl":"https://doi.org/10.21236/ada443594","url":null,"abstract":"Abstract : Partially Observable Markov Decision Process models (POMDPs) have been applied to low-level robot control. We show how to use POMDPs differently, namely for sensor planning in the context of behavior-based robot systems. This is possible because solutions of POMDPs can be expressed as policy graphs, which are similar to the finite state automata that behavior-based systems use to sequence their behaviors. An advantage of our system over previous POMDP navigation systems is that it is able to find close-to-optimal plans since it plans at a higher level and thus with smaller state spaces. An advantage of our system over behavior-based systems that need to get programmed by their users is that it can optimize plans during missions and thus deal robustly with probabilistic models that are initially inaccurate.","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"16 1","pages":"531-535"},"PeriodicalIF":0.0,"publicationDate":"2001-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78378760","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}

{"title":"Mission Planning for Formation-Flying Satellite Cluster","authors":"J. Mohammed","doi":"10.21236/ada438434","DOIUrl":"https://doi.org/10.21236/ada438434","url":null,"abstract":"Abstract : The formation-flying satellite cluster is a new paradigm for space-based surveillance and remote sensing. In this paradigm, several small satellites fly in close formation and coordinate their activities so that through sparse-array interferometric and synthetic aperture techniques the cluster can effectively operate as though it were a much larger monolithic satellite. Management of such clusters will require increased automation for planning and scheduling, both in pre-flight mission planning and during operations. This paper describes work aimed at defining and meeting the special planning and scheduling requirements of the formation-flying cluster.","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"60 51","pages":"58-62"},"PeriodicalIF":0.0,"publicationDate":"2001-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91507924","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}

{"title":"Comparison of Multiple Agent-Based Organizations for Satellite Constellations (TechSat21)","authors":"T. Schetter, M. Campbell, Derek M. Surka","doi":"10.2514/2.3809","DOIUrl":"https://doi.org/10.2514/2.3809","url":null,"abstract":"A comparison is made of several autonomous software architectures for multiple satellite systems. Multiple, agent-based satellite systems are envisioned because they are capable of higher performance, lower cost, better fault tolerance, recone gurability, and upgradability. Software agents are dee ned at the spacecraft and functional levels, using a wide variety of algorithms including multivariable control, linear programming, fuzzy logic, contract net protocol, negotiation, and radar placement. The agent dee nitions allow many types of agent-based software architectures to be developed. Several novel agent-based architectures with a more traditional system for a distributed space-based radar mission are compared. Agent-based simulations of several mission scenarios show the autonomous operation of different organizations of increasing autonomy and compare the benee ts and drawbacks of each.","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"1 1","pages":"250-259"},"PeriodicalIF":0.0,"publicationDate":"2000-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83921952","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}