SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Doherty Patrick 1957 ) srt2:(2000-2004)"

Sökning: WFRF:(Doherty Patrick 1957 ) > (2000-2004)

  • Resultat 1-10 av 28
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Doherty, Patrick, 1957-, et al. (författare)
  • 2003 AAAI Spring Symposium Series
  • 2003
  • Ingår i: The AI Magazine. - : AAAI Press. - 0738-4602. ; 24:3, s. 131-140
  • Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)abstract
    • The American Association for Artificial Intelligence, in cooperation with Stanford University’s Department of Computer Science, presented the 2003 Spring Symposium Series, Monday through Wednesday, 24–26 March 2003, at Stanford University.  The titles of the eight symposia were Agent-Mediated Knowledge Management, Computational Synthesis: From Basic Building Blocks to High- Level Functions, Foundations and Applications of Spatiotemporal Reasoning (FASTR), Human Interaction with Autonomous Systems in Complex Environments, Intelligent Multimedia Knowledge Management, Logical Formalization of Commonsense Reasoning, Natural Language Generation in Spoken and Written Dialogue, and New Directions in Question-Answering Motivation.
  •  
2.
  •  
3.
  • Doherty, Patrick, 1957- (författare)
  • Advanced Research with Autonomous Unmanned Aerial Vehicles
  • 2004
  • Ingår i: Proceedings of the 9th International Conference on the Principles of Knowledge Representation and Reasoning. - Menlo Park, CA : AAAI Press. - 9781577351993 ; , s. 731-732
  • Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
    • The emerging area of intelligent unmanned aerial vehicle (UAV) research has shown rapid development in recent years and offers a great number of research challenges for artificial intelligence and knowledge representation. For both military and civilian applications, there is a desire to develop more sophisticated UAV platforms where the emphasis is placed on intelligent capabilities and their integration in complex distributed software architectures. Such architectures should support the integration of deliberative, reactive and control functionalities in addition to the UAV’s integration with larger network centric systems. In my talk I will present some of the research and results from a long term basic research project with UAVs currently being pursued at Linköping University, Sweden. The talk will focus on knowledge representation techniques used in the project and the support for these techniques provided by the software architecture developed for our UAV platform, a Yamaha RMAX helicopter. Additional focus will be placed on some of the planning and execution monitoring functionality developed for our applications in the areas of traffic monitoring, surveying and photogrammetry and emergency services assistance.
  •  
4.
  • Doherty, Patrick, 1957-, et al. (författare)
  • Approximate Databases and Query Techniques for Agents with Heterogenous Perceptual Capabilities
  • 2004
  • Ingår i: Proceedings of the 7th International Conference on Information Fusion. - Mountain View, CA : ISIF. - 917056115X ; , s. 175-182
  • Konferensbidrag (refereegranskat)abstract
    • In this paper, we propose a framework that provides software and robotic agents with the ability to ask approximate questions to each other in the context of heterogeneous and contextually limited perceptual capabilities. The framework focuses on situations where agents have varying ability to perceive their environments. These limitations on perceptual capability are formalized using the idea of tolerance spaces. It is assumed that each agent has one or more approximate databases where approximate relations are represented using intuitions from rough set theory. It is shown how sensory and other limitations can be taken into account when constructing approximate databases for each respective agent. Complex relations inherit the approximativeness inherent in the sensors and primitive relations used in their definitions. Agents then query these databases and receive answers through the filters of their perceptual limitations as represented by tolerance spaces and approximate queries. The techniques used are all tractable.
  •  
5.
  • Doherty, Patrick, 1957-, et al. (författare)
  • Approximation Transducers and Trees : A Technique for Combining Rough and Crisp Knowledge
  • 2004
  • Ingår i: Rough-Neural Computing: Techniques for Computing with Words. - Berlin, Heidelberg, New York : Springer. - 9783540430599 - 3540430598 ; , s. 189-218
  • Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
    • Soft computing comprises various paradigms dedicated to approximately solving real-world problems, e.g., in decision making, classification or learning; among these paradigms are fuzzy sets, rough sets, neural networks, and genetic algorithms.It is well understood now in the soft computing community that hybrid approaches combining various paradigms provide very promising attempts to solving complex problems. Exploiting the potential and strength of both neural networks and rough sets, this book is devoted to rough-neurocomputing which is also related to the novel aspect of computing based on information granulation, in particular to computing with words. It provides foundational and methodological issues as well as applications in various fields.
  •  
6.
  • Doherty, Patrick, 1957-, et al. (författare)
  • Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities
  • 2004
  • Ingår i: Proceedings of the 9th International Conference on the Principles of Knowledge Representation and Reasoning. - Menlo Park, California : AAAI Press. - 9781577351993 ; , s. 459-468
  • Konferensbidrag (refereegranskat)abstract
    • In this paper, we propose a framework that provides software and robotic agents with the ability to ask approximate questions to each other in the context of heterogeneous ontologies and heterogeneous perceptive capabilities.The framework combines the use of logic-based techniques with ideas from approximate reasoning. Initial queries by an agent are transformed into approximate queries using weakest sufficient and strongest necessary conditions on the query and are interpreted as lower and upper approximations on the query. Once the base communication ability is provided, the framework is extended to situations where there is not only a mismatch between agent ontologies, but the agents have varying ability to perceive their environments. This will affect each agent’s ability to ask and interpret results of queries. Limitations on perceptive capability are formalized using the idea of tolerance spaces.
  •  
7.
  • Doherty, Patrick, 1957-, et al. (författare)
  • CAKE : A computer aided knowledge engineering technique.
  • 2002
  • Ingår i: Proceedings of the 15th European Conference on Artificial Intelligence,2002. - : IOS Press. ; , s. 220-224
  • Konferensbidrag (refereegranskat)abstract
    • Introduction: Logic engineering often involves the development of modeling tools and inference mechanisms (both standard and non-standard) which are targeted for use in practical applications where expressiveness in representation must be traded off for efficiency in use. Some representative examples of such applications would be the structuring and querying of knowledge on the semantic web, or the representation and querying of epistemic states used with softbots, robots or smart devices. In these application areas, declarative representations of knowledge enhance the functionality of such systems and also provide a basis for insuring the pragmatic properties of modularity and incremental composition. In addition, the mechanisms developed should be tractable, but at the same time, expressive enough to represent such aspects as default reasoning, or approximate or incomplete representations of the environments in which the entities in question are embedded or used, be they virtual or actual. [...]
  •  
8.
  • Doherty, Patrick, 1957-, et al. (författare)
  • Computing strongest necessary and weakest sufficient conditions of first-order formulas
  • 2001
  • Ingår i: 17th International Joint Conference on Artificial Intelligence,2001. - San Francisco, CA, USA : Morgan Kaufmann Publishers Inc.. - 1558608125 - 9781558608122 ; , s. 145-151
  • Konferensbidrag (refereegranskat)abstract
    • A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quantifier elimination techniques. The efficacy of the approach is demonstrated by using the techniques to compute snc's and wsc's for use in agent communication applications, theory approximation and generation of abductive hypotheses. Additionally, we generalize recent results involving the generation of successor state axioms in the propositional situation calculus via snc's to the first-order case. Subsumption results for existing approaches to this problem and a re-interpretation of the concept of forgetting as a process of quantifier elimination are also provided.
  •  
9.
  • Doherty, Patrick, 1957-, et al. (författare)
  • Efficient reasoning using the local closed-world assumption
  • 2000
  • Ingår i: Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems and Applications (AIMSA). - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783540410447 - 9783540453314 ; , s. 49-58
  • Konferensbidrag (refereegranskat)abstract
    • We present a sound and complete, tractable inference method for reasoning with localized closed world assumptions (LCWA’s) which can be used in applications where a reasoning or planning agent can not assume complete information about planning or reasoning states. This Open World Assumption is generally necessary in most realistic robotics applications. The inference procedure subsumes that described in Etzioni et al [9], and others. In addition, it provides a great deal more expressivity, permitting limited use of negation and disjunction in the representation of LCWA’s, while still retaining tractability. The ap- proach is based on the use of circumscription and quantifier elimination techniques and inference is viewed as querying a deductive database. Both the preprocessing of the database using circumscription and quan- tifier elimination, and the inference method itself, have polynomial time and space complexity.
  •  
10.
  • Doherty, Patrick, 1957-, et al. (författare)
  • Information Granules for Intelligent Knowledge Structures
  • 2003
  • Ingår i: Proceedings of the 9th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC). - : Springer. - 9783540140405 ; , s. 405-412
  • Konferensbidrag (refereegranskat)abstract
    • The premise of this paper is that the acquisition, aggregation, merging and use of information requires some new ideas, tools and techniques which can simplify the construction, analysis and use of what we call ephemeral knowledge structures. Ephemeral knowledge structures are used and constructed by granular agents. Each agent contains its own granular information structure and granular information structures of agents can be combined together. The main concept considered in this paper is an information granule. An information granule is a concise conceptual unit that can be integrated into a larger information infrastructure consisting of other information granules and dependencies between them. The novelty of this paper is that it provides a concise and formal definition of a particular view of information granule and its associated operators, as required in advanced knowledge representation applications.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 28

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy