Sciweavers

2501 search results - page 234 / 501
» Logics with Rank Operators
Sort
View
LICS
2002
IEEE
15 years 11 months ago
Linearity in Process Languages
The meaning and mathematical consequences of linearity (managing without a presumed ability to copy) are studied for a path-based model of processes which is also a model of affi...
Mikkel Nygaard, Glynn Winskel
LICS
1994
IEEE
15 years 10 months ago
McColm's Conjecture
Gregory McColm conjectured that positive elementary inductions are bounded in a class K of nite structures if every (FO + LFP) formula is equivalent to a rst-order formula in K. H...
Yuri Gurevich, Neil Immerman, Saharon Shelah
APSEC
2003
IEEE
15 years 10 months ago
Modular refinement in novel schema calculi
Using the language Z for more than specification is hindered by the fact that its algebra of schemas is not monotonic with respect to refinement; so specification is modular, but ...
Moshe Deutsch, Martin C. Henson, Besnik Kajtazi
DLT
1993
15 years 7 months ago
Rewriting Extended Regular Expressions
We concider an extened algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotoni...
Valentin M. Antimirov, Peter D. Mosses
CORR
2011
Springer
170views Education» more  CORR 2011»
15 years 1 months ago
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates, as well as Boolean operations on regions, interpreted over low-...
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann,...