In this paper a semantical framework is developed that provides a logical description of the functionality of an interactive reasoning module. In particular it can be made more transparent by this framework whether or not the conclusions that may be drawn by a reasoning module fit to the situation that is concerned (soundness and completeness). It will be established that, considered from the v...

Most automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means to remove some clutter. Here we pursue this approach systematically, analysing formally a variety of encodings that further improve on efficiency while retaining soundness and completeness. We extend the approach to r...

In this paper, we investigate cumulated clauses on a set of attributes consisting of concept descriptions of the description logic FLE . This kind of expression is useful for describing the attribute logic of contexts where the attributes can be seen as FLE concept descriptions. We provide a deduction calculus for this type of expressions and prove its soundness and completeness.

Financial reports are a form of information published by companies to meet the needs investors that describe how much company's wealth, income earned company, as well about achievements. Apart from being for investors, financial can also be reference make decisions and predict what will happen in future. After having reports, next activity is evaluate performance, namely analyzing statements. T...

In this paper we present a sound and complete Structural Operational Semantics (SOS) for non-distributed deterministic Abstract State Machines (ASMs). Since ASMs exhibit both sequential and parallel features, the semantics is structured into two layers. One layer describes the parallel execution of updates, the other layer describes the sequential execution of rules. The semantics has some nice...

The theory of partial inductive definitions is a mathematical formalism which has proved to be useful in a number of different applications. The fundamentals of the theory is shortly described. Partial inductive definitions and their associated calculi are essentially infinitary. To implement them on a computer, they must be given a formal finitary representation. We present such a finitary rep...