The paper proposes a method for tabular deduction for multimodal logical grammar, extending a method for linear logic presented in (Hepple, 1996; Hepple, 1998). Tabular deduction for multimodal logical grammar avoids redundant computation like chart parsing does for CFGs. The method discussed here enables one to process any kind of multimodal logical grammar fragment. An implementation of the m...

In this paper, we show how a system for automated deduction can be given computational reeection, i.e. can aaect its own computation mechanism, by using the very same machinery implementing logical deduction. This feature, that we call computational reeection via mechanized logical deduction, provides both theoretical and practical advantages. First, the theorem prover can inspect, extend and m...

A new predicate calculus deduction system based on production rules is pro. Logical deduction is a basic activity in many artificial intelligence Al systems.ideas that support many of the useful applications of artificial intelligence. Many Rule-Based Systems Are Deduction Systems. One of the most important aspects of rule-based systems is the. For instance, in deduction systems, forward.They a...

We present a logical formalism of the actor-based concurrent object oriented computation in terms of the deduction in linear logic. By encoding messages and objects in the actor model as formulae of linear logic, the distributed state of the actor computation, regarded as a connguration, can be represented as a multiset of object formulae and message formulae. Methods are encoded as a special f...

The work concerns formal verification of workflow-oriented software models using the deductive approach. The formal correctness of a model’s behaviour is considered. Manually building logical specifications, which are regarded as a set of temporal logic formulas, seems to be a significant obstacle for an inexperienced user when applying the deductive approach. A system, along with its architect...

This paper provides a logical basis for manipulation with fuzzy IF-THEN rules. Our theory is wide enough and it encompasses not only finding a conclusion by means of the compositional rule of inference due to Lotfi A. Zadeh but also other kinds of approximate reasoning methods, e.g. perception-based deduction, provided that there exists a possibility to characterize them within a formal logical...

Deduction, induction, and analogy pervade all our thinking. In contrast with deduction, understanding logical aspects of induction and analogy is stil l an important and challenging issue of artificial intelligence. This paper describes a logical formalization, called production, of common conjectural reasoning of both induction and analogy. By introduction of preduction, analogical reasoning i...

In this paper we argue that sequent proofs systems are a better deductive apparatus for introducing proofs to students than are natural deduction systems. Natural deduction derivations of superintuitionistic theorems (theorems of classical logic that are not intuitionistically valid) require indirect and often obtuse constructions. Constructing derivations in sequent systems is uniform, driven ...