A common inadequacy of current knowledge-based systems is that they cannot reason about those situations and/or problems that have not been considered by their developers. A major cause of this inadequacy is that the system cannot automatically generate new and valid reasoning rules from those existing rules and facts that are programmed or inputted in the systems by their developers or users. ...

The Interacting Cognitive Subsystems framework, ICS (Barnard, 1985) proposes that central executive phenomena can be accounted for by two autonomous subsystems, which process different forms of meaning: propositional and schematic (implicational) meanings. The apparent supervisory role of the executive arises from limitations on the exchange of information between these and other cognitive subs...

We study a higher order uniication procedure based on proof nets. In this paper, we present higher order uniication algorithm for intuitionistic implicational multiplicative fragment of proof nets and show termination and soundness for the algorithm.

We present a semantics (using Kripke lambda models) for a logical framework (minimal implicational predicate logic with quantiication over all higher types). We apply the semantics to obtain straightforward adequacy proofs for encodings of logics in the framework.

The formalism of GUHA style data mining is confronted with the approach of relational structures of D untsch, Orlowska and others. A computational complexity result on tautologies with implicational quan-tiiers is presented.

A general -observation-basedqualitative framework to extract agent-based pedestrian behavior is presented. To extract qualitative rules from data we use tools, from Formal Concept Analysis, for implicational reasoning.

We present a system of natural deduction and associated term calculus for intuitionistic non-commutative linear logic (INCLL) as a conservative extension of intuitionistic linear logic. We prove subject reduction and the existence of canonical forms in the implicational fragment.

The polyadic algebras that arise from the algebraization of the first-order extensions of a SIC are characterized and a representation theorem is proved. Standard implicational calculi (SIC)’s were considered by H. Rasiowa [19] and include classical and intuitionistic logic and their various weakenings and fragments, the many-valued logics of Post and Lukasiewicz, modal logics that admit the ru...