|
Fluent (artificial Intelligence)
In artificial intelligence, a fluent is a condition that can change over time. In logical approaches to reasoning about actions, fluents can be represented in first-order logic by Predicate (logic), predicates having an argument that depends on time. For example, the condition "the box is on the table", if it can change over time, cannot be represented by \mathrm(\mathrm,\mathrm); a third argument is necessary to the predicate \mathrm to specify the time: \mathrm(\mathrm,\mathrm,t) means that the box is on the table at time t. This representation of fluents is modified in the situation calculus by using the sequence of the past actions in place of the current time. A fluent can also be represented by a function, dropping the time argument. For example, that the box is on the table can be represented by on(box,table), where on is a function and not a predicate. In first-order logic, converting predicates to functions is called Reification (knowledge representation), reification; f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Artificial Intelligence
Artificial intelligence (AI) is the capability of computer, computational systems to perform tasks typically associated with human intelligence, such as learning, reasoning, problem-solving, perception, and decision-making. It is a field of research in computer science that develops and studies methods and software that enable machines to machine perception, perceive their environment and use machine learning, learning and intelligence to take actions that maximize their chances of achieving defined goals. High-profile applications of AI include advanced web search engines (e.g., Google Search); recommendation systems (used by YouTube, Amazon (company), Amazon, and Netflix); virtual assistants (e.g., Google Assistant, Siri, and Amazon Alexa, Alexa); autonomous vehicles (e.g., Waymo); Generative artificial intelligence, generative and Computational creativity, creative tools (e.g., ChatGPT and AI art); and Superintelligence, superhuman play and analysis in strategy games (e.g., ... [...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 study of deductively valid inferences or logical truths. It examines how conclusions follow from premises based on the structure of arguments alone, independent of their topic and content. Informal logic is associated with informal fallacies, critical thinking, and argumentation theory. Informal logic examines arguments expressed in natural language whereas formal logic uses formal language. When used as a countable noun, the term "a logic" refers to a specific logical formal system that articulates a proof system. Logic plays a central role in many fields, such as philosophy, mathematics, computer science, and linguistics. Logic studies arguments, which consist of a set of premises that leads to a conclusion. An example is the argument from the premises "it's Sunday" and "if it's Sunday then I don't have to work" leading to the conclusion "I don't have to wor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
First-order Logic
First-order logic, also called predicate logic, predicate calculus, or quantificational logic, 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. Rather than propositions such as "all humans are mortal", in first-order logic one can have expressions in the form "for all ''x'', if ''x'' is a human, then ''x'' is mortal", where "for all ''x"'' is a quantifier, ''x'' is a variable, and "... ''is a human''" and "... ''is mortal''" are predicates. 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, such as set theory, a theory for groups,A. Tarski, ''Undecidable Theories'' (1953), p. 77. Studies in Logic and the Foundation of Mathematics, North-Holland or a formal theory o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Predicate (logic)
In logic, a predicate is a symbol that represents a property or a relation. For instance, in the first-order formula P(a), the symbol P is a predicate that applies to the individual constant a. Similarly, in the formula R(a,b), the symbol R is a predicate that applies to the individual constants a and b. According to Gottlob Frege, the meaning of a predicate is exactly a function from the domain of objects to the truth values "true" and "false". In the semantics of logic, predicates are interpreted as relations. For instance, in a standard semantics for first-order logic, the formula R(a,b) would be true on an interpretation if the entities denoted by a and b stand in the relation denoted by R. Since predicates are non-logical symbols, they can denote different relations depending on the interpretation given to them. While first-order logic only includes predicates that apply to individual objects, other logics may allow predicates that apply to collections of objects defin ... [...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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reification (knowledge Representation)
Reification may refer to: Science and technology * Reification (computer science), the creation of a data model * Reification (knowledge representation), the representation of facts and/or assertions * Reification (statistics), the use of an idealized model to make inferences linking results from a model with experimental observations Other uses * Reification (fallacy), the fallacy of treating an abstraction as if it were a real thing * Reification (Gestalt psychology), the perception of an object as having more spatial information than is present * Reification (information retrieval), the transformation of a natural-language statement such that actions and events represented by it become quantifiable variables * Reification (Marxism), the consideration of an abstraction of an object as if it had living existence and abilities See also * Concretization * Objectification, the treatment of an entity (such as a human or animal) as an object {{disambiguation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Event Calculus
The event calculus is a logical theory for representing and reasoning about events and about the way in which they change the state of some real or artificial world. It deals both with action events, which are performed by agents, and with external events, which are outside the control of any agent. The event calculus represents the state of the world at any time by the set of all the facts (called '' fluents'') that hold at the time. Events initiate and terminate fluents: The event calculus differs from most other approaches for reasoning about change by reifying time, associating events with the time at which they happen, and associating fluents with the times at which they hold. The original version of the event calculus, introduced by Robert Kowalski and Marek Sergot in 1986, was formulated as a logic program and developed for representing narratives and database updates. Kave Eshghi showed how to use the event calculus for planning, by using abduction to generate hypot ... [...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] |
Features And Fluents Logic
Feature may refer to: Computing * Feature recognition, could be a hole, pocket, or notch * Feature (computer vision), could be an edge, corner or blob * Feature (machine learning), in statistics: individual measurable properties of the phenomena being observed * Software feature, a distinguishing characteristic of a software program Science and analysis * Feature data, in geographic information systems, comprise information about an entity with a geographic location * Features, in audio signal processing, an aim to capture specific aspects of audio signals in a numeric way * Feature (archaeology), any dug, built, or dumped evidence of human activity Media * Feature film, a film with a running time long enough to be considered the principal or sole film to fill a program ** Feature length, the standardized length of such films * Feature story, a piece of non-fiction writing about news * Radio documentary (feature), a radio program devoted to covering a particular topic in so ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Event Calculus
The event calculus is a logical theory for representing and reasoning about events and about the way in which they change the state of some real or artificial world. It deals both with action events, which are performed by agents, and with external events, which are outside the control of any agent. The event calculus represents the state of the world at any time by the set of all the facts (called '' fluents'') that hold at the time. Events initiate and terminate fluents: The event calculus differs from most other approaches for reasoning about change by reifying time, associating events with the time at which they happen, and associating fluents with the times at which they hold. The original version of the event calculus, introduced by Robert Kowalski and Marek Sergot in 1986, was formulated as a logic program and developed for representing narratives and database updates. Kave Eshghi showed how to use the event calculus for planning, by using abduction to generate hypot ... [...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] |
Frame Problem
In artificial intelligence, with implications for cognitive science, the frame problem describes an issue with using first-order logic to express facts about a robot in the world. Representing the state of a robot with traditional first-order logic 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 first-order logic 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 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
