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网络公开度




书目名称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读者反馈




书目名称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