Logical analysis of natural language allows to extract semantic relations that are not revealed for standard full text search methods. Intensional logic systems, such as the Transparent Intensional Logic (TIL), can rigorously describe even the higher-order relations between the speaker and the content or meaning of the discourse. In this paper, we concentrate on the mechanism of logical analysi...

In this paper, logical operators are used for analyzing texture properties and an algorithm is presented for texture image classification. Operators constructed from logical building blocks are convolved with texture images. An optimal set of six operators are selected based on their texture discrimination ability. The responses are then converted to standard deviation matrices computed over a ...

This paper presents a qualitative approach to logical structure recognition of library references. The system is driven by a generic model of a reference class and by an OCR flow, given in SGML format, that include ASCII code of the characters and information about the typographic style and the lexical affiliation of words. The approach used is based on hypotheses production and verification ab...

Learning from examples is a frequently arising challenge, with a large number of algorithmsproposed in the classification and data mining literature. The evaluation of the quality ofsuch algorithms is usually carried out ex post, on an experimental basis: their performanceis measured either by cross validation on benchmark data sets, or by clinical trials. None ofthese approache...

Logical scaling is a new method to transform data matrices which are based on object-attribute-value-relationships into data matrices from which conceptual hierarchies can be explored. The derivation of concept lattices is determined by terminologies expressed in a formal-logical language.

One of the main aims of logical analysis of natural language expressions lies in the task to capture the meaning structures independently on the selected “mean of transport,” i.e. on a particular natural language used. Logical analysis should just offer a “bridge between language expressions.” In this paper, we show the preliminary results of automated bilingual logical analysis, namely the ana...

A logical framework is presented for representing and reasoning about nondeterministic programs that may not terminate. We propose a logic PDL(; ;, ||, d(∗)) which is an extension of dynamic logic such that the program constructors related to demonic operations are introduced in its language. A complete and sound Hilbert-style proof system is given and it is shown that PDL(; ;, ||, d(∗)) is dec...

Here we outline an approach to a logical analysis of relativity theory conducted purely in first order logic (for methodological reasons). Here we concentrate on special relativity, but in a more extensive work referred to here as [2], some steps are made in the direction of generalizing the present approach towards general relativity. In [2] we build up variants of relativity theory as “compet...

The legal concept of burden of proof is notoriously complex and ambiguous. Various kinds of burdens of proof have been distinguished, such as the burden of persuasion, burden of production and tactical burden of proof, and these notions have been described by different scholars in different ways. They have also been linked in various ways with notions like presumptions, standards of proof, and ...