Accepted contributions

Papers accepted for LNCS proceedings

  1. Klaus Ambos-Spies, Ulrike Brandt and Martin Ziegler. Real Benefit of Promises and Advice
  2. John Case and Michael Ralston. Beyond Rogers’ Non-Constructively Computable Function
  3. Julien Cervelle. Constructing continuous systems from discrete cellular automata
  4. Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic and Ugo Vaccaro. Latency-Bounded Target Set Selection in Social Networks
  5. Riccardo Dondi and Nadia El-Mabrouk. Aligning and Labeling Genomes Under the Duplication-Loss Model
  6. Thomas Dueholm Hansen and Rasmus Ibsen-Jensen. The complexity of interior point methods for solving discounted turn-based stochastic games
  7. Johanna N.Y. Franklin, Asher M. Kach, Russell Miller and Reed Solomon. Local Computability for Ordinals
  8. Makoto Fujiwara and Keita Yokoyama. A note on the strength of sequential version of \Pi^1_2 statements
  9. Ziyuan Gao, Sanjay Jain and Frank Stephan. On conservative learning of recursively enumerable languages
  10. Anthony Gasperin. Topology of Asymptotic Cones and Non-Deterministic Polynomial Time Computations
  11. Alexander Gavruskin and Bakhadyr Khoussainov. On decidable and computable models of theories
  12. Pawel Gawrychowski, Florin Manea and Dirk Nowotka. Discovering Hidden Repetitions in Words
  13. Daniela Genova. Language Forbidding-Enforcing Systems Defining DNA Codewords
  14. Miha Habič. Cardinal-Recognizing Infinite Time Turing Machines
  15. Alexander Kartzow and Philipp Schlicht. Structures without Scattered-Automatic Presentations
  16. Krishna S, Marian Gheorghe and Ciprian Dragomir. Some Classes of Generalised Communicating P Systems and Simple Kernel P Systems
  17. Stephane Le Roux and Arno Pauly. Closed choice for finite and for convex sets
  18. Robert Lubarsky and Michael Rathjen. Realizability Models Separating Various Fan Theorems
  19. Alexander G. Melnikov and Andre Nies. The classification problem for compact computable metric spaces
  20. Giovanni Pardini, Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo and Simone Tini. A Compositional Semantics of Reaction Systems with Restriction
  21. Mikhail Peretyatkin. The Tarski-Lindenbaum algebra of the class of all strongly constructivizable countable saturated models
  22. Nicolas de Rugy-Altherre. Determinant versus Permanent: salvation via generalization?
  23. Benjamin Seyfferth and Tim Fischbach. On \lambda-definable functions on ordinals
  24. Ivan Soskov. A note on \omega-jump inversion of degree spectra of structures
  25. Alexey Stukachev. On Processes and Structures
  26. Stefan Vatev. Another Jump Inversion Theorem for Structures

Contributions accepted for presentation

  1. Stefania Costantini and Federico Gobbo. A History of Autonomous Agents: from Thinking Machines to Machines for Thinking
  2. Takayuki Kihara and Kenshi Miyabe. Lowness for uniform Kurtz randomness
  3. Clayton Peterson. Formal Philosophy and Legal Reasoning: The validity of legal inferences
  4. Giuseppe Primiero. A Modal Type System for Error Handling
  5. Nikhil Balaji and Samir Datta. Collapsing Exact Arithmetic Hierarchies
  6. Anderson De Araújo. Incomputability in quantum systems
  7. Alexander Gavruskin, Sanjay Jain, Bakhadyr Khoussainov and Frank Stephan. Graphs realised by r.e. equivalence relations
  8. Mike Domaratzki and Ryan Zier-Vogel. RNA pseudoknot prediction through stochastic conjunctive grammars
  9. Luca Crociani, Lorenza Manenti, Giuseppe Vizzari and Stefania Bandini. Modelling Social Interactions in Crowds of Pedestrians
  10. Alla Sirokofskich. Decidability and the multiplicative structure of positive rationals together with the `greatest common divisor’
  11. Sam Sanders. The double negation translation in Nonstandard Constructive Analysis
  12. Joseph Davidson and Greg Michaelson. Brute Force is not Ignorance
  13. Slimane Bellaouar, Hadda Cherroun and Djelloul Ziadi. Efficient Computation of the Gap-Weighted Subsequence Kernel
  14. Mathilde Noual and Sylvain Sené. Sensitivity to Synchronism of Boolean Automata Networks
  15. Arthur Milchior. Undecidability of satisfiability of expansion of \FO[<] with a Semilinear Non Regular Predicate over words.
  16. Mustafa Demirci. An Extended Fundamental Duality of Partially Ordered Sets and Its Applications
  17. Barry Richards. Artificial Intelligence: Beyond Turing’s legacy
  18. Shibashis Guha, Krishna S, Chinmay Narayan and S. Arun-Kumar. A Unifying Approach to Decide Timed Relations for Timed Automata and their Game Characterization
  19. Bernard Molyneux. Passive Computation and the Power of Inactivity: How to Get a Brain to Compute without Firing its Neurons
  20. Paolo Bottoni and Anna Labella. Reaction systems with constrained environment
  21. Giovanni Di Crescenzo. Non-Interactive Extractability Assumptions
  22. Yen Hung Chen. The Bottleneck Selected-Internal Steiner Tree Problem: Hardness and Approximation
  23. Tamás Mihálydeák and Zoltán Ernő Csajbók. A Species Distribution Framework Relying on Membrane Computing with Boundaries
  24. Kenichiro Shimura, Stefania Bandini and Katsuhiro Nishinari. Modelling and Analysis of the Spiral Motion of Pedestrians via Cellular Automata
  25. Frank Faries. Toward a Unified View of Computation in Neural Systems: A Reply to Shagrir and Piccinini
  26. Joaquín Díaz Boils and José Pedro Úbeda Rives. A Kripke Model for Subrecursion.
  27. Alessia Visconti, Roberto Esposito, Raffaele A. Calogero and Francesca Cordero. An integrated approach for pharmacogene discovery
  28. Merlin Carl. Towards a Church-Turing-Thesis for Infinitary Computations
  29. Mario Rasetti and Emanuela Merelli. Quantum Information, Topology, Formal Languages: a categorical view
  30. Giuseppe Sergioli and Roberto Leporini. Interpreting knowledge by Quantum Channels
  31. Ujjal Marjit. Aggregated Similarity Optimization in Ontology Alignment through Multiobjective Particle Swarm Optimization
  32. Velislava Stoykova. Formal Representations of Pronouns Using Universal Networking Language
  33. Guido Fiorino. How to reduce backtracking in propositional intuitionistic logic
  34. Shira Zucker. The d-distance anticoloring Problem
  35. Mark Burgin and Gordana Dodig Crnkovic. The Nature of Computation and The Development of Computational Models
  36. Pierre Guillon and Charalampos Zinoviadis. Hierarchy and Expansiveness
  37. Paulin Jacobé De Naurois. Petri Nets With Split/Join Transitions: A Covering Theorem
  38. Petrica Pop and Oliviu Matei. A Memetic Algorithm for Solving the Generalized Vehicle Routing Problem

Abstracts accepted for presentation

  1. Pieter Adriaans and Amos Golan. On Information Conservation and Algorithmic Complexity
  2. Stephanie Dick. Following Mathematics into the Digital: A Historical Exploration of as Early Automated Theorem Proving Program
  3. Alessandro Facchini and Paula Quinon. Two Roles of Logic in Computer Science
  4. Vladimir Aristov and Andrey Stroganov. Constructing solutions for systems of nonlinear differential equations using method of computer analogy
  5. Imran Khaliq and Gulshad Imran. Constructing Strategies in a Subclass of Muller Games
  6. Katie Barr and Viv Kendon. Formal languages analysed by quantum walks
  7. Ella Gale, Ben Costello and Andy Adamatzky. The Use of Memristors in Nature-Inspired Computation
  8. Luca Bellotti. Turing machines and predictability
  9. Roohola Ramzani. Through Divergent Norms: Satisfying a Realistic Model of Rationality
  10. Anahit Chubaryan and Armen Mnatsakanyan. On some new propositional proof systems
  11. Andrey Sariev and Hristo Ganchev. Definability in the local theory of the $\omega$-enumeration degrees
  12. Paola Zizzi and Eliano Pessa. Quantum computation on the fuzzy sphere
  13. Frank Coyle. Computation, A Process-Based Perspective
  14. Jason Rute. Schnorr randomness for noncomputable measures
  15. Juliana Silva Bernardes, Gerson Zaverucha, Catherine Vaquero and Alessandra Carbone. Combining multiple evolutionary models and machine learning for protein domain identification
  16. Alberto Marcone. Reverse Mathematics of posets: decomposing initial intervals
  17. Emanuele Frittaion. Reverse Mathematics of posets: counting initial intervals
  18. Marcin J. Schroeder. The Nature of Natural Computation: Dynamics of Autonomous Natural Information Systems
  19. Santiago Hernández Orozco, Francisco Hernández Quiroz and Hector Zenil. Sparse Distribution of Proving Speed-up in Random Systems of Propositional Calculus.
  20. Anna Bernasconi, Valentina Ciriani, Gabriella Trucco and Tiziano Villa. Compact Representation of Logic Functions using Boolean Relations
  21. Mitko  Yanchev. Part restrictions in Description Logics with union and counting
  22. Torben Braüner. Hybrid-Logical Proofs: With an Application to False-Belief Tasks
  23. Andrew Chester, Riccardo Dondi and Anthony Wirth. Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs
  24. Keita Yokoyama. On the strength of Ramsey’s theorem without Sigma_1-induction
  25. Kojiro Higuchi. Minimal Essential Undecidability of Theories of Concatenations
  26. David Gamez. Are there Computational Correlates of Consciousness in the Brain?
  27. Elvira Mayordomo. Effective dimension in general metric spaces and applications
  28. Marat Nurizinov and Rustem Tyulyubergenev. On computable subgroups of the group of all unitriangular matrices over a ring
  29. Edgar Daylight. Programming in the 1950s in 5 Pictures
  30. Naohi Eguchi. Characterising Complexity Classes by Inductive Definitions in Bounded Arithmetic
  31. Eyvind Martol Briseid. Extracting computational content from proofs in nonstandard analysis
  32. Dan Hernest and Trifon Trifonov. Light modal Dialectica interpretation
  33. Laurent Bienvenu and Christopher Porter. Strong Difference Randomness
  34. Benjamin Rin. On Set-Theoretic and Transfinite Analogues of Epistemic Arithmetic and Flagg Consistency
  35. Alexey Stukachev. On some properties of $s\Sigma$-reducibility
  36. Yiqi Deng and Peter J. Bentley. Dynamic Learning based on an Artificial Immune System using Systemic Computation
  37. Alan Perotti, Guido Boella and Artur D’Avila Garcez. Combining Runtime Verification and Property Adaptation through Neural-Symbolic Integration
  38. Antoine Taveneaux, Laurent Bienvenu and Christopher Porter. Randomized algorithms to compute completions of Peano arithmetic.
  39. Akitoshi Kawamura and Kenshi Miyabe. Polynomial-time randomness and
  40. Paola Bonizzoni, Anna Paola Carrieri, Gianluca Della Vedova, Riccardo Dondi and Gabriella Trucco. Graph based reconstruction of the Persistent Perfect Phylogeny
  41. Jeroen Van der Meeren. Ordinal and Proof-theoretical Strength of Tree-like Structures with Friedman-style Gap Condition
  42. Andrew Marks. Uniformity and degree invariant constructions
  43. Helena Durnova. Fault-tolerance as the most important feature of SAPO and EPOS computers
  44. Rudolf Freund. Control Mechanisms and the Number of Catalysts Needed for Computational Completeness in (Purely) Catalytic P Systems
  45. Ludovic Patey, Laurent Bienvenu and Paul Shafer. Rainbow Ramsey theorem for

CiE2013 Policy

For each accepted contribution (paper appearing in the LNCS proceedings, or contribution accepted for presentation) at least one of the authors must register and attend the conference to present the work, otherwise the paper will not be included in the conference program and the conference proceedings.