Welcome to FroCoS 2017 in Brasília!

The 11th International Symposium on Frontiers of Combining Systems will take place in Brasília - the garden city of Brazil and UNESCO World Heritage Site for its modernistic design. It will be hosted by the Department of Computer Science at the University of Brasília, from 27-29 September 2017.

FroCoS is the main international event for research on the development of techniques and methods for the combination and integration of formal systems, their modularization and analysis. The first FroCoS symposium was held in Munich, Germany, in 1996. Initially held every two years, since 2004 it has been organised annually with alternate years forming part of IJCAR.

FroCoS 2017 will be co-located with the 26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2017) and the 8th International Conference on Interactive Theorem Proving (ITP 2017).

The FroCoS 2017 conference proceedings are published in the Springer series Lecture Notes in Artificial Intelligence (LNAI/LNCS), volume 10483 and will be freely accessible, as a courtesy of Springer, for registered attendees during the event in the following link:

http://link.springer.com/book/10.1007/978-3-319-66167-4.

Scope:

In various areas of computer science, such as logic, computation, program development and verification, artificial intelligence, knowledge representation, and automated reasoning, there is an obvious need for using specialized formalisms and inference systems for selected tasks. To be usable in practice, these specialized systems must be combined with each other and integrated into general purpose systems. This has led – in many research areas – to the development of techniques and methods for the combination and integration of dedicated formal systems, as well as for their modularization and analysis.

The International Symposium on Frontiers of Combining Systems (FroCoS) traditionally focuses on these types of research questions and activities. Like its predecessors, FroCoS 2017 seeks to offer a common forum for research in the general area of combination, modularization, and integration of systems, with emphasis on logic-based ones, and of their practical use.

Topics:

Topics of interest for FroCoS'17 include (but are not restricted to):

• combinations of logics (such as higher-order, first-order, temporal, modal, description or other non-classical logics);
• combination and integration methods in SAT and SMT solving;
• combination of decision procedures, satisfiability procedures, constraint solving techniques, or logical frameworks;
• combination of logics with probability and/or fuzzy measures;
• combinations and modularity in ontologies;
• integration of equational and other theories into deductive systems;
• hybrid methods for deduction, resolution and constraint propagation;
• hybrid systems in knowledge representation and natural language semantics;
• combined logics for distributed and multi-agent systems;
• logical aspects of combining and modularizing programs and specifications;
• integration of data structures into constraint logic programming and deduction;
• combinations and modularity in term rewriting;
• applications of methods and techniques to the verification and analysis of information systems.

Invited Speakers

Katalin Bimbó (University of Alberta, Canada) (TABLEAUX/FroCoS/ITP)

Title: The perimeter of decidability (with sequent calculi on the inside)

Abstract: Sequent calculi are preeminently capable of controlling the shape of proofs in a logic. Sometimes this allows decidability to be proved. However, formulating certain intensional logics as sequent calculi creates challenges. I will start with sequent calculi for implicational ticket entailment, and highlight some of the key ideas behind a well-behaved sequent calculus, which was (partly) inspired by structurally free logics. The decidability of implicational ticket entailment was an open problem for about 50 years. I will outline a solution using sequent calculi (from Bimbo & Dunn 2012 and 2013).

The decidability proof of pure relevant implication (Kripke 1959) can be (and has been) utilized differently (than for implicational ticket entailment). I will focus on adding modalities, lattice connectives and structural rules (both in unrestricted and limited forms). Many of the resulting logics are not among the well-known normal modal logics. I will show that certain ways of adding modalities keep the logic decidable. Moreover, the Curry-Kripke method (possibly, with some additions) still can be used to prove their decidability.

Jasmin Blanchette (Vrije Universiteit Amsterdam, The Netherlands) (TABLEAUX/FroCoS/ITP)

Title: Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic
Joint work with Julian Biendarra, Aymeric Bouzy, Martin Desharnais, Mathias Fleury, Johannes Hölzl, Ondřej Kunčar, Andreas Lochbihler, Fabian Meier, Lorenz Panny, Andrei Popescu, Christian Sternagel, René Thiemann, and Dmitriy Traytel

Abstract: We describe a line of work that started in 2011 towards enriching Isabelle/HOL's language with coinductive datatypes, which allow infinite values, and with a more expressive notion of inductive datatype than previously supported by any system based on higher-order logic. These (co)datatypes are complemented by definitional principles for (co)recursive functions and reasoning principles for (co)induction. In contrast with other systems offering codatatypes, no additional axioms or logic extensions are necessary with our approach.

Cezary Kaliszyk (University of Innsbruck, Austria) (TABLEAUX/FroCoS/ITP)

Title: Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages

Abstract: A formal, mathematically precise semantics for a programming language is the essential prerequisite for the design of logics and calculi that permit automated reasoning about programs. The most popular approach to programming language semantics — small step operational semantics (SOS) — is not modular in the sense that it does not separate conceptual layers in the target language. SOS is also hard to relate formally to program logics and calculi. Low-level semantic formalisms, such as automata, Petri nets, or π-calculus are inadequate for rich programming languages. We propose a new formal semantics for a concurrent, active objects language. It is designed with the explicit aim of being compatible with a sequent calculus for a program logic and has a strong model theoretic flavor. Our semantics separates sequential and object-local from concurrent computation: the former yields abstract traces which in a second stage are combined into global system behavior.

Cesare Tinelli (University of Iowa, USA)

Title: Designing Extensible Theory Solvers
Joint work with Andrew Reynolds, Dejan Jovanovic, and Clark Barrett

Abstract: Current SMT solvers have built-in support for a wide range of theories, including various arithmetics, arrays, bit-vectors, strings, algebraic datatypes, and finite sets. This support is provided in a principled and modular way through the use of theory solvers, specialized solvers for the satisfiability of sets of (quantifier-free) constraints in a specific theory. Despite being highly-specialized, theory solvers have important commonalities that can be factored out. I will start with an overview of the design of such solvers, focusing on theories whose signature can be seen as the extension of some base signature. I will then introduce some novel generic techniques based on context-dependent simplification and model-based refinement that allow one to extend modularly a theory solver for constraints over a theory's base signature to a larger signature. I will discuss case studies showing that these techniques can be leveraged to solve constraints in an extended theory of strings, for bit-vector solvers relying on lazy bit-blasting, and for new approaches to solve non-linear arithmetic constraints.

Renata Wassermann (University of São Paulo, Brazil)

Title: Revising System Specifications in Temporal Logic

Abstract: Although formal system verification has been around for many years, little attention was given to the case where the specification of the system has to be changed. This may occur due to a failure in capturing the client's requirements or due to some change in the domain (think for example of banking systems that have to adapt to different taxes being imposed). We are interested in having methods not only to verify properties, but also to suggest how the system model should be changed so that a property would be satisfied. For this purpose, we will use techniques from the area of Belief Revision.

Belief revision deals with the problem of changing a knowledge base in view of new information. In the last thirty years, several authors have contributed with change operations and ways of characterising them. However, most of the work concentrates on knowledge bases represented using classical propositional logic. In the last decade, there have been efforts to apply belief revision theory to description and modal logics.

In this talk, I will analyse what is needed for a theory of belief revision which can be applied to the temporal logic CTL. In particular, I will illustrate different alternatives for formalising the concept of revision of CTL specifications. Our interest in this particular logic comes both from practical issues, since it is used for software specification, as from theoretical issues, as it is a non-compact logic and most existing results rely on compactness.

Important Dates:

24th April 2017
1st May 2017: Abstract submission (extended)

28th April 2017
5th May 2017: Full paper submission (extended)

9th June 2017
16th June 2017: Author notification

23rd June 2017
26th June 2017: Camera-ready version due

23-25 September 2017: Workshops & Tutorials

27-29 September 2017: FroCoS Conference

Paper submission:

The program committee seeks high-quality submissions describing original work, written in English, not overlapping with published or simultaneously submitted work to a journal or conference with archival proceedings. Selection criteria include accuracy and originality of ideas, clarity and significance of results, and quality of presentation. The page limit in Springer LNCS style is 16 pages in total, including references and figures.

Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via the EasyChair system at

https://easychair.org/conferences/?conf=frocos2017.

For each accepted paper, at least one of the authors is required to attend the symposium and present the work. Prospective authors must register a title and an abstract five days before the paper submission deadline.

Formatting instructions and the LNCS style files can be obtained at:

http://www.springer.com/br/computer-science/lncs/conference-proceedings-guidelines.

The copyright form which should be sent together with the camera-ready files can be found here.

Program Committee

Carlos Areces (FaMAF - Universidad Nacional de Córdoba)
Alessandro Artale (Free University of Bolzano-Bozen)
Mauricio Ayala-Rincon (Universidade de Brasília)
Franz Baader (TU Dresden)
Peter Baumgartner (National ICT Australia)
Christoph Benzmüller (Freie Universität Berlin)
Thomas Bolander (Technical University of Denmark)
Marcelo Coniglio (State University of Campinas)
Clare Dixon (University of Liverpool) (Co-Chair)
François Fages (Inria, Université Paris-Saclay)
Marcelo Finger (Universidade de São Paulo) (Co-Chair)
Pascal Fontaine (LORIA, INRIA, University of Lorraine)
Didier Galmiche (LORIA, University of Lorraine)
Vijay Ganesh (University of Waterloo)
Silvio Ghilardi (Università degli Studi di Milano)
Jürgen Giesl (RWTH Aachen)
Laura Giordano (Università del Piemonte Orientale)
Agi Kurucz (Kings College, London)
Till Mossakowski (Otto-von-Guericke-University Magdeburg)
Cláudia Nalon (Universidade de Brasília)
Elaine Pimentel (Universidade Federal do Rio Grande do Norte)
Silvio Ranise (Fondazione Bruno Kessler-Irst)
Christophe Ringeissen (LORIA-INRIA)
Uli Sattler (University of Manchester)
Roberto Sebastiani (University of Trento)
Guillermo Simari (Universidad Nacional del Sur in Bahia Blanca)
Viorica Sofronie-Stokkermans (University Koblenz-Landau)
Andrzej Szalas (University of Warsaw)
René Thiemann (University of Innsbruck)
Ashish Tiwari (SRI International)
Christoph Weidenbach (Max Planck Institute for Informatics)

Organisation:

The conference is organised by the Departments of Computer Science (CIC) and Mathematics (MAT) at the University of Brasília and by the Departments of Informatics and Applied Mathematics (DIMAp) and Mathematics (DMAT) at the Federal University of Rio Grande do Norte.

Organising Committee:

Cláudia Nalon (CIC/UnB)

Daniele Nantes Sobrinho (MAT/UnB)

Elaine Pimentel (DMAT/UFRN)

João Marcos (DIMAp/UFRN)

Call for Workshop/Tutorials:

Following the long tradition of TABLEAUX, FroCoS, and ITP, we invite researchers and practitioners to submit proposals for co-located workshops and in-depth tutorials on topics relating to automated theorem proving and its applications. Workshops/tutorials can target the automated reasoning community in general, focus on a particular theorem proving system, or highlight more specific issues or recent developments.

Co-located events will take place between 23 and 24/25 September and will be held on the same premises as the main conference. Conference facilities are offered free of charge to the organisers. Workshop/tutorial-only attendees will enjoy a significantly reduced registration fee.

Detailed organisational matters such as paper submission and review process, or publication of proceedings, are up to the organisers of individual workshops. All accepted workshops/tutorials will be expected to have their program ready by 18 August 2017.

Proposals for workshops/tutorials should contain at least the following pieces of information:

name and contact details of the main organiser(s)

(if applicable:) names of additional organisers

title and organisational style of event (tutorial, public workshop, project workshop, etc.)

preferred length of workshop (between half day and two days)

estimated number of attendees

short (up to one page) description of topic

(if applicable:) pointers to previous editions of the workshop, or to similar events

Proposals are invited to be submitted by email to nalon@unb.br, no later than 9 December 2016. Selected events will be notified by 23 December 2016. The workshop/tutorial selection committee consists of the TABLEAUX, FroCoS, and ITP program chairs and the conference organisers.

Co-located Events

Workshops:

12th Workshop on Logical and Semantic Frameworks with Applications (LSFA 2017)
Sandra Alves, Renata Wassermann, Flávio L. C. de Moura
23 and 24 September 2017

Proof eXchange for Theorem Proving (PxTP)
Catherine Dubois, Bruno Woltzenlogel Paleo
23 and 24 September 2017

EPS - Encyclopedia of Proof Systems
Giselle Reis, Bruno Woltzenlogel Paleo
24 and 25 September 2017

DaLí – Dynamic Logic: new trends and applications
Mário Benevides, Alexandre Madeira
23 and 24 September 2017

Tutorials:

T1 - Proof compressions and the conjecture NP = PSPACE
Lew Gordeev, Edward Hermann Haeusler
23 September 2017

T2 - General methods in proof theory for modal and substructural logics
Björn Lellmann, Revantha Ramanayake
24 September 2017
Slides: Lecture 1, Lecture 2, Lecture 3,Lecture 4

T3 - From proof systems to complexity bounds
Anupam Das
25 September 2017

T4 - PVS for Computer Scientists
César Muñoz, Mauricio Ayala-Rincón, Mariano Moscato
25 September 2017

FroCoS 2017 Accepted Papers

Matthias Baaz and Anela Lolic
First-Order Interpolation of Non-Classical Logics Derived from Propositional Interpolation

Franz Baader
A New Description Logic with Set Constraints and Cardinality Constraints on Role Successors

Silvio Ghilardi and Alessandro Gianola
Interpolation, Amalgamation and Combination (the non-disjoint signatures case)

Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm and Xuan Tung Vu
Subtropical Satisfiability

Philippe Balbiani and Cigdem Gencer
Finitariness of elementary unification in Boolean Region Connection Calculus

Franz Baader, Stefan Borgwardt, Patrick Koopmann, Ana Ozaki and Veronika Thost
Metric Temporal Description Logics with Interval-Rigid Names

Simon Cruanes
Superposition with Integrated Induction

Marco Voigt
The Bernays-Schönfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals is Decidable

Jens Classen and Benjamin Zarrieß
Decidable Verification of Decision-Theoretic Golog

Jelena Vlasenko, Volker Haarslev and Brigitte Jaumard
Pushing the Boundaries of Reasoning about Qualified Cardinality Restrictions

Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs and Jürgen Giesl
Complexity Analysis for Term Rewriting by Integer Transition Systems

Franz Baader, Patrick Koopmann and Anni-Yasmin Turhan
Using Ontologies to Query Probabilistic Numerical Data

Carlos Caleiro, Sergio Marcelino and Joao Marcos
Merging fragments of classical logic

Mauricio Ayala-Rincon, Washington de Carvalho Segundo, Maribel Fernandez and Daniele Nantes-Sobrinho
On solving nominal fixpoint equations

Kentaro Kikuchi, Takahito Aoto and Yoshihito Toyama
Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems

Zhengbing Bian, Fabian Chudak, William Macready, Aidan Roy, Roberto Sebastiani and Stefano Varotti
Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report

Christoph Wernhard
The Boolean Solution Problem from the Perspective of Predicate Logic

Accepted Abstracts: Poster Session

The Poster Session is scheduled for Thursday 28/09 and will be preceded by short talks, which should be at most 5 minutes long. Posters should have the form A1: 594 x 841 mm (23.4 x 33.1 inches - portrait).

Combined Proof Methods For Multimodal K
Daniella Angelos, Cláudia Nalon

Congruence Closure with Free Variables
Haniel Barbosa, Pascal Fontaine, Andrew Reynolds

Conditional Parametricity in Isabelle/HOL
Jan Gilcher, Andreas Lochbihler, Dmitriy Traytel

Mining for Formalization Environments in the Mizar Mathematical Library
Adam Naumowicz

Formal Verification of the Dynamic Authentication Protocol
Felipe Rodopoulos de Oliveira, Cláudia Nalon

On Generalizing Decidable Standard Prefix Classes of First-Order Logic
Marco Voigt

Program Extraction for Mutable Arrays
Kazuhiko Sakaguchi

A resolution-based E-connection calculus
Lucas Amaral, Cláudia Nalon

Automatic Complexity Analysis of Programs
Florian Frohn, Jürgen Giesl

Formal Verification of Smart Contracts
Chad E. Brown, Ondrej Kuncar Josef Urban

Polynomials, rivals of tableaux
Walter Carnielli

Craig Interpolation and Query Reformulation with Clausal First-Order Tableaux
Christoph Wernhard

Mind the Gap: Metric Temporal Logic Translations
Ullrich Hustadt, Clare Dixon, Ana Ozaki

Verified Model Checking of Timed Automata
Simon Wimmer, Peter Lammich

Call for Posters

TABLEAUX/FroCoS/ITP 2017 will have a poster session, which is intended for descriptions of works in progress, student projects and relevant research being published elsewhere. Submissions should be in English, in the form of at most two pages abstract, ENTCS format containing title and authors name with affiliation. The files should be sent directly to Elaine Pimentel (elaine at mat.ufrn.br).

The deadline for posters submission is June 15 June 20, 2017. The notification will be sent to authors June 30th.

Proceedings of this session will not be published. Formatting instructions for posters will be made available soon.

For more information please contact the local organizers:

Elaine Pimentel (elaine at mat.ufrn.br)

Daniele Nantes (dnantes at mat.unb.br)

Preliminary Programme for All Events

Keys:
IT = Invited Talk
TP = Technical Presentation
T/F/I = TABLEAUX/FroCoS/ITP
T1-T4 = tutorials

FroCoS 2017 Programme

The programme can be downloaded as a pdf file by clicking here.

Wednesday, 27th of September

Joint FroCoS/ITP/TABLEAUX Invited Talk
Chair: Elaine Pimentel
08:30-09:30	The Perimeter of Decidability (with Sequent Calculi on the Inside)
	Katalin Bimbó
9.30-10.30	Technical Session: Properties and Combinations of Logic I
Chair: Didier Galmiche
	First-Order Interpolation of Non-Classical Logics Derived from Propositional Interpolation
	Matthias Baaz and Anela Lolic
	Interpolation, Amalgamation and Combination (the non-disjoint signatures case)
	Silvio Ghilardi and Alessandro Gianola
10.30-11.00	Coffee
11.00-12.30	Technical Session: Description and Temporal Logics
Chair: Silvio Ghilardi
	Metric Temporal Description Logics with Interval-Rigid Names
	Franz Baader, Stefan Borgwardt, Patrick Koopmann, Ana Ozaki and Veronika Thost
	Pushing the Boundaries of Reasoning about Qualified Cardinality Restrictions
	Jelena Vlasenko, Volker Haarslev and Brigitte Jaumard
	Using Ontologies to Query Probabilistic Numerical Data
	Franz Baader, Patrick Koopmann and Anni-Yasmin Turhan
12.30-14.00	Lunch
Joint FroCoS/ITP/TABLEAUX Invited Talk
14.00-15.00	Automating Formalization by Statistical and Semantic Parsing of Mathematics
	Cezary Kaliszyk
15.00-15.30	Technical Session: Description and Temporal Logics (Cont.)
Chair: Silvio Ghilardi
	A New Description Logic with Set Constraints and Cardinality Constraints on Role Successors
	Franz Baader
15.30-18.00	Coffee and Excursion
18.00-22.30	Dinner

Thursday, 28th September

8.30-9.30	FroCoS Invited Talk
Chair: Clare Dixon
	Revising System Specifications in Temporal Logic
	Renata Wassermann
9.30-9.45	FLOC 2018 Announcement
	Didier Galmiche, Roberto Sebastiani
9.45-10.30	Poster Talks
	Renate A. Schmidt
10.30-11.00	Coffee
11.00-12.30	Poster Display
10.30-11.00	Lunch
14.00-15.00	Joint FroCoS/ITP/TABLEAUX Invited Talk
Chair: Marcelo Finger
	Foundational (Co)Datatypes and (Co)Recursion for Higher-Order Logic
	Jasmin Blanchette
15.00-15.30	Technical Session: Properties and Combinations of Logic II
Chair: Franz Baader
	Finitariness of elementary unification in Boolean Region Connection Calculus
	Philippe Balbiani and Cigdem Gencer
15.30-16.00	Coffee
16.00-17.00	Technical Session: Properties and Combinations of Logic II (Cont.)
Chair: Franz Baader
	Merging fragments of classical logic
	Carlos Caleiro, Sergio Marcelino and Joao Marcos
	The Boolean Solution Problem from the Perspective of Predicate Logic
	Christoph Wernhard
17.00-18.00	Business Meeting

Friday, 29th September

8.30-9.30	ITP Invited Talk
	Automated Theory Exploration for Interactive Theorem Proving: An introduction to the Hipster system
	Moa Johansson
	Sponsored by the European Association for Artificial Intelligence - EurAI
9.30-10.30	Technical Session: Rewriting
Chair: Daniele Nantes
	Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems
	Kentaro Kikuchi, Takahito Aoto and Yoshihito Toyama
	Complexity Analysis for Term Rewriting by Integer Transition Systems
	Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs and Jürgen Giesl
10.30-11.00	Coffee
11.00-12.30	Technical Session: Decision procedures, decidability and verification
Chair: Pascal Fontaine
	On solving nominal fixpoint equations
	Mauricio Ayala-Rincon, Washington de Carvalho Segundo, Maribel Fernandez and Daniele Nantes-Sobrinho
	Decidable Verification of Decision- Theoretic Golog
	Jens Claßen and Benjamin Zarrieß
	The Bernays-Schönfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals is Decidable
	Marco Voigt
10.30-11.00	Lunch
14.00-15.00	FroCoS Invited Talk
Chair: Roberto Sebastiani
	Designing Extensible Theory Solvers
	Cesare Tinelli
15.00-15.30	Technical Session: SAT, SMT and Automated Theorem Proving
Chair: Peter Baumgartner
	Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report
	Zhengbing Bian, Fabian Chudak, William Macready, Aidan Roy, Roberto Sebastiani and Stefano Varotti
15.30-16.00	Coffee
16.00-17.00	Technical Session: SAT, SMT and Automated Theorem Proving (Cont.)
Chair: Peter Baumgartner
	Superposition with Integrated Induction
	Simon Cruanes
	Subtropical Satisfiability
	Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm and Xuan Tung Vu
17.00-17.30	Closing

Grants and Financial Support

Students Grants

A limited number of travel grants is available for students who would not otherwise have resources to attend TABLEAUX/FroCoS/ITP, and whose attendance would benefit both the applicant and the event. We expect to be able to help with local/travel expenses up to 250 EUR per student. Applicants should note that grants are limited, and that costs in excess of the grant will not be reimbursed.

Grants will be awarded based on the grant committee's assessment of the applicant's genuine financial need, the potential benefit to the applicant's education and research, and the potential benefit to TABLEAUX/FroCoS/ITP. Among those applicants who genuinely could not attend TABLEAUX/FroCoS/ITP without a grant, the evaluating committee gives priority to (co-)authors of accepted papers.

Although priority is given to students with active role in the conferences/workshops, students in other situations are very much encouraged to apply.

Applications should explain briefly (limited to 2000 characters)

• the current status of the applicant
• the kind of participation of the applicant in TABLEAUX/FroCoS/ITP
• a breakdown of the estimated amount needed

Applications should be sent by August 10th 2017 by email to Elaine Pimentel (elaine.pimentel at gmail.com). Students should have their supervisor sent a brief recommendation email (limited to 2000 characters) to the same address and by the same deadline. This letter should describe the student's work, the benefit to that work of attending the conference, and an assessment of the student's financial need.

The award notification date is August 15th, 2017.

The grants will be presented at the conferences; in case a grantee does not attend, the chairs may transfer the grant to another student or give no award.

The grants are offered by Springer and by the organisation of the conferences.

For more information please contact the local organisers:

• Elaine Pimentel (elaine.pimentel at gmail.com)
• Daniele Nantes (daniele.nantes at gmail.com)

Association for Symbolic Logic

TABLEAUX 2017, FroCoS 2017, and ITP 2017 are officially supported by the Association for Symbolic Logic. Students who are ASL members can apply for (limited) ASL travel funds. Applications should be sent three months prior to the start of the events. For full instructions, visit the ASL Travel Awards page.

ACM-W

ACM-W provides support for women undergraduate and graduate students in Computer Science and related programs to attend research conferences. It is not required to have a paper to present at the conferences. Applications for conferences which are held in September should be sent until 15 June. Please note that this deadline is strict. For full instructions, please visit their scholarship page.

Registration

The registration page is no longer available (2017-10-18). Early registration is until the 4th August. Late registration until the 2nd September. After that, registration can be done only on the venue at the same prices of late registration, but only payment in cash can be taken. All prices are all given in Brazilian Reals. Regular fees include coffee breaks, lunchs, proceedings of the selected conferences/workshops, and social activities. Student fees include coffee breaks, lunchs, proceedings of the selected conferences/workshops, but do not include social activities (excursion/dinner).

Early Registration (until 4th August 11th August)

Conferences: TABLEAUX, FroCoS, ITP

One conference only: R$ 1065.00 (regular), R$ 760.00 (student)

Any two conferences: R$ 1255.00 (regular), R$ 855.00 (student)

All three conferences: R$ 1445.00 (regular), R$ 950.00 (student)

Workshops:

LSFA 2017: R$ 495.00 (regular), R$ 325.00 (student)

PxTP 2017: R$ 345.00 (regular), R$ 230.00 (student)

EPS: R$ 230.00 (regular), R$ 155.00 (student)

Dalí: R$ 460.00 (regular), R$ 310.00 (student)

Tutorials

Each: R$ 230.00 (regular), R$ 155.00 (student)

Late Registration (until 2nd September)

Conferences: TABLEAUX, FroCoS, ITP

One conference only: R$ 1280.00 (regular), R$ 915.00 R$ 760.00 (student)

Any two conferences: R$ 1510.00 (regular), R$ 1030.00 R$ 855.00 (student)

All three conferences: R$ 1735.00 (regular), R$ 1140.00 R$ 950.00 (student)

Workshops:

LSFA 2017: R$ 595.00 (regular), R$ 390.00 R$ 325.00 (student)

PxTP 2017: R$ 415.00 (regular), R$ 280.00 R$ 230.00 (student)

EPS: R$ 280.00 (regular), 190.00 R$ 155.00 (student)

Dalí: R$ 560.00 (regular), R$ 380.00 R$ 310.00 (student)

Tutorials

Each: R$ 280.00 (regular), R$ 190.00 R$ 155.00 (student)

Extras (any time)

Extra tickets excursion/conference dinner (accompanying person): R$ 380.00

Physical copy of the EPS: R$ 80.00

Venue

All the events will be held at the Finatec building located within the University of Brasília.
Finatec- Fundação de Empreendimentos Científicos e Tecnológicos
Campus Universitário Darcy Ribeiro
Av. L3 Norte, Ed. Finatec
Asa Norte, Brasília – DF
CEP 70910-900
Tel.: +55 61 3348 0400

Local Information:

(This is under construction. Please return for more information.)

Accessibility

Brasília is served by an international airport which handles around 19 million passengers a year. As part of the preparation for hosting the 2014 FIFA World Cup, the airport received massive investments, from both the public and private sectors, for the renovation of the passenger’s terminals and the enlargement of the taxiways, which has allowed to almost double the number of positions available for aircrafts and, thus, increase the number of available routes for both domestic and international flights. International flights directly connect Brasília with Santiago (Chile), Panama City (Panama), Miami (USA), Atlanta (USA), and Lisbon (Portugal).

It is also worthy mentioning that Brasília hosts one of the most important regional hubs in Brazil. There are direct flights from all the state capitals, including Rio de Janeiro, São Paulo, Porto Alegre, Natal, Recife, among other places which are easily accessible directly from other continents and from other countries in the Americas.

Brasília is centrally located and well served by coaches from elsewhere in Brazil, but prices for internal flights are competitive and travel times much shorter.

Transportation

The airport is just 20 minutes away from the centre, where the hotels are. Taxis cost around € 15.00 and are a convenient way to go from and to the airport.

There is also an Executive Bus from the airport to the Hotels Sectors. It runs every half an hour and stops by the door of or conveniently close to the main hotels in these areas. The trip costs R$ 12.00 (around € 2.50).

Regular buses (lines 102, 102.1) also run from the airport to the main bus terminal in town, are frequent and quite cheap (€ 0.50). From the bus terminal you will need to catch another bus or a taxi to get to other places. If you do not speak Portuguese or do not know your way around, this is not recommended for you.

Visa Requirements

Brazil’s foreign policy is based on reciprocity. The Brazilian immigration authority will not require application for a visa prior to travelling/entering the country if your own country does not require such from Brazilian nationals. Nationals of 86 countries can enter Brazil without a visa, including all EU countries. For those who need a visa, there is a special category for attendees of scientific meetings (VITUR), where a letter of invitation is needed. You should check with the Brazilian Consulate in your country what the requirements are. The organisation of the event will provide the required letters upon registration, in case you need them to apply for visas.

Accommodation

Brasília has a vast number of hotels. They are located in the central area, closer to the cross between the Monumental and the Residential Axes, about 10 minutes by car to the events venue.

We have negotiated special rates at the Comfort Suítes Brasília:

Single: R$ 237,00

Double: R$ 280,00

Values are per night, breakfast is included, and taxes are not included (15%). In order to benefit from these rates, you need to contact the hotel directly via email (reservas.csb@atlanticahotels.com.br or eventos.csb@atlanticahotels.com.br) and cite the conferences.

Alternatives can be found at the usual search sites: Booking.com, airbnb, Trip Advisor, etc.

Shuttle Hotels/FINATEC/Social Events

The organisation will provide transportation from the North Hotels Sector (SHN, stop in front of the Comfort Suítes Brasíllia) to the FINATEC Building at the University of Brasília (UnB). The trips between UnB (ICC Norte) and UnB (Finatec) are for registered attendees of the tutorial "PVS for Computer Scientists". We will also provide transportation from the Finatec Building to the Itamaraty Palace, and from there to the APCEF (where the dinner will be held).

• 23/09/17
  • 07:40:00 SHN ↦ UnB (Finatec)
  • 08:15:00 SHN ↦ UnB (Finatec)
  • 17:45:00 UnB (Finatec) ↦ SHN
  • 18:00:00 UnB (Finatec) ↦ SHN
• 24/09/17
  • 07:50:00 SHN ↦ UnB (Finatec)
  • 08:15:00 SHN ↦ UnB (Finatec)
  • 17:00:00 UnB (Finatec) ↦ SHN
  • 17:30:00 UnB (Finatec) ↦ SHN
• 25/09/17
  • 07:40:00 SHN ↦ UnB (Finatec)
  • 08:10:00 UnB (Finatec) ↦UnB (ICC Norte)
  • 11:30:00 SHN ↦ UnB (Finatec)
  • 12:30:00 UnB (ICC Norte) ↦ UnB (Finatec)
  • 13:50:00 UnB (Finatec) ↦UnB (ICC Norte)
  • 17:30:00 UnB (ICC Norte) ↦ UnB (Finatec)
  • 18:00:00 UnB (Finatec) ↦ SHN
  • 18:30:00 UnB (Finatec) ↦ SHN
• 26/09/17
  • 07:30:00 SHN ↦ UnB (Finatec)
  • 08:00:00 SHN ↦ UnB (Finatec)
  • 18:00:00 UnB (Finatec) ↦ SHN
  • 18:30:00 UnB (Finatec) ↦ SHN
• 27/09/17
  • 07:00:00 SHN ↦ UnB (Finatec)
  • 07:30:00 SHN ↦ UnB (Finatec)
  • 08:00:00 SHN ↦ UnB (Finatec)
  • 15:40:00 UnB (Finatec) ↦Itamaraty
  • 16:10:00 UnB (Finatec) ↦ SHN
  • 16:40:00 UnB (Finatec) ↦ Itamaraty
  • 17:00:00 Itamaraty ↦ APCEF
  • 18:00:00 Itamaraty ↦ APCEF
  • 21:00:00 APCEF ↦ SHN
  • 21:30:00 APCEF ↦ SHN
  • 22:00:00 APCEF ↦ SHN
• 28/09/17
  • 07:00:00 SHN ↦ UnB (Finatec)
  • 07:30:00 SHN ↦ UnB (Finatec)
  • 08:00:00 SHN ↦ UnB (Finatec)
  • 17:20:00 UnB (Finatec) ↦ SHN
  • 17:50:00 UnB (Finatec) ↦ SHN
  • 18:30:00 UnB (Finatec) ↦ SHN
• 29/09/17
  • 07:30:00 SHN ↦ UnB (Finatec)
  • 08:00:00 SHN ↦ UnB (Finatec)
  • 17:15:00 UnB (Finatec) ↦ SHN
  • 17:40:00 UnB (Finatec) ↦ SHN

Vaccination

Brazil does not require an International Certificate of Vaccination or Prophylaxis for entry into the country.

Travelers are encouraged, however, to ensure their routine immunizations are up to date (as recommended by their country of origin), since it is an effective and safe measure for the prevention of various diseases.

Brasília is not in the endemic area of yellow fever. However, it is also important that travellers take yellow fever vaccination 10 days before visiting forested areas or participating in ecotourism or rural tourism activities. For further information on yellow fever, please click here.

(source: Brazilian Ministry of Health)

Out and Around

Brasília is a modern, lively place, with a variety of attractions worth seeing. For those who like the urban environment and cultural activities, almost all public buildings are open for visitation, most of them with free guided tours. Besides the architectural features, they hold interesting art collections which are also open for visitation. For the more adventurous, we are in the middle of the Cerrado ecosystem, which makes trips to nearby parks and waterfalls a very pleasant experience. Some of the suggested places to visit include the National parks:

• The Chapada dos Veadeiros National Park
• Corumbá Falls
• The Itiquira Falls

and nearby cities of historical interest:

• Pirenópolis
• Goiás City