Confirmed presentations

The current CiE policy is that all presentation must be allocated the same time. Therefore the Conference chairs and the Organizing Committee can only give 20 minutes for each presentation (and 5 minutes for possible questions).

  1. Akitoshi Kawamura and Kenshi Miyabe. Polynomial-time randomness and differentiability
  2. Alan Perotti, Guido Boella and Artur D’Avila Garcez. Combining Runtime Verification and Property Adaptation through Neural-Symbolic Integration
  3. Alberto Marcone. Reverse Mathematics of posets: decomposing initial intervals
  4. Alessandro Facchini and Paula Quinon. Two Roles of Logic in Computer Science
  5. Alexander Gavruskin and Bakhadyr Khoussainov. On decidable and computable models of theories
  6. Alexander Gavruskin, Sanjay Jain, Bakhadyr Khoussainov and Frank Stephan. Graphs realised by r.e. equivalence relations
  7. Alexander G. Melnikov and Andre Nies. The classification problem for compact computable metric spaces
  8. Alexander Kartzow and Philipp Schlicht. Structures without Scattered-Automatic Presentations
  9. Alexey Stukachev. On Processes and Structures
  10. Alexey Stukachev. On some properties of s\Sigma-reducibility
  11. Alla Sirokofskich. Decidability and the multiplicative structure of positive rationals together with the `greatest common divisor’
  12. Anahit Chubaryan and Armen Mnatsakanyan. On some new propositional proof systems
  13. Andrew Chester, Riccardo Dondi and Anthony Wirth. Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs
  14. Andrew Marks. Uniformity and degree invariant constructions
  15. Andrey Sariev and Hristo Ganchev. Definability in the local theory of the \omega-enumeration degrees
  16. Anna Bernasconi, Valentina Ciriani, Gabriella Trucco and Tiziano Villa. Compact Representation of Logic Functions using Boolean Relations
  17. Anthony Gasperin. Topology of Asymptotic Cones and Non-Deterministic Polynomial Time Computations
  18. Antoine Taveneaux, Laurent Bienvenu and Christopher Porter. Randomized algorithms to compute completions of Peano arithmetic.
  19. Arthur Milchior. Undecidability of satisfiability of expansion of FO[<] with a Semilinear Non Regular Predicate over words.
  20. Benjamin Rin. On Set-Theoretic and Transfinite Analogues of Epistemic Arithmetic and Flagg Consistency
  21. Benjamin Seyfferth and Tim Fischbach. On \lambda-definable functions on ordinals
  22. Bernard Molyneux. Passive Computation and the Power of Inactivity: How to Get a Brain to Compute without Firing its Neurons
  23. Clayton Peterson. Formal Philosophy and Legal Reasoning: The validity of legal inferences
  24. Dan Hernest and Trifon Trifonov. Light modal Dialectica interpretation
  25. Daniela Genova. Language Forbidding-Enforcing Systems Defining DNA Codewords
  26. David Gamez. Are there Computational Correlates of Consciousness in the Brain?
  27. Edgar Daylight. Programming in the 1950s in 5 Pictures
  28. Ella Gale, Ben Costello and Andy Adamatzky. The Use of Memristors in Nature-Inspired Computation
  29. Elvira Mayordomo. Effective dimension in general metric spaces and applications
  30. Emanuele Frittaion. Reverse Mathematics of posets: counting initial intervals
  31. Eyvind Martol Briseid. Extracting computational content from proofs in nonstandard analysis
  32. Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic and Ugo Vaccaro. Latency-Bounded Target Set Selection in Social Networks
  33. Frank Coyle. Computation, A Process-Based Perspective
  34. Giovanni Pardini, Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo and Simone Tini. A Compositional Semantics of Reaction Systems with Restriction
  35. Giuseppe Primiero. A Modal Type System for Error Handling
  36. Guido Fiorino. How to reduce backtracking in propositional intuitionistic logic
  37. Helena Durnova. Fault-tolerance as the most important feature of SAPO and EPOS computers
  38. Imran Khaliq and Gulshad Imran. Constructing Strategies in a Subclass of Muller Games
  39. Ivan Soskov. A note on \omega-jump inversion of degree spectra of structures
  40. Jason Rute. Schnorr randomness for noncomputable measures
  41. Jeroen Van der Meeren. Ordinal and Proof-theoretical Strength of Tree-like Structures with Friedman-style Gap Condition
  42. Joaquín Díaz Boils and José Pedro Úbeda Rives. A Kripke Model for Subrecursion.
  43. Johanna N.Y. Franklin, Asher M. Kach, Russell Miller and Reed Solomon. Local Computability for Ordinals
  44. John Case and Michael Ralston. Beyond Rogers’ Non-Constructively Computable Function
  45. Joseph Davidson and Greg Michaelson. Brute Force is not Ignorance
  46. Juliana Silva Bernardes, Gerson Zaverucha, Catherine Vaquero and Alessandra Carbone. Combining multiple evolutionary models and machine learning for protein domain identification
  47. Julien Cervelle. Constructing continuous systems from discrete cellular automata
  48. Katie Barr and Viv Kendon. Formal languages analysed by quantum walks
  49. Keita Yokoyama. On the strength of Ramsey’s theorem without \Sigma_1-induction
  50. Klaus Ambos-Spies, Ulrike Brandt and Martin Ziegler. Real Benefit of Promises and Advice
  51. Kojiro Higuchi. Minimal Essential Undecidability of Theories of Concatenations
  52. Krishna S, Marian Gheorghe and Ciprian Dragomir. Some Classes of Generalised Communicating P Systems and Simple Kernel P Systems
  53. Laurent Bienvenu and Christopher Porter. Strong Difference Randomness
  54. Luca Bellotti. Turing machines and predictability
  55. Ludovic Patey, Laurent Bienvenu and Paul Shafer. Rainbow Ramsey theorem for pairs
  56. Makoto Fujiwara and Keita Yokoyama. A note on the strength of sequential version of \Pi^1_2 statements
  57. Marat Nurizinov and Rustem Tyulyubergenev. On computable subgroups of the group of all unitriangular matrices over a ring
  58. Mark Burgin and Gordana Dodig Crnkovic. The Nature of Computation and The Development of Computational Models
  59. Merlin Carl. Towards a Church-Turing-Thesis for Infinitary Computations
  60. Miha Habič. Cardinal-Recognizing Infinite Time Turing Machines
  61. Mike Domaratzki and Ryan Zier-Vogel. RNA pseudoknot prediction through stochastic conjunctive grammars
  62. Mikhail Peretyatkin. The Tarski-Lindenbaum algebra of the class of all strongly constructivizable countable saturated models
  63. Mitko Yanchev. Part restrictions in Description Logics with union and counting
  64. Mustafa Demirci. An Extended Fundamental Duality of Partially Ordered Sets and Its Applications
  65. Naohi Eguchi. Characterising Complexity Classes by Inductive Definitions in Bounded Arithmetic
  66. Nicolas de Rugy-Altherre. Determinant versus Permanent: salvation via generalization?
  67. Paola Bonizzoni, Anna Paola Carrieri, Gianluca Della Vedova, Riccardo Dondi and Gabriella Trucco. Graph based reconstruction of the Persistent Perfect Phylogeny
  68. Paola Zizzi and Eliano Pessa. Quantum computation on the fuzzy sphere
  69. Paolo Bottoni and Anna Labella. Reaction systems with constrained environment
  70. Paulin Jacobé De Naurois. Vector Addition Systems With Split/Join Transitions: A Covering Theorem
  71. Pawel Gawrychowski, Florin Manea and Dirk Nowotka. Discovering Hidden Repetitions in Words
  72. Petrica Pop and Oliviu Matei. A Memetic Algorithm for Solving the Generalized Vehicle Routing Problem
  73. Riccardo Dondi and Nadia El-Mabrouk. Aligning and Labeling Genomes Under the Duplication-Loss Model
  74. Robert Lubarsky and Michael Rathjen. Realizability Models Separating Various Fan Theorems
  75. Roohola Ramzani. Through Divergent Norms: Satisfying a Realistic Model of Rationality
  76. Rudolf Freund. Control Mechanisms and the Number of Catalysts Needed for Computational Completeness in (Purely) Catalytic P Systems
  77. Sam Sanders. The double negation translation in Nonstandard Constructive Analysis
  78. Santiago Hernández Orozco, Francisco Hernández Quiroz and Hector Zenil. Sparse Distribution of Proving Speed-up in Random Systems of Propositional Calculus.
  79. Shibashis Guha, Krishna S, Chinmay Narayan and S. Arun-Kumar. A Unifying Approach to Decide Timed Relations for Timed Automata and their Game Characterization
  80. Shira Zucker. The d-distance anticoloring Problem
  81. Slimane Bellaouar, Hadda Cherroun and Djelloul Ziadi. Efficient Computation of the Gap-Weighted Subsequence Kernel
  82. Stefania Costantini and Federico Gobbo. A History of Autonomous Agents: from Thinking Machines to Machines for Thinking
  83. Stefan Vatev. Another Jump Inversion Theorem for Structures
  84. Stephane Le Roux and Arno Pauly. Closed choice for finite and for convex sets
  85. Stephanie Dick. Following Mathematics into the Digital: A Historical Exploration of as Early Automated Theorem Proving Program
  86. Takayuki Kihara and Kenshi Miyabe. Lowness for uniform Kurtz randomness
  87. Tamás Mihálydeák and Zoltán Ernő Csajbók. A Species Distribution Framework Relying on Membrane Computing with Boundaries
  88. Thomas Dueholm Hansen and Rasmus Ibsen-Jensen. The complexity of interior point methods for solving discounted turn-based stochastic games
  89. Torben Braüner. Hybrid-Logical Proofs: With an Application to False-Belief Tasks
  90. Velislava Stoykova. Formal Representations of Pronouns Using Universal Networking Language
  91. Yen Hung Chen. The Bottleneck Selected-Internal Steiner Tree Problem: Hardness and Approximation
  92. Yiqi Deng and Peter J. Bentley. Dynamic Learning based on an Artificial Immune System using Systemic Computation
  93. Ziyuan Gao, Sanjay Jain and Frank Stephan. On conservative learning of recursively enumerable languages