LOGCOM
2007
13 years 4 months ago
2007
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...
LOGCOM
2007
13 years 4 months ago
2007
Harvey Friedman introduced natural independence results for the Peano axioms via certain schemes of combinatorial well-foundedness. We consider here parameterized versions of this...
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...
LOGCOM
2007
13 years 4 months ago
2007
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 ...
LOGCOM
2007
13 years 4 months ago
2007
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...
LOGCOM
2007
13 years 4 months ago
2007
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...
LOGCOM
2007
13 years 4 months ago
2007
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...
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
Structural causal models offer a popular framework for exploring causal concepts. However, due to their limited expressiveness, structural models have difficulties coping with su...
LOGCOM
2007
13 years 4 months ago
2007
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 ...