|
Yale Shooting Problem
The Yale shooting problem is a conundrum or scenario in formal situational logic on which early logical solutions to the frame problem fail. The name of this problem derives from its inventors, Steve Hanks and Drew McDermott, working at Yale University when they proposed it. In this scenario, Fred (later identified as a turkey (bird), turkey) is initially alive and a gun is initially unloaded. Loading the gun, waiting for a moment, and then shooting the gun at Fred is expected to kill Fred. However, if inertia is formalized in logic by minimizing the changes in this situation, then it cannot be uniquely proved that Fred is dead after loading, waiting, and shooting. In one solution, Fred indeed dies; in another (also logically correct) solution, the gun becomes mysteriously unloaded and Fred survives. Technically, this scenario is described by two fluent (artificial intelligence), fluents (a fluent is a condition that can change truth value over time): alive and loaded. Initially, t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logic
Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the science of deductively valid inferences or of logical truths. It is a formal science investigating how conclusions follow from premises in a topic-neutral way. When used as a countable noun, the term "a logic" refers to a logical formal system that articulates a proof system. Formal logic contrasts with informal logic, which is associated with informal fallacies, critical thinking, and argumentation theory. While there is no general agreement on how formal and informal logic are to be distinguished, one prominent approach associates their difference with whether the studied arguments are expressed in formal or informal languages. Logic plays a central role in multiple fields, such as philosophy, mathematics, computer science, and linguistics. Logic studies arguments, which consist of a set of premises together with a conclusion. Premises and conclusions are usually un ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Erik Sandewall
Erik Sandewall is a Swedish Professor in the Chair of Computer Science at Linköping University since 1975. He is known for his pioneering research in artificial intelligence. Education Erik Sandewall received the B.A. and Ph.D. degrees from Uppsala University in 1964 and 1969 respectively. Notable Honors and Awards * AAAI Fellow * ECCAI Fellow * Member of the Royal Swedish Academy of Engineering Sciences (1981) * Member of the Swedish Academy of Sciences (1992) * Doctor honoris causa Paul Sabatier University, France * Chevalier of the Legion of Honor, France * Fellow of the German Research Centre for Artificial Intelligence * Associate Member of the Hassan II Academy of Science and Technology, Morocco * Immortalized as statue outside of the Department of Computer and Information Science, Linköping University See also * Frame problem * Yale shooting problem The Yale shooting problem is a conundrum or scenario in formal situational logic on which ear ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logic Programming
Logic programming is a programming paradigm which is largely based on formal logic. Any program written in a logic programming language is a set of sentences in logical form, expressing facts and rules about some problem domain. Major logic programming language families include Prolog, answer set programming (ASP) and Datalog. In all of these languages, rules are written in the form of ''clauses'': :H :- B1, …, Bn. and are read declaratively as logical implications: :H if B1 and … and Bn. H is called the ''head'' of the rule and B1, ..., Bn is called the ''body''. Facts are rules that have no body, and are written in the simplified form: :H. In the simplest case in which H, B1, ..., Bn are all atomic formulae, these clauses are called definite clauses or Horn clauses. However, there are many extensions of this simple case, the most important one being the case in which conditions in the body of a clause can also be negations of atomic formulas. Logic programming languag ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Situation Calculus
The situation calculus is a logic formalism designed for representing and reasoning about dynamical domains. It was first introduced by John McCarthy in 1963. The main version of the situational calculus that is presented in this article is based on that introduced by Ray Reiter in 1991. It is followed by sections about McCarthy's 1986 version and a logic programming formulation. Overview The situation calculus represents changing scenarios as a set of first-order logic formulae. The basic elements of the calculus are: *The actions that can be performed in the world *The fluents that describe the state of the world *The situations A domain is formalized by a number of formulae, namely: *Action precondition axioms, one for each action *Successor state axioms, one for each fluent *Axioms describing the world in various situations *The foundational axioms of the situation calculus A simple robot world will be modeled as a running example. In this world there is a single robot a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Frame Problem
In artificial intelligence, the frame problem describes an issue with using first-order logic (FOL) to express facts about a robot in the world. Representing the state of a robot with traditional FOL requires the use of many axioms that simply imply that things in the environment do not change arbitrarily. For example, Hayes describes a "block world" with rules about stacking blocks together. In a FOL system, additional axioms are required to make inferences about the environment (for example, that a block cannot change position unless it is physically moved). The frame problem is the problem of finding adequate collections of axioms for a viable description of a robot environment. John McCarthy (computer scientist), John McCarthy and Patrick J. Hayes defined this problem in their 1969 article, ''Some Philosophical Problems from the Standpoint of Artificial Intelligence''. In this paper, and many that came after, the formal mathematical problem was a starting point for more general ... [...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] |
AAAI Classic Paper Award
The Association for the Advancement of Artificial Intelligence (AAAI) is an international scientific society devoted to promote research in, and responsible use of, artificial intelligence. AAAI also aims to increase public understanding of artificial intelligence (AI), improve the teaching and training of AI practitioners, and provide guidance for research planners and funders concerning the importance and potential of current AI developments and future directions. History The organization was founded in 1979 under the name "American Association for Artificial Intelligence" and changed its name in 2007 to "Association for the Advancement of Artificial Intelligence". It has in excess of 4,000 members worldwide. In its early history, the organization was presided over by notable figures in computer science such as Allen Newell, Edward Feigenbaum, Marvin Minsky and John McCarthy. The current president is Yolanda Gil, and the president elect is Bart Selman. Conferences and pu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Action Description Language
In artificial intelligence, action description language (ADL) is an automated planning and scheduling system in particular for robots. It is considered an advancement of STRIPS. Edwin Pednault (a specialist in the field of data abstraction and modelling who has been an IBM Research Staff Member in the Data Abstraction Research Group since 1996) proposed this language in 1987. It is an example of an action language. Origins Pednault observed that the expressive power of STRIPS was susceptible to being improved by allowing the effects of an operator to be conditional. This is the main idea of ADL-A, which is basically the propositional fragment of the ADL proposed by Pednault, with ADL-B an extension of -A. In the -B extension, actions can be described with indirect effects by the introduction of a new kind of propositions: ”static laws". A third variation of ADL is ADL-C which is similar to -B, in the sense that its propositions can be classified into static and dynamic laws, but ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fluent Calculus
The fluent calculus is a formalism for expressing dynamical domains in first-order logic. It is a variant of the situation calculus; the main difference is that situations are considered representations of states. A binary function symbol \circ is used to concatenate the terms that represent facts that hold in a situation. For example, that the box is on the table in the situation s is represented by the formula \exists t . s = on(box,table) \circ t. The frame problem is solved by asserting that the situation after the execution of an action is identical to the one before but for the conditions changed by the action. For example, the action of moving the box from the table to the floor is formalized as: : State(Do(move(box,table,floor), s)) \circ on(box,table) = State(s) \circ on(box,floor) This formula states that the state after the move is added the term on(box,floor) and removed the term on(box,table). Axioms specifying that \circ is commutative and non-idempotent are necessary ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ray Reiter
Raymond Reiter (; June 12, 1939 – September 16, 2002) was a Canadian computer scientist and logician. He was one of the founders of the field of non-monotonic reasoning with his work on default logic, model-based diagnosis, closed world reasoning, and truth maintenance systems. He also contributed to the situation calculus. Awards and honors He was a Fellow of the Association for Computing Machinery (ACM), an AAAI Fellow, and a Fellow of the Royal Society of Canada. He won the IJCAI Award for Research Excellence in 1993. Publications * R. Reiter (1978). On closed world data bases. In H. Gallaire and J. Minker, editors, ''Logic and Data Bases'', pages 119–140. Plenum., New York. * R. Reiter (1980). A logic for default reasoning. ''Artificial Intelligence'', 13:81-132. * R. Reiter (1987). A theory of diagnosis from first principles. ''Artificial Intelligence'', 32:57-95. * R. Reiter (1991). The frame problem in the situation calculus: a simple solution (sometimes) and a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Predicate Completion
Predicate or predication may refer to: * Predicate (grammar), in linguistics * Predication (philosophy) * several closely related uses in mathematics and formal logic: ** Predicate (mathematical logic) ** Propositional function ** Finitary relation, or n-ary predicate ** Boolean-valued function ** Syntactic predicate, in formal grammars and parsers ** Functional predicate * Predication (computer architecture) *in United States law, the basis or foundation of something ** Predicate crime **Predicate rules, in the U.S. Title 21 CFR Part 11 * Predicate, a term used in some European context for either nobles' honorifics or for nobiliary particle A nobiliary particle is used in a surname or family name in many Western cultures to signal the nobility of a family. The particle used varies depending on the country, language and period of time. In some languages, it is the same as a regular p ...s See also * Predicate logic {{disambiguation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Frame Problem
In artificial intelligence, the frame problem describes an issue with using first-order logic (FOL) to express facts about a robot in the world. Representing the state of a robot with traditional FOL requires the use of many axioms that simply imply that things in the environment do not change arbitrarily. For example, Hayes describes a "block world" with rules about stacking blocks together. In a FOL system, additional axioms are required to make inferences about the environment (for example, that a block cannot change position unless it is physically moved). The frame problem is the problem of finding adequate collections of axioms for a viable description of a robot environment. John McCarthy (computer scientist), John McCarthy and Patrick J. Hayes defined this problem in their 1969 article, ''Some Philosophical Problems from the Standpoint of Artificial Intelligence''. In this paper, and many that came after, the formal mathematical problem was a starting point for more general ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
