|
SubL
Cyc (pronounced ) is a long-term artificial intelligence project that aims to assemble a comprehensive ontology and knowledge base that spans the basic concepts and rules about how the world works. Hoping to capture common sense knowledge, Cyc focuses on implicit knowledge that other AI platforms may take for granted. This is contrasted with facts one might find somewhere on the internet or retrieve via a search engine or Wikipedia. Cyc enables semantic reasoners to perform human-like reasoning and be less "brittle" when confronted with novel situations. Douglas Lenat began the project in July 1984 at MCC, where he was Principal Scientist 1984–1994, and then, since January 1995, has been under active development by the Cycorp company, where he is the CEO. Overview The need for a massive symbolic artificial intelligence project of this kind was born in the early 1980s. Early AI researchers had ample experience over the previous 25 years with AI programs that would generate enc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
SubL
Cyc (pronounced ) is a long-term artificial intelligence project that aims to assemble a comprehensive ontology and knowledge base that spans the basic concepts and rules about how the world works. Hoping to capture common sense knowledge, Cyc focuses on implicit knowledge that other AI platforms may take for granted. This is contrasted with facts one might find somewhere on the internet or retrieve via a search engine or Wikipedia. Cyc enables semantic reasoners to perform human-like reasoning and be less "brittle" when confronted with novel situations. Douglas Lenat began the project in July 1984 at MCC, where he was Principal Scientist 1984–1994, and then, since January 1995, has been under active development by the Cycorp company, where he is the CEO. Overview The need for a massive symbolic artificial intelligence project of this kind was born in the early 1980s. Early AI researchers had ample experience over the previous 25 years with AI programs that would generate enc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Douglas Lenat
Douglas Bruce Lenat (born 1950) is the CEO of Cycorp, Inc. of Austin, Texas, and has been a prominent researcher in artificial intelligence; he was awarded the biannual IJCAI Computers and Thought Award in 1976 for creating the machine learning program, AM. He has worked on (symbolic, not statistical) machine learning (with his AM and Eurisko programs), knowledge representation, "cognitive economy", blackboard systems, and what he dubbed in 1984 " ontological engineering" (with his Cyc program at MCC and, since 1994, at Cycorp). He has also worked in military simulations, and numerous projects for US government, military, intelligence, and scientific organizations. In 1980, he published a critique of conventional random-mutation Darwinism. He authored a series of articles in the Journal of Artificial Intelligence exploring the nature of heuristic rules. Lenat was one of the original Fellows of the AAAI, and is the only individual to have served on the Scientific Advisory ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Allen Newell
Allen Newell (March 19, 1927 – July 19, 1992) was a researcher in computer science and cognitive psychology at the RAND Corporation and at Carnegie Mellon University’s School of Computer Science, Tepper School of Business, and Department of Psychology. He contributed to the Information Processing Language (1956) and two of the earliest AI programs, the Logic Theory Machine (1956) and the General Problem Solver (1957) (with Herbert A. Simon). He was awarded the ACM's A.M. Turing Award along with Herbert A. Simon in 1975 for their basic contributions to artificial intelligence and the psychology of human cognition. Early studies Newell completed his Bachelor's degree in physics from Stanford in 1949. He was a graduate student at Princeton University from 1949–1950, where he did mathematics. Due to his early exposure to an unknown field known as game theory and the experiences from the study of mathematics, he was convinced that he would prefer a combination of exper ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Higher-order Logic
mathematics and logic, a higher-order logic is a form of predicate logic that is distinguished from first-order logic by additional quantifiers and, sometimes, stronger semantics. Higher-order logics with their standard semantics are more expressive, but their model-theoretic properties are less well-behaved than those of first-order logic. The term "higher-order logic", abbreviated as HOL, is commonly used to mean higher-order simple predicate logic. Here "simple" indicates that the underlying type theory is the ''theory of simple types'', also called the ''simple theory of types'' (see Type theory). Leon Chwistek and Frank P. Ramsey proposed this as a simplification of the complicated and clumsy ''ramified theory of types'' specified in the ''Principia Mathematica'' by Alfred North Whitehead and Bertrand Russell. ''Simple types'' is nowadays sometimes also meant to exclude polymorphic and dependent types. Quantification scope First-order logic quantifies only variables th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Circumscription (logic)
Circumscription is a non-monotonic logic created by John McCarthy to formalize the common sense assumption that things are as expected unless otherwise specified. Circumscription was later used by McCarthy in an attempt to solve the frame problem. To implement circumscription in its initial formulation, McCarthy augmented first-order logic to allow the minimization of the extension of some predicates, where the extension of a predicate is the set of tuples of values the predicate is true on. This minimization is similar to the closed-world assumption that what is not known to be true is false. The original problem considered by McCarthy was that of missionaries and cannibals: there are three missionaries and three cannibals on one bank of a river; they have to cross the river using a boat that can only take two, with the additional constraint that cannibals must never outnumber the missionaries on either bank (as otherwise the missionaries would be killed and, presumably, eaten) ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Non-monotonic Logic
A non-monotonic logic is a formal logic whose conclusion relation is not monotonic. In other words, non-monotonic logics are devised to capture and represent defeasible inferences (cf. defeasible reasoning), i.e., a kind of inference in which reasoners draw tentative conclusions, enabling reasoners to retract their conclusion(s) based on further evidence. Most studied formal logics have a monotonic entailment relation, meaning that adding a formula to a theory never produces a pruning of its set of conclusions. Intuitively, monotonicity indicates that learning a new piece of knowledge cannot reduce the set of what is known. A monotonic logic cannot handle various reasoning tasks such as reasoning by default (conclusions may be derived only because of lack of evidence of the contrary), abductive reasoning (conclusions are only deduced as most likely explanations), some important approaches to reasoning about knowledge (the ignorance of a conclusion must be retracted when the concl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Modal Logic
Modal logic is a collection of formal systems developed to represent statements about necessity and possibility. It plays a major role in philosophy of language, epistemology, metaphysics, and natural language semantics. Modal logics extend other systems by adding unary operators \Diamond and \Box, representing possibility and necessity respectively. For instance the modal formula \Diamond P can be read as "possibly P" while \Box P can be read as "necessarily P". Modal logics can be used to represent different phenomena depending on what kind of necessity and possibility is under consideration. When \Box is used to represent epistemic necessity, \Box P states that P is epistemically necessary, or in other words that it is known. When \Box is used to represent deontic necessity, \Box P states that P is a moral or legal obligation. In the standard relational semantics for modal logic, formulas are assigned truth values relative to a ''possible world''. A formula's truth value at ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Second-order Logic
In logic and mathematics, second-order logic is an extension of first-order logic, which itself is an extension of propositional logic. Second-order logic is in turn extended by higher-order logic and type theory. First-order logic quantifies only variables that range over individuals (elements of the domain of discourse); second-order logic, in addition, also quantifies over relations. For example, the second-order sentence \forall P\,\forall x (Px \lor \neg Px) says that for every formula ''P'', and every individual ''x'', either ''Px'' is true or not(''Px'') is true (this is the law of excluded middle). Second-order logic also includes quantification over sets, functions, and other variables (see section below). Both first-order and second-order logic use the idea of a domain of discourse (often called simply the "domain" or the "universe"). The domain is a set over which individual elements may be quantified. Examples First-order logic can quantify over individuals, bu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
First-order Logic
First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over non-logical objects, and allows the use of sentences that contain variables, so that rather than propositions such as "Socrates is a man", one can have expressions in the form "there exists x such that x is Socrates and x is a man", where "there exists''"'' is a quantifier, while ''x'' is a variable. This distinguishes it from propositional logic, which does not use quantifiers or relations; in this sense, propositional logic is the foundation of first-order logic. A theory about a topic is usually a first-order logic together with a specified domain of discourse (over which the quantified variables range), finitely many functions from that domain to itself, finitely many predicates defined on that domain, and a set of ax ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Russell Greiner
Russell Greiner is a Professor of Computing Science at the University of Alberta. He is a Fellow of the AAAI (Association for the Advancement of Artificial Intelligence) and well known for his work in Machine Learning and Bioinformatics. Professor Greiner is one of the principal investigators at the Alberta Innovates Centre for Machine Learning (AICML) and has published over 200 refereed papers and patents. He has served as the chair of International Conference on Machine Learning, Intelligent Systems for Molecular Biology and Uncertainty in Artificial Intelligence. He is the Editor-in-Chief for Computational Intelligence (journal), and serves as a member of editorial board for Journal of Machine Learning Research, Machine Learning (journal) and Journal of Artificial Intelligence Research The ''Journal of Artificial Intelligence Research'' (''JAIR'') is an open access peer-reviewed scientific journal covering research in all areas of artificial intelligence. History It was esta ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bobby Ray Inman
Bobby Ray Inman (born April 4, 1931) is a retired United States Navy admiral who held several influential positions in the United States Intelligence Community. Early years Inman was born and raised in the community of Rhonesboro, Upshur County, Texas, in the eastern portion of the state. His father was the owner and operator of a gas station. Inman attended and graduated from Mineola High School. Inman recalled in 1986 that he was 5' 4" tall and weighed upon graduation, and he tutored athletes he admired during high school to keep from being bullied. Inman graduated from Mineola High School in Mineola, Texas at the age of 15, in 1946. He rode a bus from Mineola to Tyler Junior College, where he was a member of Phi Theta Kappa National Honor Society. He graduated from the University of Texas with a degree in history at the age of 19. According to Budiansky, after joining the Naval Reserve during the Korean War, Inman then "rocketed up through the ranks of naval intelligence" ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
SEMATECH
SEMATECH (from Semiconductor Manufacturing Technology) is a not-for-profit consortium that performs research and development to advance chip manufacturing. SEMATECH has broad engagement with various sectors of the R&D community, including chipmakers, equipment and material suppliers, universities, research institutes, and government partners. The group is funded by member dues. History SEMATECH was conceived in 1986, formed in 1987, and began operating in Austin, Texas in 1988 as a partnership between the United States government and 14 U.S.-based semiconductor manufacturers to solve common manufacturing problems and regain competitiveness for the U.S. semiconductor industry that had been surpassed by Japanese industry in the mid-1980s. SEMATECH was funded over five years by public subsidies coming from the U.S. Department of Defense via the Defense Advanced Research Projects Agency (DARPA) for a total of $500 million. Following a determination by SEMATECH Board of Directors to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
