21 search results - page 1 / 5 » logcom 2007 |
LOGCOM
2007
13 years 4 months ago
2007
LOGCOM
2007
13 years 4 months ago
2007
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...
LOGCOM
2007
13 years 4 months ago
2007
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.
LOGCOM
2007
13 years 4 months ago
2007
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...
LOGCOM
2007
13 years 4 months ago
2007
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...