Result 41 to 60 of 84 total
Existence of the characteristic numbers associated with cellular automata with local transition rule 90. (English)
Bull. Inf. Cybern. 24, No.3-4, 121-136 (1991).
41
Completeness of dynamic time-bounded derivation for locally weak reducing programs. (English)
Bull. Inf. Cybern. 24, No.3-4, 93-109 (1991).
42
An optimal combination method of relations among scientific articles. (English)
Bull. Inf. Cybern. 24, No.1-2, 81-92 (1990).
43
Stable configurations in cell space under the threshold type transition rule. (English)
Bull. Inf. Cybern. 24, No.1-2, 39-52 (1990).
44
Pseudo extension and belief revision in default reasoning. (English)
Bull. Inf. Cybern. 24, No.1-2, 15-25 (1990).
45
Completeness of diamond-resolution in or-type knowledge bases. (English)
Bull. Inf. Cybern. 24, No.1-2, 27-37 (1990).
46
Model inference using bidirectional refinements. (English)
Bull. Inf. Cybern. 24, No.1-2, 1-13 (1990).
47
The dynamics on the cell spaces with p states under the local transformations satisfying the principle of local majority. (English)
Bull. Inf. Cybern. 23, No.3-4, 111-120 (1989).
48
A categorical model of $λ$-calculus based on de Bruijn’s name-free expressions. (English)
Bull. Inf. Cybern. 23, No.3-4, 129-140 (1989).
49
A reasoning system using inductive inference of analogical union. (English)
Bull. Inf. Cybern. 23, No.3-4, 121-128 (1989).
50
Finite derivative closure of partial functions and a method of inference. (English)
Bull. Inf. Cybern. 23, No.1-2, 89-93 (1988).
51
On intellectual question-answering with incomplete informations. (English)
Bull. Inf. Cybern. 23, No.1-2, 95-109 (1988).
52
Applications of relational calculus to computer mathematics. (English)
Bull. Inf. Cybern. 23, No.1-2, 67-78 (1988).
53
Indexing alternating finite automata and binary tree like circuits. (English)
Bull. Inf. Cybern. 23, No.1-2, 79-88 (1988).
54
Reasoning by analogy as a partial identity between models. (English)
Bull. Inf. Cybern. 22, 131-147 (1987).
55
An anatomy of abstraction. (English)
Bull. Inf. Cybern. 22, 179-188 (1987).
56
Inductive inference by iteratively working and consistent strategies with anomalies. (English)
Bull. Inf. Cybern. 22, 171-177 (1987).
57
A grammatical inference for context-free languages based on self- embedding. (English)
Bull. Inf. Cybern. 22, 149-163 (1987).
58
A symbolic calculus of regular expressions. (English)
Bull. Inf. Cybern. 22, 165-170 (1987).
59
Representation theorems and primitive predicates for logic programs. (English)
Bull. Inf. Cybern. 22, No.1-2, 19-37 (1986).
60
Result 41 to 60 of 84 total
Start
Contact
Print
General Help
