Sciweavers

Share
21 search results - page 1 / 5
» logcom 2007
Sort
View
LOGCOM
2007
91views more  LOGCOM 2007»
9 years 11 months ago
Generalized Strong Preservation by Abstract Interpretation
Francesco Ranzato, Francesco Tapparo
LOGCOM
2007
89views more  LOGCOM 2007»
9 years 11 months ago
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...
Marcelo Finger, Renata Wassermann
LOGCOM
2007
75views more  LOGCOM 2007»
9 years 11 months ago
The Extent of Constructive Game Labellings
We define a notion of combinatorial labellings, and show that ∆0 2 is the largest boldface pointclass in which every set admits a combinatorial labelling.
Benedikt Löwe, Brian Semmes
LOGCOM
2007
180views more  LOGCOM 2007»
9 years 11 months ago
A Causal Theory of Abduction
The paper provides a uniform representation of abductive reasoning in the logical framework of causal inference relations. The representation covers in a single framework not only...
Alexander Bochman
LOGCOM
2007
92views more  LOGCOM 2007»
9 years 11 months ago
Third-Order Computation and Bounded Arithmetic
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
Alan Skelley
books