At what age and in what ways do children distinguish deductive and inductive problems? In Experiment 1, students from kindergarten and from Grades 2, 4, and 6 were presented with deductive or inductive inference problems and asked to draw an inference and rate their confidence. By 4th grade, confidence ratings for deductive problems were higher than those for inductive problems, and responses w...

OBJECTIVE The purpose of this study was to determine the interrater reliability and discriminant validity of Toglia's Deductive Reasoning test for individuals with brain injuries. METHOD Forty-two individuals with brain injuries and 51 participants without disabilities ranging in age from 18 to 84 years were given the Deductive Reasoning test three consecutive times. A between groups repeated...

A new modal logic D is introduced. It describes properties of provability by interpreting modality as a deductive closure operator on sets of formulas. Logic D is proven to be decidable and complete with respect to this semantics.

The area of deductive databases has matured in recent years, and it now seems appropriate to re ect upon what has been achieved and what the future holds. In this paper, we provide an overview of the area and brie y describe a number of projects that have led to implemented systems.

Gallaire, Minker, and Nicolas stated that logic and databases was a field in its own right. This was the first time that this designation was made. The impetus for it started approximately 20 years ago in 1976 when I visited Gallaire and Nicolas in Toulouse, France. In this article, I provide an assessment about what has been achieved in the 20 years since the field started as a distinct discip...

This paper sets out to analyze the modes of ‘venture learning’, which is defined as the process whereby knowledge is acquired on how to identify, develop and exploit business opportunities and the associated ventures. The context of learning discussed here is that of high technology ventures, and the ways in which certain types of venture relevant knowledge is acquired and transferred by ventur...

In this paper, we introduce and study a new paraconsistent inference relation |=c in the setting of 3-valued paraconsistent logics. Using inconsistency forgetting as a key mechanism for recovering consistency, it guarantees that the deductive closure Cn|=c(Σ) of any belief base Σ is classically consistent and classically closed. This strong feature, not shared by previous inference relations in...

on (Constraint) Logic Programming and 24th International Workshop on Functional and (Constraint) Logic Programming (WLP’15/’16/WFLP’16). EPTCS 234, 2017, pp. 57–72, doi:10.4204/EPTCS.234.5 c © S. Brass & H. Stephan This work is licensed under the Creative Commons Attribution-Noncommercial-No Derivative Works License. Experiences with Some Benchmarks for Deductive Databases and Implementations o...