The Experts below are selected from a list of 116796 Experts worldwide ranked by ideXlab platform
Giuseppe Longo - One of the best experts on this subject based on the ideXlab platform.
-
economic opportunity and evolution beyond landscapes and bounded rationality
Strategic Entrepreneurship Journal, 2014Co-Authors: Teppo Felin, Stuart A Kauffman, Roger Koppl, Giuseppe LongoAbstract:The nature of economic opportunity has recently received significant attention in entrepreneurship, organization science and strategy. The notion of boundedly rational search on an (NK) opportunity landscape has been particularly relevant to these conversations and debates. We argue that the focus on bounded rationality and search is highly Problematic for the fields of entrepreneurship and strategy and does not allow us to explain the origins of economic novelty. We contrast the NP Problem with the Frame Problem to illustrate our point, and highlight the role of adjacent possibilities and novel affordances. We discuss the entrepreneurial and economic implications of these arguments by building on unique insights from biology, the natural and computational sciences. Copyright © 2014 Strategic Management Society.
-
Economic Opportunity and Evolution: Beyond Landscapes and Bounded Rationality
Strategic Entrepreneurship Journal, 2014Co-Authors: Teppo Felin, Roger Koppl, Stuart Kauffman, Giuseppe LongoAbstract:The nature of economic opportunity has recently received significant attention in entrepreneurship and strategy. The notion of search on an (NK) opportunity landscape has been particularly relevant to these conversations and debates. We argue that existing notions of landscapes are overly focused on bounded rationality and search (often instantiated as the Problem of NP-completeness), rather than focusing on how to account for the readily manifest, emergent novelty we see in the economic sphere (the “Frame Problem”). We discuss the entrepreneurial and economic implications of these arguments by building on unique insights from biology, the natural and computational sciences.
Murray Shanahan - One of the best experts on this subject based on the ideXlab platform.
-
applying global workspace theory to the Frame Problem
Cognition, 2005Co-Authors: Murray Shanahan, Bernard J BaarsAbstract:The subject of this article is the Frame Problem, as conceived by certain cognitive scientists and philosophers of mind, notably Fodor for whom it stands as a fundamental obstacle to progress in cognitive science. The challenge is to explain the capacity of so-called informationally unencapsulated cognitive processes to deal effectively with information from potentially any cognitive domain without the burden of having to explicitly sift the relevant from the irrelevant. The paper advocates a global workspace architecture, with its ability to manage massively parallel resources in the context of a serial thread of computation, as an answer to this challenge. Analogical reasoning is given particular attention, since it exemplifies informational unencapsulation in its most extreme form. Because global workspace theory also purports to account for the distinction between conscious and unconscious information processing, the paper advances the tentative conclusion that consciousness may go hand-in-hand with a solution to the Frame Problem in the biological brain.
-
the ramification Problem in the event calculus
International Joint Conference on Artificial Intelligence, 1999Co-Authors: Murray ShanahanAbstract:Finding a solution to the Frame Problem that is robust in the presence of actions with indirect effects has proven to be a difficult task. Examples that feature the instantaneous propagation of interacting indirect effects are particularly taxing. This article shows that an already widely known predicate calculus formalism, namely the event calculus, can handle such examples with only minor enhancements.
-
the event calculus explained
Lecture Notes in Computer Science, 1999Co-Authors: Murray ShanahanAbstract:This article presents the event calculus, a logic-based formalism for representing actions and their effects. A circumscriptive solution to the Frame Problem is deployed which reduces to monotonic predicate completion. Using a number of benchmark examples from the literature, the formalism is shown to apply to a variety of domains, including those featuring actions with indirect effects, actions with nondeterministic effects, concurrent actions, and continuous change.
-
solving the Frame Problem a mathematical investigation of the common sense law of inertia
1997Co-Authors: Murray ShanahanAbstract:Why is the Frame Problem? describing the non-effects of actions introducing the situation calculus Frame axioms towards a solution making Frame axioms more compact criteria for a solution to the Frame Problem elaboration tolerance non-monotonic solutions the common sense law of inertia monotonic versus non-monotonic solutions explanations, qualifications and narrative philosophical reflections. Logical foundations: the language of predicate calculus the semantics of predicate calculus many-sorted predicate calculus second-order predicate calculus the ontology and language os situation calculus situation calculus formulae situations and the result function the limitations of the situation calculus default reasoning circumscription more complicated circumscription policies. Towards a non-monotonic solution: formalising the common sense law of inertia an example that works the Hanks-McDermott Problem variations on Hanks and McDermott theme differences in situation calculus style the importance of the Hanks-Mcdermott Problem. Chronological minisation: the Yale shooting scenario in Default Logic generating extensions in Default Logic the directionality of time formalising chronological minimisation the Yale shooting scenario the stolen car scenario improving chronological minimisation. Casual minimisation: eliminating spontaneous change the Yale shooting scenarios the principles of separation and directionality actions with context-dependent effects causal minimisation and explanation ramifications and casual minimisation. Introducing state-based minimisation: varying the result adding an existence-of-situations axiom the need for domain closure axioms a universal existence-of situation axiom. Generalising state-based minimisation: logical prerequisites first-order formalisations applying state-based minimisation state-based minimisation and explanation a second-order existence-of-situation axiom general theorems about state-based minimisation. Tailor-made techniques: explanation closure axioms ramifications and explanation closure automatically derived Frame axioms successor state axioms the language A. Narratives in the situation calculus: the need for narratives arboreality and existence-of-situations associating a time with each actual situation two theorems of circumscription two separation theorems for narratives associating a situation with each time point comparing the approaches. (Part contents).
Michael Thielscher - One of the best experts on this subject based on the ideXlab platform.
-
solving the inferential Frame Problem in the general game description language
National Conference on Artificial Intelligence, 2014Co-Authors: Javier Romero, Abdallah Saffidine, Michael ThielscherAbstract:The Game Description Language GDL is the standard input language for general game-playing systems. While players can gain a lot of traction by an efficient inference algorithm for GDL, state-of-the-art reasoners suffer from a variant of a classical KR Problem, the inferential Frame Problem. We present a method by which general game players can transform any given game description into a representation that solves this Problem. Our experimental results demonstrate that with the help of automatically generated domain knowledge, a significant speedup can thus be obtained for the majority of the game descriptions from the AAAI competition.
-
Artificial Intelligence 111(1–2): 277–299 (1999). From Situation Calculus to Fluent Calculus: State Update Axioms as a Solution to the Inferential Frame Problem
2008Co-Authors: Michael ThielscherAbstract:Abstract. Successor state axioms provide a solution to the famous Frame Problem as far as the representational aspect is concerned. Solving in classical, monotonic logic the additional inferential Frame Problem, on the other hand, was the major motivation for the development of the Fluent Calculus a decade or so ago. Yet the expressiveness of the latter in comparison to the Situation Calculus remained a largely open question until today. In this note, we derive a novel version of the Fluent Calculus by gradually applying the principle of reification to successor state axioms in order to address the inferential Frame Problem without losing the representational merits. Our approach results in a fully mechanic method for the generation of state update axioms from any collection of Situation Calculus-style effect axioms for deterministic actions, provided the actions do not have potentially infinitely many effects. The axiomatization thus obtained is proved essentially equivalent to the corresponding axiomatization which uses successor state axioms. Keywords. Cognitive Robotics, Frame Problem.
-
handling implication and universal quantification constraints in flux
Principles and Practice of Constraint Programming, 2005Co-Authors: Michael ThielscherAbstract:FLUX is a CLP-approach for programming agents that reason about actions under incomplete state knowledge. FLUX is based on the solution to the fundamental Frame Problem in the fluent calculus. The core is a set of Constraint Handling Rules for the constraints that are used to encode state knowledge. In order to allow for efficient constraint solving, the original expressiveness of state representations in FLUX has been carefully restricted. In this paper, we enhance the expressiveness by adding both implication and universal quantification constraints. We do so without losing the computational merits of FLUX. We present a set of Constraint Handling Rules for these new constraints and prove their correctness against the fluent calculus.
-
from situation calculus to fluent calculus state update axioms as a solution to the inferential Frame Problem
Artificial Intelligence, 1999Co-Authors: Michael ThielscherAbstract:Successor state axioms provide a solution to the famous Frame Problem as far as the representational aspect is concerned. Solving in classical, monotonic logic the additional inferential Frame Problem, on the other hand, was the major motivation for the development of the Fluent Calculus a decade or so ago. Yet the expressiveness of the latter in comparison to the Situation Calculus remained a largely open question until today. In this note, we derive a novel version of the Fluent Calculus by gradually applying the principle of reification to successor state axioms in order to address the inferential Frame Problem without losing the representational merits. Our approach results in a fully mechanic method for the generation of state update axioms from any collection of Situation Calculus-style effect axioms for deterministic actions, provided the actions do not have potentially infinitely many effects. The axiomatization thus obtained is proved essentially equivalent to the corresponding axiomatization which uses successor state axioms.
-
towards state update axioms reifying successor state axioms
Lecture Notes in Computer Science, 1998Co-Authors: Michael ThielscherAbstract:Successor state axioms are an optimal solution to the famous Frame Problem in reasoning about actions|but only as far as its representational aspect is concerned. We show how by gradually applying the principle of reification to these axioms, one can achieve gradual improvement regarding the inferential aspect without losing the representational merits. The resulting concept of state update axioms constitutes a novel version of what is known as the Fluent Calculus. We illustrate that under the provision that actions have no so-called open effects, any Situation Calculus specification can be transformed into an essentially equivalent Fluent Calculus specification, in which at the same time the representational and the inferential aspect of the Frame Problem are addressed. This alternative access to the Fluent Calculus both clarifies its role in relation to the most popular axiomatization paradigm and should help to enhance its acceptance.
Teppo Felin - One of the best experts on this subject based on the ideXlab platform.
-
economic opportunity and evolution beyond landscapes and bounded rationality
Strategic Entrepreneurship Journal, 2014Co-Authors: Teppo Felin, Stuart A Kauffman, Roger Koppl, Giuseppe LongoAbstract:The nature of economic opportunity has recently received significant attention in entrepreneurship, organization science and strategy. The notion of boundedly rational search on an (NK) opportunity landscape has been particularly relevant to these conversations and debates. We argue that the focus on bounded rationality and search is highly Problematic for the fields of entrepreneurship and strategy and does not allow us to explain the origins of economic novelty. We contrast the NP Problem with the Frame Problem to illustrate our point, and highlight the role of adjacent possibilities and novel affordances. We discuss the entrepreneurial and economic implications of these arguments by building on unique insights from biology, the natural and computational sciences. Copyright © 2014 Strategic Management Society.
-
Economic Opportunity and Evolution: Beyond Landscapes and Bounded Rationality
Strategic Entrepreneurship Journal, 2014Co-Authors: Teppo Felin, Roger Koppl, Stuart Kauffman, Giuseppe LongoAbstract:The nature of economic opportunity has recently received significant attention in entrepreneurship and strategy. The notion of search on an (NK) opportunity landscape has been particularly relevant to these conversations and debates. We argue that existing notions of landscapes are overly focused on bounded rationality and search (often instantiated as the Problem of NP-completeness), rather than focusing on how to account for the readily manifest, emergent novelty we see in the economic sphere (the “Frame Problem”). We discuss the entrepreneurial and economic implications of these arguments by building on unique insights from biology, the natural and computational sciences.
Richard B Scherl - One of the best experts on this subject based on the ideXlab platform.
-
reasoning about the interaction of knowlege time and concurrent actions in the situation calculus
International Joint Conference on Artificial Intelligence, 2003Co-Authors: Richard B ScherlAbstract:A formal Framework for specifying and developing agents/robots must handle not only knowledge and sensing actions, but also time and concurrency. Researchers have extended the situation calculus to handle knowledge and sensing actions. Other researchers have addressed the issue of adding time and concurrent actions. Here both of these features are combined into a united logical theory of knowledge, sensing, time, and concurrency. The result preserves the solution to the Frame Problem of previous work, maintains the distinction between indexical and objective knowledge of time, and is capable of representing the various ways in which concurrency interacts with time and knowledge. Furthermore, a method based on regression is developed for solving the projection Problem for theories specified in this version of the situation calculus.
-
knowledge action and the Frame Problem
Artificial Intelligence, 2003Co-Authors: Richard B Scherl, Hector J LevesqueAbstract:This paper proposes a method for handling the Frame Problem for knowledge-producing actions. An example of a knowledge-producing action is a sensing operation performed by a robot to determine whether or not there is an object of a particular shape within its grasp. The work is an extension of Reiter's approach to the Frame Problem for ordinary actions and Moore's work on knowledge and action. The properties of our specification are that knowledge-producing actions do not affect fluents other than the knowledge fluent, and actions that are not knowledge-producing only affect the knowledge fluent as appropriate. In addition, memory emerges as a side-effect: if something is known in a certain situation, it remains known at successor situations, unless something relevant has changed. Also, it will be shown that a form of regression examined by Reiter for reducing reasoning about future situations to reasoning about the initial situation now also applies to knowledge-producing actions.
-
ability and knowing how in the situation calculus
Studia Logica, 2000Co-Authors: Yves Lesperance, Hector J Levesque, Richard B ScherlAbstract:Most agents can acquire information about their environments as they operate. A good plan for such an agent is one that not only achieves the goal, but is also executable, i.e., ensures that the agent has enough information at every step to know what to do next. In this paper, we present a formal account of what it means for an agent to know how to execute a plan and to be able to achieve a goal. Such a theory is a prerequisite for producing specifications of planners for agents that can acquire information at run time. It is also essential to account for cooperation among agents. Our account is more general than previous proposals, correctly handles programs containing loops, and incorporates a solution to the Frame Problem. It can also be used to prove programs containing sensing actions correct.
-
the Frame Problem and knowledge producing actions
National Conference on Artificial Intelligence, 1993Co-Authors: Richard B Scherl, Hector J LevesqueAbstract:This paper proposes a solution to the Frame Problem for knowledge-producing actions. An example of a knowledge-producing action is a sense operation performed by a robot to determine whether or not there is an object of a particular shape within its grasp. The work is an extension of Reiter's solution to the Frame Problem for ordinary actions and Moore's work on knowledge and action. The properties of our specification are that knowledge-producing actions do not affect fluents other than the knowledge fluent, and actions that are not knowledge-producing only affect the knowledge fluent as appropriate. In addition, memory emerges as a side-effect: if something is known in a certain situation, it remains known at successor situations, unless something relevant has changed. Also, it will be shown that a form of regression examined by Reiter for reducing reasoning about future situations to reasoning about the initial situation now also applies to knowledge-producing actions.
