Anytime Approximations of Classical Logic from Above

13 years 10 months ago

Download www.cle.unicamp.br

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

Marcelo Finger, Renata Wassermann

Real-time Traffic

Anytime Approximation Process | LOGCOM 2007 | Logics | Propositional Formulas |

claim paper

» Approximate Entailment

» Computational Complexity and Anytime Algorithm for Inconsistency Measurement

» Approximate coherencebased reasoning

» On Anytime CoherenceBased Reasoning

» An Anytime Algorithm for Computing Inconsistency Measurement

» A Logic for Approximate FirstOrder Reasoning

» On categorical models of classical logic and the Geometry of Interaction

» Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2007
Where	LOGCOM
Authors	Marcelo Finger, Renata Wassermann

Comments (0)

Sciweavers

Anytime Approximations of Classical Logic from Above

Anytime Approximation Process | LOGCOM 2007 | Logics | Propositional Formulas |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers