Search results for " Reason"
showing 10 items of 465 documents
The Development of Conditional Reasoning: A Mental Model Account
2002
Abstract Conditional (if-then) reasoning is one of the key components of logical reasoning. Studies examining the way that children and adults make conditional inferences have shown that while there are some clear developmental patterns, there is also a great deal of variation in performance due to factors such as problem content. Such variation is difficult to model without an explicit process model. In the following we propose a variant of mental model theory (Johnson-Laird, 1983) that can explain much of the empirical data. This model suggests that the development of conditional reasoning can be explained, at least partly, by such factors as the capacity of working memory, the range of k…
Co-learning of recursive languages from positive data
1996
The present paper deals with the co-learnability of enumerable families L of uniformly recursive languages from positive data. This refers to the following scenario. A family L of target languages as well as hypothesis space for it are specified. The co-learner is fed eventually all positive examples of an unknown target language L chosen from L. The target language L is successfully co-learned iff the co-learner can definitely delete all but one possible hypotheses, and the remaining one has to correctly describe L.
On the intrinsic complexity of learning
1995
A new view of learning is presented. The basis of this view is a natural notion of reduction. We prove completeness and relative difficulty results. An infinite hierarchy of intrinsically more and more difficult to learn concepts is presented. Our results indicate that the complexity notion captured by our new notion of reduction differs dramatically from the traditional studies of the complexity of the algorithms performing learning tasks.
Was King Arthur a King by Definition?
1988
Current research in knowledge representation distinguishes between descriptional and assertional interpretations of semantic nets. This paper explores theoretical and applicative problems, which arise from that distinction in a historic domain. A prolog implementation of KL-ONE is used as a vehicle to compare the various alternatives available to represent knowledge related to single elements of the domain insertion or not of this knowledge in semantic nets in their descriptional sense. The final section of the paper discusses the problem in relation to the theories concerning the functioning of proper names from a logical and philosophical point of view.
Mutamento del giudice e rinnovazione della prova: la Corte costituzionale esorbita dai confini accusatori
2020
The “Judge of the laws” delivers to the Parliament punctuals directives to give concreteness to the reasonable duration of the trial. What is at stake is the right to renew the evidence in the event of a change of the judge, which is drastically reduced to prevent it from being used merely for dilatory purposes. The Author criticizes the decision in question, fearing a dangerous drift: the renewal only of the “useful” evidence.
La ragionevole durata del processo civile: uno studio di diritto comparato
2021
Il volume indaga il tema della ragionevole durata del processo civile, ponendo a raffronto le principali riforme adottate in Italia e in Inghilterra per ridurre i ritardi della giustizia nazionale in linea con l’art. 6 Cedu. La trattazione prende in esame l’assetto normativo e rimediale di ciascuno dei sistemi giuridici considerati guardando, in prospettiva diacronica, alle fonti legislative e giurisprudenziali, nonché agli indicatori internazionali e alle nuove tecnologie digitali, che mirano all’efficienza processuale. Il quadro così tracciato mette in luce la differente declinazione della ragionevolezza dei tempi del processo nei due ordinamenti europei, in risposta alla necessità di gar…
A Knowledge-Based System for the Automatic Generation of Plant Shutdown and Startup Schedules
1988
Abstract When the shutdown of a plant, or part of it, has been decided as consequence of a major fault, the generation of a safe shutdown schedule may be, for large and complex plants, a very difficult and delicate task. The same problem may be found when the plant must be restarted after the fault has been repaired, for the generation of a start-up schedule. The use of a knowledge-based system appears to be a suitable answer to this problem, allowing a high level of safety and a very fast generation process. The paper examines the process knowledge that needs to be included in such a knowledge-based system and proposes some knowledge representation forms that appear suitable for the task t…
Discretized Bayesian Pursuit – A New Scheme for Reinforcement Learning
2012
Published version of a chapter in the book: Advanced Research in Applied Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-31087-4_79 The success of Learning Automata (LA)-based estimator algorithms over the classical, Linear Reward-Inaction ( L RI )-like schemes, can be explained by their ability to pursue the actions with the highest reward probability estimates. Without access to reward probability estimates, it makes sense for schemes like the L RI to first make large exploring steps, and then to gradually turn exploration into exploitation by making progressively smaller learning steps. However, this behavior becomes counter-intuitive wh…
Analogical reasoning performance and organization is influenced by the type of semantic distractors : an investigation with adults
2015
International audience; The way participants adapt their search to the specifics of different types of analogies is not fully understood. We compared the effects of two types of semantic distractors. The first were related to C by a semantic relation which had nothing to do with the semantic relation used in the A:B pairs, whereas the second, the so-called "double distractors", were not only related to C but also had a semantic relation similar to the one linking A to B. We used eye-tracking measurements in addition to reaction time and performance indices. We found that performance decreased, and that the solution set was less explored visually with the double distractors than with the for…
ViziQuer: A Web-Based Tool for Visual Diagrammatic Queries Over RDF Data
2018
We demonstrate the open source ViziQuer tool for web-based creation and execution of visual diagrammatic queries over RDF/SPARQL data. The tool supports the data instance level and statistics queries, providing visual counterparts for most of SPARQL 1.1 select query constructs, including aggregation and subqueries. A query environment can be created over a user-supplied SPARQL endpoint with known data schema (a data schema exploration service is available, as well). There are pre-defined demonstration query environments for a mini-university data set, a fragment of synthetic similar to reality hospital data set, and a variant of Linked Movie Database RDF data set.