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

積聚

書目名稱Logical Foundations of Computer Science影響因子(影響力)




書目名稱Logical Foundations of Computer Science影響因子(影響力)學科排名




書目名稱Logical Foundations of Computer Science網(wǎng)絡公開度




書目名稱Logical Foundations of Computer Science網(wǎng)絡公開度學科排名




書目名稱Logical Foundations of Computer Science被引頻次




書目名稱Logical Foundations of Computer Science被引頻次學科排名




書目名稱Logical Foundations of Computer Science年度引用




書目名稱Logical Foundations of Computer Science年度引用學科排名




書目名稱Logical Foundations of Computer Science讀者反饋




書目名稱Logical Foundations of Computer Science讀者反饋學科排名

alcoholism

疲勞

Complexity of query answering in logic databases with complex values,P. In particular, logic programs with trees, bags and finite sets satisfy this condition. We also show that the query answering problem for non-recursive range restricted logic programs is NEXP-hard. Thereby, the query answering problem for logic databases with trees, bags and sets turns out to be NEXP-complete.

Blazon

Finite bases of admissible rules for the logic ,5,,, finite. Moreover, the universal theory of the free algebra of any .5..-logic is decidable. It is shown also that any .5..-logic λ with the adjoined inference rule .is structurally complete and that logic has the same set of theorems as the logic λ.

Frisky

Towards a theory of recursive structures,ions between the descriptive complexity of finitary problems and the computational complexity of their infinitary analogues, (iii) completeness for query languages, (iv) descriptive and computational complexity, and (v) zero-one laws.

天文臺

morale

流動性

Topological semantics for hybrid systems,ogies on state spaces, that finite automata have to work relative to finite space quotient topologies, and that one needs to respect observational equivalence to get correctness proofs that allow small variations, which means using Intuitionistic deductions.

Lipoprotein

,Cut elimination for the second order propositional logic with Hilbert’s ε-symbol, extensionality, ae for the second order propositional logic with Hilbert‘s .-symbol, extensionality and full comprehension..We prove that selective elimination of the .-symbol and quantifiers is possible, so that a cut formula becomes essentially quantifier- and epsilon-free, after which cuts can be eliminated by the standard Gentzen procedure.

PAEAN