Contributed Papers

The following submitted papers have been accepted for presentation:

1) D. Bastiras, The logic of Herakleitos and the law of non-contradiction.

2) N. Demetriou and A. Kakas, Argumentation with abduction.

3) R. Diaconescu and P. Stefaneas, Modality in open institutions with concrete syntax.

4) T. Dimitriou, On SAT distributions with planted assignments.

5) E. Foustoucos and I. Guessarian, Complexity of monadic INF-DATALOG. Application to temporal logic.

6) S. Gerogiorgakis, A contribution to the influences of the Diodorean modalities from the middle ages to the present.

7) S. Ghilezan and S. Likavec, Extensions of the reducibility method.

8) A. Kaporis and E. Lalas, Lower bounds to the conjectured threshhold value for the 3-SAT problem.

9) G. Kapoulas, Infinitesimals via the cofinite filter.

10) D. Kavvadias and E. Stavropoulos, An algorithm for generating all maximal models of Boolean expressions.

11) M. Kurilic and A. Pavlovic, An application of "Back and Forth" and PFA in topology.

12) S. Nikoletseas, V. Papadopoulou and P. Spirakis, Radiocoloring graphs via the probabilistic method.

13) N. Papaspyrou, D. Vytiniotis and V. Koutavas, Logic-enhanced type systems: Programming language support for reasoning about security and other program properties.

14) T. Pheidas and X. Vidaux, Extensions of Büchi's problem: Questions of decidability for addition and n-th powers.

15) G. Popa, The boundary crossing theorem.

16) N. Rigas, Conditionally partial lambda models and strong normalization.

17) P. Rondogiannis and W. Wadge, A model intersection theorem for logic programming with negation-as-failure.

18) B. Sobot, Ultraproducts of trees.

19) A. Soskova, Cospectra of joint spectra of a sequence of structures.

20) V. Sotirov, Leibnitz style arithmetization of some logical systems.

21) S. Zachos and A. Pagourtzis, Combinatory complexity: Operators on complexity classes.

22) A. Zinoviev, ITL as a language of regular relations.