8.30-9.45 |
Registration | ||||||||||||||

9.45-10.15 |
Opening | ||||||||||||||

10.15-11.00 |
CiE: 10 years | ||||||||||||||

11.00-11.30 |
Coffee break | ||||||||||||||

11:30-12.30 |
Logic and Automata |
||||||||||||||

12.30-14.00 |
Lunch | ||||||||||||||

Special Sessions |
|||||||||||||||

Room A |
Room B |
Room C |
|||||||||||||

Computational Linguistics | Complexity in Automata Theory | History and Philosophy of Computing | |||||||||||||

14.00-14.45 |
Constraint Logic Programming for Resolution of Relative Time Expressions |
Complexity of Operation Problems |
Early Machine Transition: integration and transfers betweencomputing and the language sciences |
||||||||||||

14.45-15.30 |
How can Grammatical Inference Contribute to Computational Linguistics? |
Predicate Characterizations in the Polynomial-Size Hierarchy |
Pluralism Ignored |
||||||||||||

15.30-16.00 |
Coffee break | ||||||||||||||

16.00-17.00 |
Sequential Theories |
||||||||||||||

17.00-17.15 |
Break | ||||||||||||||

Contributed talks |
|||||||||||||||

Room A |
Room B |
Room C |
Room D |
Room E |
|||||||||||

17.15-17.40 |
V. Padmavati Metta and A. KelemenovaParallel Spiking Neural P Systems with Anti-Spikes |
F. Gobbo and H. DurnováFrom Universal to Programming Languages: the Legacy of Universal Languages in the Foundation of Computability |
G. Dodig CrnkovicModeling Life as Cognitive Info-Computation |
U. Berger and Tie HouUniform Schemata for Proof Rules |
|||||||||||

17.45-18.10 |
S. Beretta and R. Dondi Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability |
U. Čibej, B. Robič and J. Mihelič Empirical estimation of the halting probabilities |
D. D'Alfonso Recursion: complexity from computation to cognition |
A. SoskovaJoint spectra and Relative spectra of sequence of structures |
A. SarievDefinability of 0' in the structure of the ω-enumeration degrees |
||||||||||

18.15-18.40 |
J. PosfaiAssessing the contributions of intrinsic and extrinsic factors to the establishment of brain functions |
G. Primiero and F. RaimondiA typed natural deduction calculus to reason about secure messaging with trust |
J. Davidson and G. Michaelson Models and Modalities |
A. Facchini and H. MichalewskiDeciding the Borel complexity of regular tree languages |
J. H. Lutz and N. LutzLines Missing Every Random Point |
||||||||||

18.45-19.00 |
Break | ||||||||||||||

19.00-21.00 |
Welcome Party |