|
Proof Markup Language
The Provenance Markup Language (abbreviated PML; originally called Proof Markup Language) is an interlingua for representing and sharing knowledge about how information published on the Web was asserted from information sources and/or derived from Web information by intelligent agents. The language was initially developed in support of DARPA Agent Markup Language with a goal of explaining how automated theorem provers (ATP) derive conclusions from a set of axioms. Information, inference steps, inference rules, and agents are the three main building blocks of the language. In the context of an inference step, information can play the role of antecedent (also called premise) and conclusion. Information can also play the role of axiom that is basically a conclusion with no antecedents. PML uses the broad philosophical definition of agent as opposed to any other more specific definition of agent. The use of PML in subsequent projects evolved the language in new directions broadening i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Intelligent Agents
In artificial intelligence, an intelligent agent (IA) is anything which perceives its environment, takes actions autonomously in order to achieve goals, and may improve its performance with learning or may use knowledge. They may be simple or complex — a thermostat is considered an example of an intelligent agent, as is a human being, as is any system that meets the definition, such as a firm, a state, or a biome. Leading AI textbooks define "artificial intelligence" as the "study and design of intelligent agents", a definition that considers goal-directed behavior to be the essence of intelligence. Goal-directed agents are also described using a term borrowed from economics, "rational agent". An agent has an "objective function" that encapsulates all the IA's goals. Such an agent is designed to create and execute whatever plan will, upon completion, maximize the expected value of the objective function. For example, a reinforcement learning agent has a "reward function" th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Inference Rules
In the philosophy of logic, a rule of inference, inference rule or transformation rule is a logical form consisting of a function which takes premises, analyzes their syntax, and returns a conclusion (or conclusions). For example, the rule of inference called '' modus ponens'' takes two premises, one in the form "If p then q" and another in the form "p", and returns the conclusion "q". The rule is valid with respect to the semantics of classical logic (as well as the semantics of many other non-classical logics), in the sense that if the premises are true (under an interpretation), then so is the conclusion. Typically, a rule of inference preserves truth, a semantic property. In many-valued logic, it preserves a general designation. But a rule of inference's action is purely syntactic, and does not need to preserve any semantic property: any function from sets of formulae to formulae counts as a rule of inference. Usually only rules that are recursive are important; i.e. rules ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Provenance
Provenance (from the French ''provenir'', 'to come from/forth') is the chronology of the ownership, custody or location of a historical object. The term was originally mostly used in relation to works of art but is now used in similar senses in a wide range of fields, including archaeology, paleontology, archives, manuscripts, printed books, the circular economy, and science and computing. The primary purpose of tracing the provenance of an object or entity is normally to provide contextual and circumstantial evidence for its original production or discovery, by establishing, as far as practicable, its later history, especially the sequences of its formal ownership, custody and places of storage. The practice has a particular value in helping authenticate objects. Comparative techniques, expert opinions and the results of scientific tests may also be used to these ends, but establishing provenance is essentially a matter of documentation. The term dates to the 1780s in Englis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Richard Fikes
Richard Earl Fikes (born October 4, 1942) is a computer scientist and Professor (Research) Emeritus in the Computer Science department of Stanford University. He is professionally active as a consultant and expert witness. He led Stanford's Knowledge Systems Laboratory from 1991 to 2006, and has held appointments at Berkeley, Carnegie-Mellon, Price Waterhouse Technology Centre, Xerox PARC, and SRI International. Early life and education Fikes was born in Mobile, Alabama, and lived most of his early life in San Antonio, Texas. He graduated from Sam Houston High School (San Antonio, Texas) in 1960, received a B.A. degree in mathematics from the University of Texas at Austin in 1963, and received an M.A. degree in mathematics from the University of Texas at Austin in 1965. Fikes received his Ph.D. in Computer Science from Carnegie Mellon University in 1968. Career Fikes' research activities have primarily been in developing techniques for effectively representing and using kno ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Deborah McGuinness
Deborah Louise McGuinness (born ca. 1960) is an American computer scientist and researcher at Rensselaer Polytechnic Institute (RPI). She is a professor of Computer, Cognitive and Web Sciences, Industrial and Systems Engineering, and an endowed chair in the Tetherless World Constellation, a multidisciplinary research institution within RPI that focuses on the study of theories, methods and applications of the World Wide Web. Her fields of expertise include interdisciplinary data integration, artificial intelligence, specifically in knowledge representation and reasoning, description logics, the semantic web, explanation, and trust. Education McGuinness completed her Ph.D. in Computer Science from Rutgers University in 1997 with a thesis titled “Explaining Reasoning in Description Logics”. She received a master's degree in Computer Science from the University of California, Berkeley (1981) and a Bachelor of Science in computer science and Bachelor of Arts (BA) in mathemat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Paulo Pinheiro
Paulo Pinheiro is a Brazilian American computer scientist working in the areas of provenance and semantic web in support of sciences. Pinheiro has been a research scientist at the Rensselaer Polytechnic Institute's Tetherless World Constellation since 2013. Between 2011 and 2013, he was a staff scientist at the U.S. Department of Energy's Pacific Northwest National Laboratory. Between 2006 and 2012, he was an associate professor of computer science at the University of Texas at El Paso. Pinheiro is from a long line of scientists and engineers: his father is a retired professor of material sciences at the Universidade Federal de Minas Gerais; his paternal grandfather was the founding Mine Superintendent of Vale S.A., the second largest mining company in the world and Israel Pinheiro da Silva, a great-granduncle, was the chief engineer responsible for the construction of Brasilia, the capital of Brazil. Education Pinheiro received a licenciatura in mathematics and a maste ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Knowledge Systems Laboratory
Knowledge Systems Laboratory (KSL) was an artificial intelligence research laboratory within the Department of Computer Science at Stanford University until 2007, located in the Gates Computer Science Building, Stanford. Work focused on knowledge representation for shareable engineering knowledge bases and systems, computational environments for modelling physical devices, architectures for adaptive intelligent systems, and expert systems for science and engineering. KSL had projects with Stanford Medical Informatics (SMI), the Stanford Artificial Intelligence Lab (SAIL), the Stanford Formal Reasoning Group (SFRG), the Stanford Logic Group, and the Stanford Center for Design Research (CDR). Past members This is a partial list (in alphabetical order) of past members: * Edward Feigenbaum * Richard Fikes Richard Earl Fikes (born October 4, 1942) is a computer scientist and Professor (Research) Emeritus in the Computer Science department of Stanford University. He is profess ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stanford University
Stanford University, officially Leland Stanford Junior University, is a private research university in Stanford, California. The campus occupies , among the largest in the United States, and enrolls over 17,000 students. Stanford is considered among the most prestigious universities in the world. Stanford was founded in 1885 by Leland and Jane Stanford in memory of their only child, Leland Stanford Jr., who had died of typhoid fever at age 15 the previous year. Leland Stanford was a U.S. senator and former governor of California who made his fortune as a railroad tycoon. The school admitted its first students on October 1, 1891, as a coeducational and non-denominational institution. Stanford University struggled financially after the death of Leland Stanford in 1893 and again after much of the campus was damaged by the 1906 San Francisco earthquake. Following World War II, provost of Stanford Frederick Terman inspired and supported faculty and graduates' entrepreneu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Assertion (software Development)
In computer programming, specifically when using the imperative programming paradigm, an assertion is a predicate (a Boolean-valued function over the state space, usually expressed as a logical proposition using the variables of a program) connected to a point in the program, that always should evaluate to true at that point in code execution. Assertions can help a programmer read the code, help a compiler compile it, or help the program detect its own defects. For the latter, some programs check assertions by actually evaluating the predicate as they run. Then, if it is not in fact true – an assertion failure – the program considers itself to be broken and typically deliberately crashes or throws an assertion failure exception. Details The following code contains two assertions, x > 0 and x > 1, and they are indeed true at the indicated points during execution: x = 1; assert x > 0; x++; assert x > 1; Programmers can use assertions to help specify programs and to re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
English Language
English is a West Germanic language of the Indo-European language family, with its earliest forms spoken by the inhabitants of early medieval England. It is named after the Angles, one of the ancient Germanic peoples that migrated to the island of Great Britain. Existing on a dialect continuum with Scots, and then closest related to the Low Saxon and Frisian languages, English is genealogically West Germanic. However, its vocabulary is also distinctively influenced by dialects of France (about 29% of Modern English words) and Latin (also about 29%), plus some grammar and a small amount of core vocabulary influenced by Old Norse (a North Germanic language). Speakers of English are called Anglophones. The earliest forms of English, collectively known as Old English, evolved from a group of West Germanic (Ingvaeonic) dialects brought to Great Britain by Anglo-Saxon settlers in the 5th century and further mutated by Norse-speaking Viking settlers starting in the 8 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
DARPA Agent Markup Language
The DARPA Agent Markup Language (DAML) was the name of a US funding program at the US Defense Advanced Research Projects Agency (DARPA) started in 1999 by then-Program Manager James Hendler, and later run by Murray Burke, Mark Greaves and Michael Pagels. The program focused on the creation of machine-readable representations for the Web. One of the Investigators working on the program was Tim Berners-Lee. Working with the program managers and other participants, Tim helped shape the effort to create technologies and demonstrations for what is now called the Semantic Web, leading in turn to the growth of knowledge graph technology. A primary outcome of the DAML program was the DAML language, an agent markup language based on RDF. This language was followed by an extension entitled DAML+OIL which included researchers outside of the DARPA program in the design. The 2002 submission of the DAML+OIL language to the World Wide Web Consortium (W3C) captures the work done by DAML con ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Knowledge Interchange Format
Knowledge Interchange Format (KIF) is a computer language designed to enable systems to share and re-use information from knowledge-based systems. KIF is similar to frame languages such as KL-One and LOOM but unlike such language its primary role is not intended as a framework for the expression or use of knowledge but rather for the interchange of knowledge between systems. The designers of KIF likened it to PostScript. PostScript was not designed primarily as a language to store and manipulate documents but rather as an interchange format for systems and devices to share documents. In the same way KIF is meant to facilitate sharing of knowledge across different systems that use different languages, formalisms, platforms, etc. KIF has a declarative semantics. It is meant to describe facts about the world rather than processes or procedures. Knowledge can be described as objects, functions, relations, and rules. It is a formal language, i.e., it can express arbitrary statements in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
