Sciweavers

Share
LOGCOM
2007
89views more  LOGCOM 2007»
8 years 12 months ago
Algorithmic Randomness of Closed Sets
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
George Barmpalias, Paul Brodhead, Douglas Cenzer, ...
LOGCOM
2007
84views more  LOGCOM 2007»
8 years 12 months ago
A Sharp Phase Transition Threshold for Elementary Descent Recursive Functions
Harvey Friedman introduced natural independence results for the Peano axioms via certain schemes of combinatorial well-foundedness. We consider here parameterized versions of this...
Arnoud den Boer, Andreas Weiermann
LOGCOM
2007
92views more  LOGCOM 2007»
8 years 12 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
LOGCOM
2007
79views more  LOGCOM 2007»
8 years 12 months ago
Goal Change in the Situation Calculus
Shapiro et al. [2005; 2006], presented a framework for representing goal change in the situation calculus. In that framework, agents adopt a goal when requested to do so (by some ...
Steven Shapiro, Yves Lespérance, Hector J. ...
LOGCOM
2007
72views more  LOGCOM 2007»
8 years 12 months ago
Classical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference Calculi for S5
We begin by showing how to faithfully encode the Classical Modal Display Logic (CMDL) of Wansing into the Calculus of Structures (CoS) of Guglielmi. Since every CMDL calculus enjo...
Rajeev Goré, Alwen Tiu
LOGCOM
2007
126views more  LOGCOM 2007»
8 years 12 months ago
A Structural Proof of the Soundness of Rely/guarantee Rules
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
Joey W. Coleman, Cliff B. Jones
LOGCOM
2007
97views more  LOGCOM 2007»
8 years 12 months ago
A General Framework for Expressing Preferences in Causal Reasoning and Planning
We consider the problem of incorporating arbitrary preferences in planning systems. A preference may be seen as a goal or constraint that is desirable, but not necessary, to satis...
James P. Delgrande, Torsten Schaub, Hans Tompits
LOGCOM
2007
180views more  LOGCOM 2007»
8 years 12 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
126views more  LOGCOM 2007»
8 years 12 months ago
Causality and Counterfactuals in the Situation Calculus
Structural causal models offer a popular framework for exploring causal concepts. However, due to their limited expressiveness, structural models have difficulties coping with su...
Mark Hopkins, Judea Pearl
LOGCOM
2007
141views more  LOGCOM 2007»
8 years 12 months ago
Conciliation through Iterated Belief Merging
Two families of conciliation processes for intelligent agents based on an iterated merge-then-revise change function for belief profiles are introduced and studied. The processes ...
Olivier Gauwin, Sébastien Konieczny, Pierre...
books