Collegium Logicum 2009 (CL2009):
Constraint Satisfaction Problems & Many-Valued Logics

27/28 May 2009, Vienna, Austria

Supported by the trilateral ÖAD project "Constraint Satisfaction Problems & Many-Valued Logics" between research groups in Barcelona (IIIA), Paris (LIX) and Vienna (Technische Universität Wien). Supported and organised by the Kurt Gödel Society and the Theory and Logic Group.

Participation at the workshop is free.

Venue

Seminar room "Zemanek"
Technische Universität Wien
Favoritenstraße 11/ground floor
A-1040 Vienna, Austria

Program and Organising Committee

Matthias Baaz
Agata Ciabattoni
Gernot Salzer

Program

Wednesday, May 27 – Seminar room "Zemanek"
10:00-10:05	G.Salzer: Opening Address
10:05-10:30	G.Salzer: Constraint Satisfaction Problems & Many-Valued Logics (abstract)
10:30-11:00	F.Manya: Recent Advances in MaxSAT
11:00-11:30	Coffee Break
11:30-12:00	M.Hermann: An Algorithmic Approach to CSPs
12:00-12:30	F.Richoux: The Complexity of Monotones CSP over Infinite Domains
12:30-14:30	Lunch Break
14:30-15:00	L.Godo and E.Marchioni: Logics with Possibilistic Intensional Predicates
15:00-15:30	M.Baaz: The (Un)decidability of the Monadic Fragment of Gödel Logics
15:30-16:00	A.Ciabattoni and D.Picado-Muiño: A Logical Investigation of Cadiag2
16:00-17:00	Coffee & Discussion
19:00-20:30	Dinner at Melker Stiftskeller, Schottengasse 3, A-1010 Wien
20:45-	Champions League Desert at Zanoni & Zanoni, Lugeck 7, A-1010 Wien
Thursday, May 28 – Seminar room "Zemanek"
10:00-10:30	F.Bou: Many-Valued Modal Logics
10:30-11:00	S.Hetzl: Mathematical Applications of Cut-Elimination (abstract)
11:00-11:30	Coffee Break
11:30-12:00	A.Gil: Description Problems over Finite Totally Ordered Domains
12:00-12:30	T.Alsinet: Some extensions in Logic Programming
12:30-14:30	Lunch Break
14:30-15:00	P.Hajek: A (Non-)Tautology of Lukasiewicz Logic (abstract)
15:00-15:30	C.Fermüller: Linguistics, Logics, and Vagueness
15:30-16:00	C.Roschger: Evaluation Games for Shapiro's Logic of Vagueness in Context
16:00-17:00	Coffee & Discussion

Abstracts

P.Hajek: A (Non-)Tautology of Lukasiewicz Logic
A concrete example of a formula in Lukasiewicz predicate logic, which is a standard tautology but no general one.

S.Hetzl: Mathematical Applications of Cut-Elimination
Cut-elimination is an important tool in proof theory and has originally been introduced to carry out consistency-proofs. When applied to a formalized mathematical proof, cut-elimination corresponds to the removal of intermediate statements (lemmas) from the proof. This process makes implicit information contained in the original proof explicit in the form of an elementary proof. This allows to read off new mathematical information (e.g. bounds, uniformity results) or to establish connections between existing proofs. In this talk I will give an overview of this subject concentrating on the two aspects of automation and the non-uniqueness of results.

G.Salzer: Constraint Satisfaction Problems & Many-Valued Logics
We describe a syntactic approach to CSPs. Instead of viewing relations as algebraic objects we start from syntactic represenations of relations as clauses in signed logic and characterise properties like complexity based on the form of occurring signs. We give an overview of the results obtained in recent years.

Participants

Gernot Salzer