𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the consistency problem for the calculus

✍ Scribed by Philippe Balbiani; Jean-François Condotta; Gérard Ligozat

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
304 KB
Volume
4
Category
Article
ISSN
1570-8683

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we further investigate the consistency problem for the qualitative temporal calculus IN DU introduced by Pujari et al. [A.K. Pujari, G.V. Kumari, A. Sattar, INDU: An interval and duration network,

📜 SIMILAR VOLUMES

On the consistency of the mass transfer
On the consistency of the mass transfer problem
✍ Juan González-Hernández; J. Rigoberto Gabriel 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 161 KB

Conditions are given under which the Monge-Kantorovich mass transfer problem on general metric spaces and with unbounded cost function has a feasible solution.

The basis decision problem in λ-calculus
The basis decision problem in λ-calculus
✍ Benedetto Intrigila 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

## Abstract We show that the problem of deciding if a finite set of closed terms in normal form is a basis is recursively unsolvable. The restricted problem concerning one element sets is still recursively unsolvable. MSC: 03B40, 03D35.

A Functional Calculus on the Heisenberg
A Functional Calculus on the Heisenberg Group and the Boundary Layer Potential □−1+for the ∂-Neumann Problem
✍ Richard Beals; Peter C. Greiner; Yaping Jiang; Luis Seco 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 283 KB

There are two natural commuting self-adjoint operators in the enveloping algebra of the Heisenberg group: the Heisenberg sublaplacian 2 H and the central element T=&i  t. The joint spectral theory of these operators is investigated by means of the Laguerre calculus. Explicit convolution kernels are

Decidability of the consistency problem
Decidability of the consistency problem for regular symbolic picture description languages
✍ G. Costagliola; V. Deufemia; F. Ferrucci; C. Gravino 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 86 KB

In the paper we address the consistency problem for drawn symbolic picture grammars. In particular we prove that it is always possible to decide whether or not a regular grammar generates only consistent descriptions of drawn symbolic pictures.