This paper is exploring whether analogy-making as an early developing ability could potentially help children to develop deductive reasoning ability and in particular, transitive inference. Two experiments are presented. In the first one transitive mapping is explored further to make sure children at the age of 4 can do the transitive mapping task even when all three objects are hidden and no p...

In the selection task, individuals generally do not follow the deductive rules of standard logic. In the present research, a new abstract selection task was designed by extending the range of cards that the participants face (inspired by Manktelow, Sutherland and Over, 1995). It was used in two experiments to test predictions about the matching bias and the probabilistic approach of reasoning. ...

In this paper, we present a deductive object-oriented knowledge base system, called R-DEVICE, which imports RDF data into the CLIPS production rule system as objects and uses a deductive rule language for querying and reasoning about them. In our model properties of resources are not scattered across several triples as in most other RDF storage and querying systems, resulting in increased query...

Deductive versus probabilistic inferences are distinguished by normative theories, but it is unknown whether these two forms of reasoning engage similar cerebral loci. To clarify the matter, positron emission tomography was applied during deductive versus probabilistic reasoning tasks, using identical stimuli. Compared to a language comprehension task involving the same stimuli, both probabilis...

This paper introduces a new parser-driven Japanese tutor called BANZAI, and presents an experimental study comparing the relative effectiveness of deductive (rule driven) feedback and inductive (example driven) feedback implemented in the BANZAI program. The study finds that deductive feedback can be superior to inductive feedback when the learning task involves relatively complex structures wh...

Modular deductive veri cation of software systems is a complex task: the user has to put a lot of e ort in writing module speci cations that t together when verifying the system as a whole. In this paper, we propose a combination of deductive veri cation and software bounded model checking (SBMC), where SBMC is used to support the user in the speci cation and veri cation process, while deductiv...

We present KeY-C: a tool for deductive verification of C programs. KeY-C allows verification of C programs w.r.t. operation contracts and invariants. It is based on an earlier version of KeY that supports Java Card. In this paper we outline syntax, semantics, and calculus of C Dynamic Logic (CDL) that were adapted from their Java Card counterparts. Currently, the tool is in an early development...

Two-literal clauses of the form L R occur quite frequently in logic programs, deductive databases, and { disguised as an equation { in term rewriting systems. These clauses deene a cycle if the atoms L and R are weakly uniiable, ie. if L uniies with a new variant of R. The obvious problem with cycles is to control the number of iterations through the cycle. In this paper we consider the cycle u...