|
MetateM
Concurrent MetateM is a multi-agent language in which each agent is programmed using a set of (augmented) temporal logic specifications of the behaviour it should exhibit. These specifications are executed directly to generate the behaviour of the agent. As a result, there is no risk of invalidating the logic as with systems where logical specification must first be translated to a lower-level implementation. The root of the MetateM concept is Gabbay's separation theorem; any arbitrary temporal logic formula can be rewritten in a logically equivalent ''past → future'' form. Execution proceeds by a process of continually matching rules against a history, and ''firing'' those rules when antecedent An antecedent is a preceding event, condition, cause, phrase, or word. The etymology is from the Latin noun ''antecedentem'' meaning "something preceding", which comes from the preposition ''ante'' ("before") and the verb ''cedere'' ("to go"). ...s are satisfied. Any inst ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gabbay's Separation Theorem
In mathematical logic and computer science, Gabbay's separation theorem, named after Dov Gabbay, states that any arbitrary temporal logic formula can be rewritten in a logically equivalent 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 ... "past → future" form. I.e. the future becomes what must be satisfied. This form can be used as execution rules; a MetateM program is a set of such rules.. References Artificial intelligence Theorems Temporal logic {{Comp-sci-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Multi-agent System
A multi-agent system (MAS or "self-organized system") is a computerized system composed of multiple interacting intelligent agents.Hu, J.; Bhowmick, P.; Jang, I.; Arvin, F.; Lanzon, A.,A Decentralized Cluster Formation Containment Framework for Multirobot Systems IEEE Transactions on Robotics, 2021. Multi-agent systems can solve problems that are difficult or impossible for an individual agent or a monolithic system to solve.Hu, J.; Turgut, A.; Lennox, B.; Arvin, F.,Robust Formation Coordination of Robot Swarms with Nonlinear Dynamics and Unknown Disturbances: Design and Experiments IEEE Transactions on Circuits and Systems II: Express Briefs, 2021. Intelligence may include methodic, functional, procedural approaches, algorithmic search or reinforcement learning.Hu, J.; Bhowmick, P.; Lanzon, A.,Group Coordinated Control of Networked Mobile Robots with Applications to Object Transportation IEEE Transactions on Vehicular Technology, 2021. Despite considerable overlap, a mult ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Temporal Logic
In logic, temporal logic is any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time (for example, "I am ''always'' hungry", "I will ''eventually'' be hungry", or "I will be hungry ''until'' I eat something"). It is sometimes also used to refer to tense logic, a modal logic-based system of temporal logic introduced by Arthur Prior in the late 1950s, with important contributions by Hans Kamp. It has been further developed by computer scientists, notably Amir Pnueli, and logicians. Temporal logic has found an important application in formal verification, where it is used to state requirements of hardware or software systems. For instance, one may wish to say that ''whenever'' a request is made, access to a resource is ''eventually'' granted, but it is ''never'' granted to two requestors simultaneously. Such a statement can conveniently be expressed in a temporal logic. Motivation Consider the statement "I am hungry". Though i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logical Equivalence
In logic and mathematics, statements p and q are said to be logically equivalent if they have the same truth value in every model. The logical equivalence of p and q is sometimes expressed as p \equiv q, p :: q, \textsfpq, or p \iff q, depending on the notation being used. However, these symbols are also used for material equivalence, so proper interpretation would depend on the context. Logical equivalence is different from material equivalence, although the two concepts are intrinsically related. Logical equivalences In logic, many common logical equivalences exist and are often listed as laws or properties. The following tables illustrate some of these. General logical equivalences Logical equivalences involving conditional statements :#p \implies q \equiv \neg p \vee q :#p \implies q \equiv \neg q \implies \neg p :#p \vee q \equiv \neg p \implies q :#p \wedge q \equiv \neg (p \implies \neg q) :#\neg (p \implies q) \equiv p \wedge \neg q :#(p \implies q) \wedge (p \impl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Antecedent (logic)
An antecedent is the first half of a hypothetical proposition, whenever the if-clause precedes the then-clause. In some contexts the antecedent is called the ''protasis''. Examples: * If P, then Q. This is a nonlogical formulation of a hypothetical proposition. In this case, the antecedent is P, and the consequent is Q. In an implication, if \phi implies \psi then \phi is called the antecedent and \psi is called the consequent.Sets, Functions and Logic - An Introduction to Abstract Mathematics, Keith Devlin, Chapman & Hall/CRC Mathematics, 3rd ed., 2004 Antecedent and consequent are connected via logical connective to form a proposition. * If X is a man, then X is mortal. "X is a man" is the antecedent for this proposition. * If men have walked on the moon, then I am the king of France. Here, "men have walked on the moon" is the antecedent. Let y=x+1. If x=1 then y=2 See also * Consequent * Affirming the consequent (fallacy) * Denying the antecedent (fallacy) * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |