«generalized implicit enumeration»
۲۱۹ نتیجهAn Empirical Examination of Exact Algorithms for the Cardinality Steiner Problem
The Cardinality Steiner Problem (CSP) is a generalization of the well known and easily solved shortest path and minimum spanning tree problems. Despite the polynomial solvability of these and other special cases, the CSP is NP-complete. This complexity notwithstanding, it is a pr
Distributivity in Incompletely Speciied Type Hierarchies: Theory and Computational Complexity
Type hierarchies are a central feature of current systems which employ feature structures for the representation and manipulation of linguistic knowledge, such as TFS, ALE, CUF, and LKB. The system CUF stands out amongst these in its very general language for describing such hier
The Emergence of Abstract Representations in Dyad Problem Solving
ion in Dyads -1 The Emergence of Abstract Representations in Dyad Problem Solving Daniel L. Schwartz Peabody College, Vanderbilt University ! " # $ % & ! ' ( ) * + * % # $ , $ . / , * $ / * 0 1 2 3 4 2 5 Running Head: Abstraction in Dyads Requests for reprints should be sent Dani
Gödel's Incompleteness Theorems, Free Will and Mathematical Thought
Some have claimed that Gödel’s incompleteness theorems on the formal axiomatic model of mathematical thought can be used to demonstrate that mind is not mechanical, in opposition to a Formalist-Mechanist Thesis. Following an explanation of the incompleteness theorems and their re
Knowledge Representation and the Embodied Mind: Towards a Philosophy and Technology of Personalized Informatics
Knowledge representation has a long tradition in logic and philosophy. Automated reasoning with ontologies and categories had been discussed in philosophy, before it was formalized in artificial intelligence and e.g. applied in information systems. But, most of our knowledge is i
The Discovery of Mathematical Probability Theory: a Case Study in the Logic of Mathematical Inquiry
ing from their actual experience with games of chance, a collection of possible outcomes of aleatory trials. This does not mean that the collection or complete enumeration of possible outcomes was directly perceived; it rather means that these inquirers were able to imagine the a
Experimental Psychology: Human Perception and Performance Sets Within Sets: The Influence of Set Membership on Numerical Estimates
Navigating the world requires attention to number; however sets in real-world contexts are rarely homogeneous or presented in isolation, thus the task of determining what constitutes a relevant set for enumeration can be a difficult one. This contextual ambiguity increases the li
Decision Analysis Techniques for Knowledge Acquisition: Combining Information and Preferences Using Aquinas and Axotl
The field of decision analysis is concerned with the application of formal theories of probability and utility to the guidance of action. Decision analysis has been used for many years as a way to gain insight regarding decisions that involve significant amounts of uncertain info
Maintaining causality between design regularities and source code
ion level in the implementation Another property of structural source-code regularities is that they are generally prevalent at a particular abstraction level in the implementation. Similar to the work of Buschmann et al. [BMR+96] on pattern-oriented software architecture, we dis
Stochastic Tree Search: Where to Put the Randomness?
In this short note, I argue against two commonlyheld biases. The first is that stochastic search is applicable only to improvement search over complete solutions. On the contrary, many problems have effective greedy heuristics for constructing solutions, making a tree-structured