## Bulletin of Informatics and Cybernetics, Volumes 24-25 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Pseudo Extension and Belief Revision in Default Reasoning | 15 |

Completeness of Diamondresolution in Ortype Knowledge Bases Hiroshi Sakai | 27 |

Stable Configurations in Cell Space under the Threshold Type Transition Rule | 39 |

4 other sections not shown

### Common terms and phrases

algorithm analysis approximate extensions Arikawa assume assumption asymptotic atom Banach spaces basic cell space belief revision cellular automata characteristic numbers clause closed default theory closed wffs computation consider constraints construction convergence convex convex function Corollary covariance matrix defined definite program denote depth-bounded derivation procedure equation example exists finite fuzzy numbers given goal graph reduction graph terms Gx(y Hence holds inter-construction iterations kernel Kyushu University Lemma linear linear programming locally weak reducing logic programs Markov strategies mathematical method model inference morphism multiset multivariate normal distribution node non-isolated stable configurations normal distribution obtain optimal or-type knowledge base paradoxical parallel reduction parameters pattern polynomial positive integer predicate symbols Proof pseudo extensions recursive refinement relation respectively result Russellian proposition sample satisfies Science sequence similarity matrix Statist stochastic approximation transition rule variables vector