Anytime Approximations of Classical Logic from Above

In this paper we present s1, a family of logics that is useful to disprove propositional formulas by means of an anytime approximation process. The systems follows the paradigm of a parameterised family of logics established

• Type: Journal
• Year: 2007
• Where: LOGCOM
• Authors: Marcelo Finger, Renata Wassermann
• Keywords: Anytime Approximation Process, LOGCOM 2007, Logics, Propositional Formulas