Campus Event Calendar
Event Entry
What and Who
Automated theorem proving by resolution for certain classes of finitely-valued logics by using the dual of the algebra of truth values
Viorica Sofronie-Stokkermans
Max-Planck-Institut für Informatik, Saarbrücken, Germany
Talk
AG 2
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 11 December 97
11:15
60 Minutes
46
24
Saarbrücken
Abstract
I will present a method for automated theorem proving for
certain classes of finitely-valued logics (sound and complete
with respect to certain varieties of distributive lattices with
operators) that uses the Priestley dual of the algebra of truth
values of these logics instead of using their algebra of truth values.
Contact
Viorica Sofronie-Stokkermans
--email hidden
passcode not visible
logged in users only