MindShare: Knowledge Sharing via
... one can anecdotally observe the sparseness of Yahoo's ontology by viewing Yahoo's category for their field of expertise and noting that the majority of useful Webavailable documents in their field are not categorized by Yahoo. It is not merely a matter of time before Yahoo's ontologists can catch up ...
... one can anecdotally observe the sparseness of Yahoo's ontology by viewing Yahoo's category for their field of expertise and noting that the majority of useful Webavailable documents in their field are not categorized by Yahoo. It is not merely a matter of time before Yahoo's ontologists can catch up ...
Design PDF
... www.cisco.com/go/trademarks. Third party trademarks mentioned are the property of their respective owners. The use of the word partner does not imply a partnership relationship between Cisco and any other company. (1005R) Any Internet Protocol (IP) addresses used in this document are not intended to ...
... www.cisco.com/go/trademarks. Third party trademarks mentioned are the property of their respective owners. The use of the word partner does not imply a partnership relationship between Cisco and any other company. (1005R) Any Internet Protocol (IP) addresses used in this document are not intended to ...
querying description logic knowledge bases
... Description Logics [6] are knowledge representation languages with a formally defined syntax and semantics. A Description Logic allows for the specification of concepts (also known as classes), individuals (also known as objects) that are instances of these concepts, and roles (also known as propert ...
... Description Logics [6] are knowledge representation languages with a formally defined syntax and semantics. A Description Logic allows for the specification of concepts (also known as classes), individuals (also known as objects) that are instances of these concepts, and roles (also known as propert ...
Artificial Intelligence Illuminated
... This book is intended for students of computer science at the college level, or students of other subjects that cover Artificial Intelligence. It also is intended to be an interesting and relevant introduction to the subject for other students or individuals who simply have an interest in the subjec ...
... This book is intended for students of computer science at the college level, or students of other subjects that cover Artificial Intelligence. It also is intended to be an interesting and relevant introduction to the subject for other students or individuals who simply have an interest in the subjec ...
Game World Implementation of Artificial Recognition
... they are not following the proper meaning of what should be AI because of probabilities. Sometimes, an option that has a low probability to be done could be the proper one to be chosen. However, if probabilities want to be set aside, new prioritization systems would be found as could be the psychoan ...
... they are not following the proper meaning of what should be AI because of probabilities. Sometimes, an option that has a low probability to be done could be the proper one to be chosen. However, if probabilities want to be set aside, new prioritization systems would be found as could be the psychoan ...
Best-First Heuristic Search for Multicore Machines Ethan Burns .
... We evaluate PRA* (and its variants), PBNF and other algorithms empirically using dual quadcore Intel machines. We study their behavior on three popular search domains: STRIPS planning, grid pathfinding, and the venerable sliding tile puzzle. Our empirical results show that the simplest parallel sear ...
... We evaluate PRA* (and its variants), PBNF and other algorithms empirically using dual quadcore Intel machines. We study their behavior on three popular search domains: STRIPS planning, grid pathfinding, and the venerable sliding tile puzzle. Our empirical results show that the simplest parallel sear ...
A Framework for Abstract Group Argumentation
... 3. modules provide explicit means to model meta-argumentation where the arguments in one module are about the arguments in another module; this leads to more realistic accounts of, say, legal argumentation processes. In the simplest multi-module situation, one module determines the context for anoth ...
... 3. modules provide explicit means to model meta-argumentation where the arguments in one module are about the arguments in another module; this leads to more realistic accounts of, say, legal argumentation processes. In the simplest multi-module situation, one module determines the context for anoth ...
Swoop - Semantic Scholar
... developed (e.g. pOWL - http://powl.sourceforge.net). However, we have found that using a standard web-based server-client architecture for ontology engineering suffers from being slow (esp. for large ontologies, and depending on network traffic), and cumbersome for maintaining consistency while edit ...
... developed (e.g. pOWL - http://powl.sourceforge.net). However, we have found that using a standard web-based server-client architecture for ontology engineering suffers from being slow (esp. for large ontologies, and depending on network traffic), and cumbersome for maintaining consistency while edit ...
CS2053
... Introduction, Knowledge Representation – Reasoning, Issues and Acquisition: Prepositional and Predicate Calculus Rule Based knowledge Representation Symbolic Reasoning Under Uncertainity Basic knowledge Representation Issues Knowledge acquisition – Heuristic Search: Techniques for Heuristic search H ...
... Introduction, Knowledge Representation – Reasoning, Issues and Acquisition: Prepositional and Predicate Calculus Rule Based knowledge Representation Symbolic Reasoning Under Uncertainity Basic knowledge Representation Issues Knowledge acquisition – Heuristic Search: Techniques for Heuristic search H ...
State-set branching: Leveraging BDDs for heuristic search
... The remainder of this article is organized as follows. We first describe related work in Section 2. We then define search problems in Section 3 and describe the general BFS algorithm in Section 4. In Section 5, we extend this algorithm to expand sets of states and study a number of example applicati ...
... The remainder of this article is organized as follows. We first describe related work in Section 2. We then define search problems in Section 3 and describe the general BFS algorithm in Section 4. In Section 5, we extend this algorithm to expand sets of states and study a number of example applicati ...
An Environment for Merging and Testing Large Ontologies
... Areas such as medicine began this task many years ago with SNOMED [Spackman, et. al., 1997] and UMLS [McCray and Nelson, 1995]. Recently broader and shallower efforts have emerged like the joint United Nations/Dunn and Bradstreet effort to create an open coding system for classifying goods and servi ...
... Areas such as medicine began this task many years ago with SNOMED [Spackman, et. al., 1997] and UMLS [McCray and Nelson, 1995]. Recently broader and shallower efforts have emerged like the joint United Nations/Dunn and Bradstreet effort to create an open coding system for classifying goods and servi ...
Computational Approaches to Preference Elicitation
... This is a survey of preference (or utility) elicitation from a computer scientist’s perspective. Preference elicitation is viewed as a process of extracting information about user preferences to the extent necessary to make good or even optimal decisions. Devising effective elicitation strategies wo ...
... This is a survey of preference (or utility) elicitation from a computer scientist’s perspective. Preference elicitation is viewed as a process of extracting information about user preferences to the extent necessary to make good or even optimal decisions. Devising effective elicitation strategies wo ...
Information Security Manual Approval Date: 7/23/14
... While this Manual is based on the foundation of the State of North Carolina Information Security Manual simply adopting these standards will not provide a comprehensive security program. College management should emphasize the importance of information security throughout their institution with appl ...
... While this Manual is based on the foundation of the State of North Carolina Information Security Manual simply adopting these standards will not provide a comprehensive security program. College management should emphasize the importance of information security throughout their institution with appl ...
Organisational Intelligence and Distributed AI
... knowledge in order to produce decisions that fit with the organisational aims and objectives. The information processing system does not necessarily involve information processing technology. c) In general, decision making involves more than one person. Thus, it depends upon the social system of an ...
... knowledge in order to produce decisions that fit with the organisational aims and objectives. The information processing system does not necessarily involve information processing technology. c) In general, decision making involves more than one person. Thus, it depends upon the social system of an ...
The DL-Lite Family - Dipartimento di Informatica e Sistemistica
... query evaluation is already exponential. Overall, our complexity results show that, despite the expressive power of the DLs of the DL-Lite family, the complexity of query answering in these logics is no worse than traditional query evaluation in relational databases. A notable consequence of the res ...
... query evaluation is already exponential. Overall, our complexity results show that, despite the expressive power of the DLs of the DL-Lite family, the complexity of query answering in these logics is no worse than traditional query evaluation in relational databases. A notable consequence of the res ...
Efficiently Gathering Information in Costly Domains
... and Krause [2009] and Krause and Guestrin [2005, 2007] suggest several models for selecting which variables to sample in a Bayesian network to minimize uncertainty in the network. Bilgic and Getoor [2007] use graphical models to minimize the cost of the acquisition of information for the purpose of ...
... and Krause [2009] and Krause and Guestrin [2005, 2007] suggest several models for selecting which variables to sample in a Bayesian network to minimize uncertainty in the network. Bilgic and Getoor [2007] use graphical models to minimize the cost of the acquisition of information for the purpose of ...
The Instance Store: DL Reasoning with Large Numbers of Individuals
... deal with very large ABoxes, and is able to provide sound and complete answers to instance retrieval queries (i.e., computing all the instances of a given query concept) over such ABoxes. ...
... deal with very large ABoxes, and is able to provide sound and complete answers to instance retrieval queries (i.e., computing all the instances of a given query concept) over such ABoxes. ...
The Third International Conference on Case
... on the morning of the second day of the conference. Two focused on business applications: “Integration of CBR in Business Processes” and “Practical CBR Strategies for Building and Maintaining Corporate Memories.” The other two workshops focused on theoretical issues: “Formalization of Adaptation in ...
... on the morning of the second day of the conference. Two focused on business applications: “Integration of CBR in Business Processes” and “Practical CBR Strategies for Building and Maintaining Corporate Memories.” The other two workshops focused on theoretical issues: “Formalization of Adaptation in ...
A Review on Expert System and its Applications in Civil Engineering
... extract the information of a human expert within a specific domain and makes this knowledge available to less experienced users through a computer coded program ...
... extract the information of a human expert within a specific domain and makes this knowledge available to less experienced users through a computer coded program ...
Logical Formal Description of Expert Systems
... 3) The knowledge base may be split into a number of parts, one for each level of hierarchy of each expert system, and each of them must have its own rules. The rules may be of different types, according to specific tasks. For instance: data admission, connection between another rules, rules of match ...
... 3) The knowledge base may be split into a number of parts, one for each level of hierarchy of each expert system, and each of them must have its own rules. The rules may be of different types, according to specific tasks. For instance: data admission, connection between another rules, rules of match ...
Artificial Intelligence and Expert Systems
... Decision Support Systems and Intelligent Systems, Efraim Turban and Jay E. Aronson 6th ed, Copyright 2001, Prentice Hall, Upper Saddle River, NJ ...
... Decision Support Systems and Intelligent Systems, Efraim Turban and Jay E. Aronson 6th ed, Copyright 2001, Prentice Hall, Upper Saddle River, NJ ...
Heuristics - UCLA Cognitive Systems Laboratory
... trial begins with an “agent” at the start state sinit . The agent takes a sequence of actions where each action is selected greedily based on the current state evaluation function. The trial ends when the agent reaches a goal state. The algorithms are called “real-time” because they perform a limite ...
... trial begins with an “agent” at the start state sinit . The agent takes a sequence of actions where each action is selected greedily based on the current state evaluation function. The trial ends when the agent reaches a goal state. The algorithms are called “real-time” because they perform a limite ...
Progression and Regression - Foundations of Artificial Intelligence
... is-target(s): Test whether a given search state is a target state. succ(s): Generates the successor states (a, s0 ) of search state s, along with the actions through which they are reached. → Search state 6= world state! E.g. regression, cf. later. ...
... is-target(s): Test whether a given search state is a target state. succ(s): Generates the successor states (a, s0 ) of search state s, along with the actions through which they are reached. → Search state 6= world state! E.g. regression, cf. later. ...
Part I: Heuristics
... trial begins with an “agent” at the start state sinit . The agent takes a sequence of actions where each action is selected greedily based on the current state evaluation function. The trial ends when the agent reaches a goal state. The algorithms are called “real-time” because they perform a limite ...
... trial begins with an “agent” at the start state sinit . The agent takes a sequence of actions where each action is selected greedily based on the current state evaluation function. The trial ends when the agent reaches a goal state. The algorithms are called “real-time” because they perform a limite ...