-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 WoLLIC 2010 - 17th Workshop on Logic, Language, Information and Computation (http://wollic10.cic.unb.br/)
July 6th to 9th, 2010 - Brasília, Brazil REGISTRATION: Now open at http://wollic10.cic.unb.br/?pagina=registration.html (Early registration discounts apply until May 28th.) PROGRAMME WoLLIC 2010 Preliminary Programme Tuesday, 6 July 09.00 Michiel van Lambalgen (University of Amsterdam) Tutorial: Probabilistic reasoning is non-monotonic, but not all non-monotonic reasoning can be represented in probability theory - Part 1 10:00 Coffee-break 10.30 Michiel van Lambalgen (University of Amsterdam) Tutorial: Probabilistic reasoning is non-monotonic, but not all non-monotonic reasoning can be represented in probability theory - Part 2 11:30 Short break 11.40 Sebastiaan Terwijn (Radboud University Nijmegen ) Tutorial 1: Intuitionistic Logic 12.40 Lunch 14.00 Marcelo Finger (IME /University of São Paulo) Tutorial: Satisfiability and Probabilistic Satisfiability - Part 1 15.00 Short break 15.10 Marcelo Finger (IME /University of São Paulo) Tutorial: Satisfiability and Probabilistic Satisfiability - Part 2 16.10 Coffee-break 16.40 Johann Makowsky (Technion - Israel Institute of Technology) Tutorial: Two lectures on the model theory of graph polynomials Why is the chromatic polynomial a polynomial? - Part 1 17.40 close Wednesday, 7 July 09.00 Sebastiaan Terwijn (Radboud University Nijmegen ) Tutorial 2: Computability Theory 10:00 Coffee-break 10.30 Johann Makowsky (Technion - Israel Institute of Technology) Tutorial: Two lectures on the model theory of graph polynomials Intriguing questions about graph polynomials - Part 2 11.30 Sven Hartmann and Thu Trinh (Clausthal University of Technology) Solving the Implication Problem for XML Functional Dependencies with Properties 12.00 Naeem Abbasi, Osman Hasan and Sofiene Tahar (Concordia University) Formal Lifetime Reliability Analysis Using Continuous Random Variables 12.30 Lunch 14.00 Marcelo Finger (IME /University of São Paulo) Algebraic Multipliers: a New Characterization of Validity for Classical and Many-Valued Logics 15.00 Andréia B. Avelar, Flavio de Moura, André Luiz Galdino and Mauricio Ayala-Rincon (University of Brasília) Verification of The Completeness of Unification Algorithms à la Robinson 15.30 Coffee-break 16.00 Cesare Tinelli (University of Iowa) Foundations of Satisfiability Modulo Theories 17.00 Aditi Barthwal and Michael Norrish (Australian National University) Mechanisation of PDA and Grammar Equivalence for Context-Free Languages 17.30 close Thursday, 8 July 09.00 Ian Pratt-Hartman (University of Manchester) Logics with Counting Quantifiers 10.00 Carlos Areces, Alexandre Denis and Guillaume Hoffmann (INRIA Nancy, TALARIS) A Modal Logic with Counting 10.30 Coffee-break 11.00 Johann Makowsky (Technion - Israel Institute of Technology) Application of Logic to generating functions: Proving recurrence relations 12.00 Flavio Ferrarotti, Sven Hartmann and Sebastian Link (University of Wellington) On the Role of the Complementation Rule for Data Dependencies over Incomplete Relations 12.30 Lunch 14.00 Michiel van Lambalgen (University of Amsterdam) Logical form as a determinant in cognitive processes 15.00 Ramyaa Ramyaa and Daniel Leivant (Indiana University) Feasible functions over coinductive data 15.30 coffee 16.00 Richard Zuber (CNRS Paris) Generalising Conservativity 16.30 Glyn Morrill and Oriol Valentín (U. Politècnica de Catalunya e U. Pompeu Fabra) The Binding Principles in Categorial Grammar 17.00 Daniele Nantes Sobrino and Mauricio Ayala-Rincon (University of Brasilia) Reduction of the intruder deduction problem into equational elementary deduction for electronic purse protocols with blind signatures 17.30 close Friday, 9 July 09.00 Sebastiaan Terwijn (Radboud University Nijmegen) Comptability-theoretic interpretations of intuitionistic logic 10.00 Daniel Ventura, Mauricio Ayala and Fairouz Kamareddine (University of Brasilia, Heriot-Watt University) Intersection type systems and explicit substitutions calculi 10.30 Coffee-break 11.00 Martin Lange (University of Kassel) A CTL-Based Logic for Program Abstractions 12.00 Alexis Goyet, Yoshinori Tanabe and Masami Hagiya (Ecole Normale Supériore, University of Tokyo) Decidability and undecidability results on the modal mu-calculus with a natural number-valued semantics 12.30 Renata Reiser, Benjamin Bedregal and Gesner Dos Reis Interval Valued Fuzzy Coimplication (Fed. Univ. Rio Grande do Norte, UCPel ) 13.00 Lunch and close -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.10 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iQEcBAEBAgAGBQJL4v8yAAoJENyjWHTHE2bp9HMH/0i2/ZfYTJlNcvT+i13pq4Ae FfL9BCinw5WscSRFg+q392vesgZyleGTAMQVNdPb14Ttko0EfTKAAfL5BPkS7KBx peG5YX8qu8BkIsTAQ5kptdVUxb6lZuHJSbD/DpcrEu1k9rUR5xa2POx1ZXdMp773 cre+vRJSaYn8g7IYd64YSEAaaIIGw5+qEgm0V+dg1bla7SROLQJZZH+EvhSFuHEq TgPguzNBDp6Gxos5tF7wLtEyCGNvOR1WhEvtIhMOzWoF7m5b81ne+1ToN0Y+FpKX T9OheEVUFTHlFRyRRAgPGA7cB3Gny5IwnMEEVBnjvgGPdFMEYLKSj3o35SC+ozM= =SGAd -----END PGP SIGNATURE----- _______________________________________________ Logica-l mailing list [email protected] http://www.dimap.ufrn.br/cgi-bin/mailman/listinfo/logica-l
