Computer Science Colloquium
Time+Place : Wednesday 07/11/2012 14:30 room 337-8 Taub  Bld.
Speaker    : Anna Zamansky
Affiliation: Technical University of Vienna
Host       : Johann Makowsky
Title      : Taming Logics: Theory, Tools, Applications
Abstract   :
In recent decades a vast variety of non-classical logics have been
introduced, driven by various CS applications. Temporal logics, separation
logics, fuzzy logics and paraconsistent logics are just a few prominent
examples, used in verification of software and hardware, medical expert
systems, data and knowledge bases, etc. A useful logic should ideally have
two components: a simple and intuitive semantics, which can provide real
insights into the logic, and a corresponding analytic proof system which is
the key to effective proof search strategies for automated deduction
methods. Obtaining these components for a given logic is a challenging
process, which is usually tailored to the particular logic at hand. However,
due to the increasing number of new application-driven logics, there is a
need for a systematic approach to obtaining these components, which could be
used for developing tools for automatic support for the design and
investigation of logical systems.
In this talk we show that this goal can be achieved at least for some useful
families of non-classical logics. We provide a uniform and modular method
for a systematic generation of effective semantics and analytic proof
systems for a very large family of paraconsistent logics used for reasoning
with inconsistent information, thus making a substantial step towards the
development of efficient paraconsistent theorem provers. The method,
implemented by the Prolog system PARAlyzer, has been extended to infinitely
many other logics formulated in terms of axiomatic systems of a certain
natural form.
Short bio:
Anna Zamansky is a Marie Curie postdoctoral fellow at the Computational
Logic group at the Technical University of Vienna. An alumna of the
Technion's Excellence Program for undergraduate studies, she obtained her
PhD in Computer Science from Tel Aviv University in June 2010. Her PhD
dissertation on applications in CS of non-deterministic semantics was a
runner up for the Beth Dissertation Prize of the Association of Logic,
Language and Information in 2010. In 2011 she received the Weizmann
Institute Postdoctoral Award for Women in Science. Her research interests
focus on applications of logic for CS, in particular for automated
deduction, knowledge representation and reasoning under uncertainty.
Visit our home page-   <>
Technion Math. Net (TECHMATH)
Editor: Michael Cwikel   <> 
Announcement from: Hadas Heier   <>