Die hier zur Verfügung gestellte Datei ist leider nicht vollständig, aus technischen Gründen sind die folgenden Anhänge leider nicht enthalten: Anhang 3: Begriffshierarchie "verarbeitungstechnische Funktion" S. 141 Anhang 4: Begriffshierarchie "Eigenschaftsänderung" S. 144 Anhang 5: Begriffshierarchie "Verarbeitungsgut" S. 149 Anhang 6: Begriffshierarchie "Verarbeitungstechnisches Prinzip" S. 151 Konsultieren Sie die Druckausgabe, die Sie im Bestand der SLUB Dresden finden: http://slubdd.de/katalog?TN_libero_mab21079933

Much of cognitive science research and almost all of AI research into problem solving has focused on the use of verbal or propositional representations. However, there is significant evidence that humans solve problems using different representational modalities, including visual or iconic ones. In this dissertation, I investigate visual problem solving from the perspectives of autism, psychometrics, and AI. Studies of individuals on the autism spectrum show that they often use atypical patterns of cognition, and anecdotal reports have frequently mentioned a tendency to "think visually." I examined one precise characterization of visual thinking in terms of iconic representations. I then conducted a comprehensive review of data on several cognitive tasks from the autism literature and found numerous instances indicating that some individuals with autism may have a disposition towards visual thinking. One task, the Raven's Progressive Matrices test, is of particular interest to the field of psychometrics, as it represents one of the single best measures of general intelligence that has yet been developed. Typically developing individuals are thought to solve the Raven's test using largely verbal strategies, especially on the more difficult subsets of test problems. In line with this view, computational models of information processing on the Raven's test have focused exclusively on propositional representations. However, behavioral and fMRI studies of individuals with autism suggest that these individuals may use instead a predominantly visual strategy across most or all test problems. To examine visual problem solving on the Raven's test, I first constructed a computational model, called the Affine and Set Transformation Induction (ASTI) model, which uses a combination of affine transformations and set operations to solve Raven's problems using purely pixel-based representations of problem inputs, without any propositional encoding. I then performed four analyses using this model. First, I tested the model against three versions of the Raven's test, to determine the sufficiency of visual representations for solving this type of problem. The ASTI model successfully solves 50 of the 60 problems on the Standard Progressive Matrices (SPM) test, comparable in performance to the best computational models that use propositional representations. Second, I evaluated model robustness in the face of changes to the representation of pixels and visual similarity. I found that varying these low-level representational commitments causes only small changes in overall performance. Third, I performed successive ablations of the model to create a new classification of problem types, based on which transformations are necessary and sufficient for finding the correct answer. Fourth, I examined if patterns of errors made on the SPM can provide a window into whether a visual or verbal strategy is being used. While many of the observed error patterns were predicted by considering aspects of the model and of human behavior, I found that overall error patterns do not seem to provide a clear indicator of strategy type. The main contributions of this dissertation include: (1) a rigorous definition and examination of a disposition towards visual thinking in autism; (2) a sufficiency proof, through the construction of a novel computational model, that visual representations can successfully solve many Raven's problems; (3) a new, data-based classification of problem types on the SPM; (4) a new classification of conceptual error types on the SPM; and (5) a methodology for analyzing, and an analysis of, error patterns made by humans and computational models on the SPM. More broadly, this dissertation contributes significantly to our understanding of visual problem solving.

While automated game playing systems like Deep Blue perform excellent within their domain, handling a different game or even a slight change of rules is impossible without intervention of the programmer. Considered a great challenge for Artificial Intelligence, General Game Playing is concerned with the development of techniques that enable computer programs to play arbitrary, possibly unknown n-player games given nothing but the game rules in a tailor-made description language. A key to success in this endeavour is the ability to reliably extract hidden game-specific features from a given game description automatically. An informed general game player can efficiently play a game by exploiting structural game properties to choose the currently most appropriate algorithm, to construct a suited heuristic, or to apply techniques that reduce the search space. In addition, an automated method for property extraction can provide valuable assistance for the discovery of specification bugs during game design by providing information about the mechanics of the currently specified game description. The recent extension of the description language to games with incomplete information and elements of chance further induces the need for the detection of game properties involving player knowledge in several stages of the game. In this thesis, we develop a formal proof method for the automatic acquisition of rich game-specific invariance properties. To this end, we first introduce a simple yet expressive property description language to address knowledge-free game properties which may involve arbitrary finite sequences of successive game states. We specify a semantic based on state transition systems over the Game Description Language, and develop a provably correct formal theory which allows to show the validity of game properties with respect to their semantic across all reachable game states. Our proof theory does not require to visit every single reachable state. Instead, it applies an induction principle on the game rules based on the generation of answer set programs, allowing to apply any off-the-shelf answer set solver to practically verify invariance properties even in complex games whose state space cannot totally be explored. To account for the recent extension of the description language to games with incomplete information and elements of chance, we correctly extend our induction method to properties involving player knowledge. With an extensive evaluation we show its practical applicability even in complex games.

This study investigated whether age differences in deceit detection are related to impairments in emotion recognition. Key cues to deceit are facial expressions of emotion (Frank and Ekman, 1997). The aging literature has shown an age-related decline in decoding emotions (e.g., Malatesta, Izard, Culver, and Nicolich, 1987). In the present study, 354 participants were presented with 20 interviews and asked to decide whether each man was lying or telling the truth. Ten interviews involved a crime and ten a social opinion. Each participant was in one of three presentation conditions: 1) visual only, 2) audio only, or 3) audio-visual. For crime interviews, age-related impairments in emotion recognition hindered older adults in the visual only condition. In the opinion topic interviews, older adults exhibited a truth bias which rendered them worse at detecting deceit than young adults. Cognitive and dispositional variables did not help to explain the age differences in the ability to detect deceit.

Visual media are of great importance to designers. Understanding a new design, for example, often means understanding a drawing. From the perspective of artificial intelligence, this implies that automated knowledge acquisition in computer-aided design can productively occur using drawings as a knowledge source. However, this requires machines that are able to interpret design drawings. I view the task of interpreting drawings as one of constructing a teleological model of the design depicted in the drawings, where the model enables causal and functional inferences about the depicted design. I have developed a novel analogical method for constructing a teleological model of a mechanical device from an unlabelled 2D line drawing. The source case is organized in a Drawing Shape Structure Behavior Function (DSSBF) abstraction hierarchy. This knowledge organization enables the analogical mapping and transfer to occur at multiple levels of abstraction. Given a target drawing and a relevant source case, my method of compositional analogy first constructs a graphical representation of the lines and the intersections in the target drawing, then uses the mappings at the level of line intersections to transfer the shape representations from the source case to the target. It next uses the mappings at the level of shapes to transfer the structural model of the device from the source to the target. Finally, the mappings from the source to the target structural model enable the transfer of behaviors and the functional specification from source to target, completing the analogy and yielding a complete DSSBF model of the input drawing. The Archytas system implements this method of compositional analogy and evaluates it in the domain of kinematic devices such as piston and crankshaft devices, door latches, and pulley systems.

Beschreibungslogiken (Description logics, DLs) sind eine Klasse von Wissensrepraesentationsformalismen mit wohldefinierter, logik-basierter Semantik und entscheidbaren Schlussfolgerungsproblemen, wie z.B. dem Erfuellbarkeitsproblem. Zwei wichtige Entscheidungsverfahren fuer das Erfuellbarkeitsproblem von DL-Ausdruecken sind Tableau- und Automaten-basierte Algorithmen. Diese haben aufgrund ihrer unterschiedlichen Arbeitsweise komplementaere Eigenschaften: Tableau-Algorithmen eignen sich fuer Implementierungen und fuer den Nachweis von PSPACE- und NEXPTIME-Resultaten, waehrend Automaten sich besonders fuer EXPTIME-Resultate anbieten. Zudem ermoeglichen sie eine vom Standpunkt der Theorie aus elegantere Handhabung von unendlichen Strukturen, eignen sich aber wesentlich schlechter fuer eine Implementierung. Ziel der Dissertation ist es, die Gruende fuer diese Unterschiede zu analysieren und Moeglichkeiten aufzuzeigen, wie Eigenschaften von einem Ansatz auf den anderen uebertragen werden koennen, um so die positiven Eigenschaften von beiden Ansaetzen miteinander zu verbinden. Unter Anderem werden Methoden entwickelt, mit Hilfe von Automaten PSPACE-Resultate zu zeigen, und von einem Tableau-Algorithmus automatisch ein EXPTIME-Resultat abzuleiten. / Description Logics (DLs) are a family of knowledge representation languages with well-defined logic-based semantics and decidable inference problems, e.g. satisfiability. Two of the most widely used decision procedures for the satisfiability problem are tableau- and automata-based algorithms. Due to their different operation, these two classes have complementary properties: tableau algorithms are well-suited for implementation and for showing PSPACE and NEXPTIME complexity results, whereas automata algorithms are particularly useful for showing EXPTIME results. Additionally, they allow for an elegant handling of infinite structures, but they are not suited for implementation. The aim of this thesis is to analyse the reasons for these differences and to find ways of transferring properties between the two approaches in order to reconcile the positive properties of both. For this purpose, we develop methods that enable us to show PSPACE results with the help of automata and to automatically derive an EXPTIME result from a tableau algorithm.

Facing the growing amount of information in today's society, the task of specifying human knowledge in a way that can be unambiguously processed by computers becomes more and more important. Two acknowledged fields in this evolving scientific area of Knowledge Representation are Description Logics (DL) and Formal Concept Analysis (FCA). While DL concentrates on characterizing domains via logical statements and inferring knowledge from these characterizations, FCA builds conceptual hierarchies on the basis of present data. This work introduces Relational Exploration, a method for acquiring complete relational knowledge about a domain of interest by successively consulting a domain expert without ever asking redundant questions. This is achieved by combining DL and FCA: DL formalisms are used for defining FCA attributes while FCA exploration techniques are deployed to obtain or refine DL knowledge specifications.

Title from PDF of title page. / Document formatted into pages; contains 42 pages. / Thesis (M.S.C.S.)--University of South Florida, 2002. / Includes bibliographical references. / Text (Electronic thesis) in PDF format. / ABSTRACT: When medical researchers test a new treatment procedure, they recruit patients with appropriate health problems and medical histories. An experiment with a new procedure is called a clinical trial. The selection of patients for clinical trials has traditionally been a labor-intensive task, which involves matching of medical records with a list of eligibility criteria. A recent project at the University of South Florida has been aimed at the automation of this task. The project has involved the development of an expert system that selects matching clinical trials for each patient. / If a patient's data are not sufficient for choosing a trial, the system suggests additional medical tests. We report the work on the representation and entry of the related selection criteria and medical tests. We first explain the structureof the system's knowledge base, which describes clinical trials and criteria for selecting patients. We then present an interface that enables a clinician to add new trials and selection criteria without the help of a programmer. Experiments show that the addition of a new clinical trial takes ten to twenty minutes, and that novice users learn the full functionality of the interface in about an hour. / System requirements: World Wide Web browser and PDF reader. / Mode of access: World Wide Web.

Logic-based formalizations of dynamical systems are central to the field of knowledge representation and reasoning. These formalizations can be used to model agents that act, reason,and perceive in a changing and incompletely known environment. A key aspect of reasoning about agents and their behaviors is the notion of joint ability. A team of agents is jointly able to achieve a goal if despite any incomplete knowledge or even false beliefs about the world or each other, they still know enough to be able to get to a goal state, should they choose to do so. A particularly challenging issue associated with joint ability is how team members can coordinate their actions. Existing approaches often require the agents to communicate to agree on a joint plan. In this thesis, we propose an account of joint ability that supports coordination among agents without requiring communication, and that allows for agents to have incomplete (or even false) beliefs about the world or the beliefs of other agents. We use ideas from game theory to address coordination among agents. We introduce the notion of a strategy for each agent which is basically a plan that the agent knows how to follow. Each agent compares her strategies and iteratively discards those that she believes are not good considering the strategies that the other agents have kept. Our account is developed in the situation calculus, a logical language suitable for representing and reasoning about action and change that is extended to support reasoning about multiple agents. Through several examples involving public, private, and sensing actions, we demonstrate how symbolic proof techniques allow us to reason about team ability despite incomplete specifications about the beliefs of agents.

Description Logics (DLs) are a class of knowledge representation formalisms that can represent terminological and assertional knowledge using a well-defined semantics. Often, knowledge engineers are experts in their own fields, but not in logics, and require assistance in the process of ontology design. This thesis presents three methods that can extract terminological knowledge from existing data and thereby assist in the design process. They are based on similar formalisms from Formal Concept Analysis (FCA), in particular the Next-Closure Algorithm and Attribute-Exploration. The first of the three methods computes terminological knowledge from the data, without any expert interaction. The two other methods use expert interaction where a human expert can confirm each terminological axiom or refute it by providing a counterexample. These two methods differ only in the way counterexamples are provided.