We treat the smallest normal modal propositional logic with two modal operators 2 and 2+. While 2 is interpreted in Kripke models by the accessibility relation R, 2+ is interpreted by the transitive closure of R. Intuitively the formula 2+φ means the infinite conjunction 2φ ∧ 22φ ∧ 222φ ∧ · · · . There is a Hilbert style axiomatization of this logic (a characteristic axiom is 2φ ∧ 2+(φ → 2φ) → ...

We present a system for textual inference (the task of inferring whether a sentence follows from another text) that uses learning and a logical-formula semantic representation of the text. More precisely, our system begins by parsing and then transforming sentences into a logical formula-like representation similar to the one used by (Harabagiu et al., 2000). An abductive theorem prover then tr...

translation is an active process in which a meaning is transferred from a source to a target language. during this process, meaning must have accordance with two main semantic sub-systems: signification and evaluation. signification is related to a signified unit of a linguistic sign and its encompassing properties known as seme. however, evaluation includes a range of different actualizations ...

This special issue on Formal Models of Awareness contains five papers that concentrate on different approaches to the notion of awareness. They include syntactic and semantic approaches to modelling awareness (awareness of formulas as opposed to awareness of semantic objects such as sets of possoble worlds) and an alternative view from the multi-agent systems perspective where awareness is iden...

In this work we tackle the problem of checking strong equivalence of logic programs that may contain local auxiliary atoms, to be removed from their stable models and to be forbidden in any external context. We call this property projective strong equivalence (PSE). It has been recently proved that not any logic program containing auxiliary atoms can be reformulated, under PSE, as another logic...

In this work, we aim to define a resolution method for the modal logic S5. We first propose a conjunctive normal form (S5-CNF) which is mainly based on using labels referring to semantic worlds. In a sense, S5-CNF can be seen as a generalization of the conjunctive normal form in propositional logic by including the modal connective of necessity and labels in the clause structure. We show that e...

As part of a framework for a multimodal mathematical formula editor which will support natural speech and handwriting interaction, a single stage speech understanding module is presented. It is based on a multilevel statistical, expectation driven approach. Completely spoken realistic formulas containing basic arithmetic operations, roots, indexed sums, integrals, trigonometric functions, logar...

Visually impaired people, face many problems to communicate and to study electronical scientific documents especially those containing mathematics expressions. To provide solutions in this topic, we propose an assistive system to help blind people to categorize mathematical formulas from electronical documents. The system acts on four steps: first the translation of query math formula into Pres...

Introduction The completeness of the classical propositional calculus allows us to give a deductive system consisting of finitely many axiom schemas and finitely many rules of inference, that permit us to pass from a formula or a pair of formulae to a syntactically related formula, in such a manner that the formulae obtained inductively from the axioms by repeated application of the rules are e...

this study investigated the effect of using visual aids, semantic elaboration, and visual aids plus semantic elaboration on the iranian efl learners' vocabulary learning. to conduct the study, the researchers assigned 49 elementary learners to three homogeneous groups according to their proficiency level. then, a pre-test of paribakht and wesche's vocabulary knowledge scale was given ...