Titlebook: Logical Foundations of Computer Science; 4th International Sy Sergei Adian,Anil Nerode Conference proceedings 1997 Springer-Verlag Berlin H

微塵

978-3-540-63045-6Springer-Verlag Berlin Heidelberg 1997

Rankle

Logical Foundations of Computer Science978-3-540-69065-8Series ISSN 0302-9743 Series E-ISSN 1611-3349

flamboyant

craven

Generic queries over quasi-,-minimal domains,umbers together with the ternary relation + of addition. In the focus of our study are the first order (FO) queries that are invariant under order-preserving “permutations” — such queries are called order-generic. It has recently been discovered that for some domains order-generic FO queries fail to

輕浮女

Chronological

易于

Recognition of deductive data base stability,ty constraints restoration after updates fit this general frame. We explore the computational complexity of the problem of stability of a deductive data base in a given DB state with respect to its medium.

Decline

The concurrency complexity for the Horn fragment of linear logic,oposed in [2] and establish the complexity of the provability problem and the problem of concurrency recognition. The notion of .-maximal concurrency is introduced which guarantees polynomial time provability. Theorems on hierarchy and on complexity of recognition of the property are proved.

Surgeon

Learning small programs with additional information,ogram for this function. In [FBW 94] it was discovered that if “l(fā)earning” is understood as “identification in the limit,” then in some programming languages it is possible to learn a program of size not exceeding the bound, while in some other programming languages this is not possible..We have stud

ascend