Invited Speaker(s)
-
Philippe Balbiani (Institut de recherche en informatique de Toulouse)
Unification types in modal logics
The unification problem in a modal or description logic is to determine whether given formulas have unifiers in that modal
or description logic. When an instance of the unification problem has minimal complete sets of unifiers, it is either of type
unitary, or finitary, or infinitary, depending on the cardinality of these sets. Otherwise, it is of type nullary. In this talk,
we will survey the known results and we will present the recent advances about the unification types of modal and description
logics.
-
Christopher Lynch (Clarkson University)
Unification Decision Procedures using Basic Narrowing modulo an Equational Theory
Program Committees
-
Pascual Julián-Iranzo (University of Castilla-La Mancha)
-
Daniel Dougherty (Worcester Polytechnic Institute)
-
Mauricio Ayala-Rincón (Universidade de Brasília)
-
Franz Baader (TU Dresden)
-
Philippe Balbiani (Institut de recherche en informatique de Toulouse)
-
David M. Cerna (RISC JKU, CAS ICS) co-chair
-
Besik Dundua (Institute of Applied Mathematics, Tbilisi State University)
-
Serdar Erbatur (University of Texas at Dallas (UT Dallas))
-
Santiago Escobar (Universitat Politècnica de València)
-
Silvio Ghilardi (Dipartimento di Matematica, Università degli Studi di Milano)
-
Temur Kutsia (RISC, Johannes Kepler University Linz)
-
Jordi Levy (IIIA - CSIC)
-
Christopher Lynch (Clarkson University)
-
Andrew M. Marshall (University of Mary Washington)
-
Barbara Morawska (Ahmedabad University) co-chair
-
Maribel Fernandez (King's College London)
-
Daniele Nantes-Sobrinho (Universidade de Brasília)
-
Paliath Narendran (University at Albany, SUNY)
-
Christophe Ringeissen (INRIA)
-
David Sabel (Ludwig-Maximilians-University Munich)
-
Manfred Schmidt-Schauss (Goethe-University Frankfurt am Main)