View: session overviewtalk overviewside by side with other conferences
08:45  From display logic to nested sequents via residuated frames SPEAKER: Nick Galatos 
09:30  Firstorder nonclassical logics: an orderbased approach SPEAKER: Petr Cintula ABSTRACT. It is wellknown, already in classical logic, that propositional logics have a limited expressive power which can fail to provide satisfactory means for modelling and analysis in certain contexts. For this reason it is highly desirable to introduce, for every logic, a predicate extension allowing to distinguish between properties and objects. There have been systematic studies of predicate versions for some families of nonclassical logics, such as superintuitionistic, modal, or fuzzy logics. In other cases there are numerous competing partial approaches. 
10:45  Broadly truthfunctional logics through classical lenses SPEAKER: João Marcos ABSTRACT. With different motivations and goals, Roman Suszko, Dana Scott and Newton da Costa have all suggested in the 70s that Tarskian logics, however manyvalued they might initially appear to be, could always be characterized with the use of only two _logical values_. A programmatic effort to show how such a presentation could be attained for increasingly larger classes of logics, while at the same time avoiding serious losses of nice computational properties, was carefully undertaken in the last decade. In this talk I will show how bivalent effective semantics and uniform classiclike analytic tableaux may be obtained for logics characterized by way of finitevalued nondeterministic semantics. 
11:30  Natural deduction for nondeterministic ﬁnitevalued logics SPEAKER: Cecilia Englander 
12:00  The procedural understanding of meaning and compositionality in formal semantics SPEAKER: Ivan Mikirtumov 
12:30  SemiBCIalgebras SPEAKER: Regivan Santiago ABSTRACT. BCIalgebras are related to formal systems of Fuzzy Logic. They model the so
A BCIalgebra is called BCKalgebra, whenever it also satisfies:
On any BCIalgebra it is possible to define a partial order “≤” as: “x ≤ y iff x ⊖ y =⊥”. In this talk we will propose a generalization for such algebras, in order to capture some phenomena of Lukasiewcz Interval implications. 
14:30  An intuitionistic ALC description default logic SPEAKER: Alexandre Rademaker ABSTRACT. Knowledge formalization and reasoning automation are central within Artificial Intelligence. Classical logic has been traditionally used for such purposes. However, it is better suited to deal with complete knowledge in ideal circumstances. In real situations, in which the knowledge is partial, classical logic is not sufficient since it is monotonic. Nonmonotonic logics have been proposed to better cope with practical reasoning. A successful formalization of nonmonotonic reasoning is the Reiter's default logic which extends classical logic with default rules. Unfortunately, default logic is undecidable. One reason for that is the use of classical logic as its monotonic basis.
In this work, we change the default logic monotonic basis and propose a new default logics based on its intuitionistic version iALC. This new default logics are decidable and useful to formalize practical reasoning on hierarchical ontologies with exceptions, specially the ones that deals with legal knowledge and reasoning. On the default counterpart, we add some restrictions to the application of defaults in order to obtain nice properties such as coherence and elimination of anomalous extensions. We present the main algorithms used to build the extension for this logic, including the sequent calculus for iALC, with its complexity analysis.

15:00  An inﬁnitary deduction system for CTL* SPEAKER: Luca Viganò 
15:30  Modal functions as moody truthfunctions SPEAKER: Pedro Falcão ABSTRACT. We can think of the usual (S5) modalities as 'moody' truthfunctions. E.g. the necessity operator 'works' as falsum (constant falsehood) if the argument is contingent, and it works as the identity function if the argument is rigid (i.e. noncontingent); the possibility operator 'works' as verum (constant truth) if the argument is contingent and works as the identity if the argument is rigid.
We show how (the 16) pairs of unary truthfunctions correspond unequivocally to unary modal functions; moreover we show how to generalize this to establish a correspondence between modal functions of arbitrary degree and sequences of truthfunctions. 
16:30  On subexponentials, focusing and modalities in concurrent systems SPEAKER: Elaine Pimentel ABSTRACT. Concurrent Constraint Programming (CCP) is a simple and powerful model for concurrency where agents interact by telling and asking constraints. Since their inception, CCPlanguages have been designed for having a strong connection to logic. In fact, the underlying constraint system can be built from a suitable fragment of intuitionistic (linear) logic ILL and processes can be interpreted as formulas in ILL. Constraints as ILL formulas fail to represent accurately situations where ``preferences'' (called soft constraints) such as probabilities, uncertainty or fuzziness are present. In order to circumvent this problem, csemirings have been proposed as algebraic structures for defining constraint systems where agents are allowed to tell and ask soft constraints. Nevertheless, in this case, the tight connection to logic and proof theory is lost. In this work, we give a proof theoretical meaning to soft constraints: they can be defined as formulas in a suitable fragment of ILL with subexponentials (SELL) where subexponentials, ordered in a csemiring structure, are interpreted as preferences. We hence achieve two goals: (1) obtain a CCP language where agents can tell and ask soft constraints and (2) prove that the language in (1) has a strong connection with logic. Hence we keep a declarative reading of processes as formulas while providing a logical framework for softCCP based systems. An interesting side effect of (1) is that one is also able to handle probabilities (and other modalities) in SELL, by restricting the use of the promotion rule for nonidempotent csemirings. This finer way of controlling subexponentials allows for considering more interesting spaces and restrictions, and it opens the possibility of specifying more challenging computational systems.

17:00  Quantum state transformations and distributed temporal logic SPEAKER: Luca Viganò 
17:30  Combining nondeterminism and context awareness in consistency restoration systems SPEAKER: Anna Zamansky 