|
AgentSpeak
AgentSpeak is an agent-oriented programming language. It is based on logic programming and the belief–desire–intention software model (BDI) architecture for ( cognitive) autonomous agents. The language was originally called AgentSpeak(L), but became more popular as AgentSpeak, a term that is also used to refer to the variants of the original language. History In 1996, Anand Rao created a logic-based agent programming language based on the BDI architecture and named it AgentSpeak(L). This became a highly cited paper in the multi-agent systems literature. In its original conception, AgentSpeak was an abstract agent programming language aimed to help the understanding of the relation between practical implementations of the BDI architecture such as procedural reasoning system (PRS) and the formalisation of the ideas behind the BDI architecture using modal logics. Various authors contributed to the further formalisation of the AgentSpeak(L) language, for example. In recent ye ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Belief–desire–intention Software Model
The belief–desire–intention software model (BDI) is a software model developed for programming intelligent agents. Superficially characterized by the implementation of an agent's ''beliefs'', ''desires'' and ''intentions'', it actually uses these concepts to solve a particular problem in agent programming. In essence, it provides a mechanism for separating the activity of selecting a plan (from a plan library or an external planner application) from the execution of currently active plans. Consequently, BDI agents are able to balance the time spent on deliberating about plans (choosing what to do) and executing those plans (doing it). A third activity, creating the plans in the first place (planning), is not within the scope of the model, and is left to the system designer and programmer. Overview In order to achieve this separation, the BDI software model implements the principal aspects of Michael Bratman's theory of human practical reasoning (also referred to as Belief-Des ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Agent-oriented Programming
Agent-oriented programming (AOP) is a programming paradigm where the construction of the software is centered on the concept of software agents. In contrast to object-oriented programming which has objects (providing methods with variable parameters) at its core, AOP has externally specified agents (with interfaces and messaging capabilities) at its core. They can be thought of as abstractions of objects. Exchanged messages are interpreted by receiving "agents", in a way specific to its class of agents. History Historically, the concept of agent-oriented programming and the idea of centering software around the concept of an Agent was introduced by Yoav Shoham within his Artificial Intelligence studies in 1990. His agents are specific to his own paradigm as they have just one method, with a single parameter. To quote Yoav Shoham from his paper in 1990 for a basic difference between AOP and OOP: :...agent-oriented programming (AOP), which can be viewed as a specialization of obje ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mark D'Inverno
Mark d'Inverno (born 29 August 1965) is a British computer scientist, currently a professor of Computer Science at Goldsmiths, University of London, in east London, England. Biography d'Inverno studied for an MA in Mathematics and an MSc in Computation at St Catherine's College, Oxford. He was awarded a PhD from University College London in artificial intelligence. For four years between 2007 and 2011, d'Inverno head of the Department of Computing, which has championed interdisciplinary research and teaching around computers and creativity for nearly a decade. He has published over 100 articles including books, journal and conference articles and has led recent research projects in a diverse range of fields relating to computer science including multi-agent systems, systems biology, art, design, and music. He is currently the principal investigator or co-investigator on a range of projects including designing systems for sharing online cultural experiences, connecting communit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Procedural Reasoning System
In artificial intelligence, a procedural reasoning system (PRS) is a framework for constructing real-time reasoning systems that can perform complex tasks in dynamic environments. It is based on the notion of a rational agent or intelligent agent using the belief–desire–intention software model. A user application is predominately defined, and provided to a PRS system is a set of ''knowledge areas''. Each knowledge area is a piece of procedural knowledge that specifies how to do something, e.g., how to navigate down a corridor, or how to plan a path (in contrast with robotic architectures where the programmer just provides a model of what the states of the world are and how the agent's primitive actions affect them). Such a program, together with a PRS interpreter, is used to control the agent. The interpreter is responsible for maintaining beliefs about the world state, choosing which goals to attempt to achieve next, and choosing which knowledge area to apply in the curr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Agent-oriented Programming
Agent-oriented programming (AOP) is a programming paradigm where the construction of the software is centered on the concept of software agents. In contrast to object-oriented programming which has objects (providing methods with variable parameters) at its core, AOP has externally specified agents (with interfaces and messaging capabilities) at its core. They can be thought of as abstractions of objects. Exchanged messages are interpreted by receiving "agents", in a way specific to its class of agents. History Historically, the concept of agent-oriented programming and the idea of centering software around the concept of an Agent was introduced by Yoav Shoham within his Artificial Intelligence studies in 1990. His agents are specific to his own paradigm as they have just one method, with a single parameter. To quote Yoav Shoham from his paper in 1990 for a basic difference between AOP and OOP: :...agent-oriented programming (AOP), which can be viewed as a specialization of obje ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Agent-based Programming Languages
An agent-based model (ABM) is a computational model for simulating the actions and interactions of autonomous agents (both individual or collective entities such as organizations or groups) in order to understand the behavior of a system and what governs its outcomes. It combines elements of game theory, complex systems, emergence, computational sociology, multi-agent systems, and evolutionary programming. Monte Carlo methods are used to understand the stochasticity of these models. Particularly within ecology, ABMs are also called individual-based models (IBMs). A review of recent literature on individual-based models, agent-based models, and multiagent systems shows that ABMs are used in many scientific domains including biology, ecology and social science. Agent-based modeling is related to, but distinct from, the concept of multi-agent systems or multi-agent simulation in that the goal of ABM is to search for explanatory insight into the collective behavior of agents obeying ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Multi-Agent Programming Contest
The Multi-Agent Programming Contest is an annual international programming competition with stated goal of stimulating research in the area of multi-agent system development and programming. History In 2005 Jürgen Dix (Clausthal University of Technology), Mehdi Dastani (University Utrecht) and Peter Novák (Czech Technical University in Prague) have brought the contest into being and running. The competition originally focused on Logic programming of Multi-agent systems. The goals, raised in 2005, have proven to be a solid basis for multi-agent system development and are still valid: #Identification of key problems #To collect suitable benchmarks. In 2007, a third goal has been added: # To gather test cases which require and enforce coordinated action. Although it is necessary to find a solution for the contest quest to win, the organizers pursue the intention that the solution is a system of cooperating autonomous programs that achieve the objectives together. They are also ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Formal Verification
In the context of hardware and software systems, formal verification is the act of proving or disproving the correctness of intended algorithms underlying a system with respect to a certain formal specification or property, using formal methods of mathematics. Formal verification can be helpful in proving the correctness of systems such as: cryptographic protocols, combinational circuits, digital circuits with internal memory, and software expressed as source code. The verification of these systems is done by providing a formal proof on an abstract mathematical model of the system, the correspondence between the mathematical model and the nature of the system being otherwise known by construction. Examples of mathematical objects often used to model systems are: finite-state machines, labelled transition systems, Petri nets, vector addition systems, timed automata, hybrid automata, process algebra, formal semantics of programming languages such as operational semantics, ... [...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] |
Michael Luck (computer Scientist)
Michael Luck is a professor of computer science based at the Department of Informatics, King's College London, in central London, England. His main research area is in Intelligent agent, intelligent agents and Multi-agent system, multi-agent systems. Education Luck was educated at University College London where he was awarded a PhD in 1993. Career and research From 1993 to 2000, Michael Luck was a lecturer based in the Department of Computer Science at the University of Warwick. From 2000 to 2006, Luck was a professor in the School of Electronics and Computer Science at the University of Southampton. While there, he led th''AgentLink'' European Co-ordination Action for Agent-Based Computing Luck moved to King's College London in 2007 and served as head of the Department of Informatics from 2011 to 2013. In 2013 he was appointed as Executive Dean of the Faculty of Natural and Mathematical Sciences, staying in that role until 2020. In that time he also led thUKRI Centre for D ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
