228 search results - page 6 / 46 » Two Normal Forms for Rewriting P Systems |
152
Voted
RTA
2004
Springer
15 years 9 months ago
2004
Springer
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
116
Voted
SYNASC
2005
IEEE
15 years 9 months ago
2005
IEEE
We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursivel...
135
Voted
ICA3PP
2007
Springer
15 years 9 months ago
2007
Springer
Classification is a kind of basic semantics that people often use to manage versatile contents in daily life. Resource Space Model (RSM) is a semantic model for sharing and managin...
127
Voted
EPIA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The two puzzles are the Lottery Paradox and the Amalgamation Paradox, which both point out difficulties for aggregating uncertain information. A generalization of the lot...
126
Voted
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
When enriching the λ-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (∨ E) of union typ...