| 1. |
- Strannegård, Claes, 1962, et al.
(författare)
-
Ecosystem Models Based on Artificial Intelligence
- 2022
-
Ingår i: 34th Workshop of the Swedish Artificial Intelligence Society, SAIS 2022. - : IEEE.
-
Konferensbidrag (refereegranskat)abstract
- Ecosystem models can be used for understanding general phenomena of evolution, ecology, and ethology. They can also be used for analyzing and predicting the ecological consequences of human activities on specific ecosystems, e.g., the effects of agriculture, forestry, construction, hunting, and fishing. We argue that powerful ecosystem models need to include reasonable models of the physical environment and of animal behavior. We also argue that several well-known ecosystem models are unsatisfactory in this regard. Then we present the open-source ecosystem simulator Ecotwin, which is built on top of the game engine Unity. To model a specific ecosystem in Ecotwin, we first generate a 3D Unity model of the physical environment, based on topographic or bathymetric data. Then we insert digital 3D models of the organisms of interest into the environment model. Each organism is equipped with a genome and capable of sexual or asexual reproduction. An organism dies if it runs out of some vital resource or reaches its maximum age. The animal models are equipped with behavioral models that include sensors, actions, reward signals, and mechanisms of learning and decision-making. Finally, we illustrate how Ecotwin works by building and running one terrestrial and one marine ecosystem model.
|
|
| 2. |
- Strannegård, Claes, 1962, et al.
(författare)
-
An Anthropomorphic Method for Number Sequence Problems
- 2013
-
Ingår i: Cognitive Systems Research. - : Elsevier BV. - 1389-0417. ; 22-23, s. 27-34
-
Tidskriftsartikel (refereegranskat)abstract
- Number sequence problems appear frequently in IQ tests, where the task is to extrapolate finite sequences of integers. This paper presents a computational method for solving number sequence problems appearing in IQ tests. The assumption that these problems are solvable by humans is actively exploited to keep the computational complexity manageable. The method combines elements of artificial intelligence and cognitive psychology and is referred to as anthropomorphic because it makes use of a model of human reasoning. This model features a set of cognitive resources, a repertoire of patterns that encode integer sequences, and a notion of bounded computation for decoding patterns. The model facilitates the search for patterns matching a given integer sequence by quickly discarding many patterns on the grounds that they are too demanding to decode. The computational method was implemented as a computer program called Asolver and then tested against the programs Mathematica and Maple. On the number sequence problems of the IQ test PJP, Asolver scored above IQ 140, whereas the other programs scored below IQ 100.
|
|
| 3. |
- Strannegård, Claes, 1962, et al.
(författare)
-
Reasoning Processes in Propositional Logic
- 2010
-
Ingår i: Journal of Logic, Language and Information. - : Springer Science and Business Media LLC. - 0925-8531 .- 1572-9583. ; 19:3, s. 283--314-314
-
Tidskriftsartikel (refereegranskat)abstract
- We conducted a computer-based psychological experiment in which a random mix of 40 tautologies and 40 non-tautologies were presented to the participants, who were asked to determine which ones of the formulas were tautologies. The participants were eight university students in computer science who had received tuition in propositional logic. The formulas appeared one by one, a time-limit of 45 s applied to each formula and no aids were allowed. For each formula we recorded the proportion of the participants who classified the formula correctly before timeout (accuracy) and the mean response time among those participants (latency). We propose a new proof formalism for modeling propositional reasoning with bounded cognitive resources. It models declarative memory, visual memory, working memory, and procedural memory according to the memory model of Atkinson and Shiffrin and reasoning processes according to the model of Newell and Simon. We also define two particular proof systems, T and NT, for showing propositional formulas to be tautologies and non-tautologies, respectively. The accuracy was found to be higher for non-tautologies than for tautologies (p
|
|
