Logic, Language, Information and Computation
Springer Berlin (Verlag)
978-3-540-73443-7 (ISBN)
A Grammatical Representation of Visibly Pushdown Languages.- Fully Lexicalized Pregroup Grammars.- Bounded Lattice T-Norms as an Interval Category.- Towards Systematic Analysis of Theorem Provers Search Spaces: First Steps.- Continuation Semantics for Symmetric Categorial Grammar.- Ehrenfeucht-Fraïssé Games on Linear Orders.- Hybrid Logical Analyses of the Ambient Calculus.- Structured Anaphora to Quantifier Domains: A Unified Account of Quantificational and Modal Subordination.- On Principal Types of BCK-?-Terms.- A Finite-State Functional Grammar Architecture.- Pregroup Calculus as a Logic Functor.- A Formal Calculus for Informal Equality with Binding.- Formal Verification of an Optimal Air Traffic Conflict Resolution and Recovery Algorithm.- An Introduction to Context Logic.- Numerical Constraints for XML.- Modules over Monads and Linearity.- Hydra Games and Tree Ordinals.- Spin Networks, Quantum Topology and Quantum Computation.- Symmetries in Natural Language Syntax and Semantics: The Lambek-Grishin Calculus.- Computational Interpretations of Classical Linear Logic.- Autonomous Programmable Biomolecular Devices Using Self-assembled DNA Nanostructures.- Interval Valued QL-Implications.- Behavioural Differential Equations and Coinduction for Binary Trees.- A Sketch of a Dynamic Epistemic Semiring.- A Modal Distributive Law (abstract).- Ant Colony Optimization with Adaptive Fitness Function for Satisfiability Testing.
Erscheint lt. Verlag | 15.6.2007 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | X, 366 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 575 g |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik | |
Mathematik / Informatik ► Mathematik ► Analysis | |
Schlagworte | adaptive functions • algorithhms • algorithm • Algorithm analysis and problem complexity • algorithms • ant colony optimization • Automata • Calculi • Calculus • classical computability • Complexity theory • Computational Logic • Computational modeling • constructive mathemaitics • Constructive Mathematics • decision procedure • Erfüllbarkeitsproblem der Aussagenlogik • Formal Languages • formal methods • Formal Verification • fuzzy lo • Fuzzy Logic • Genetic algorithms • Grammars • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Hybrid Logic • Inductive Inference • Local Search • Logic • methodology of computing • Model Checking • operational checking • operattional semantics • Optimization • pregroups • Proof theory • Quantum Computation • randomness • recursion theory • Simulation • Static Analysis • Type Theory • verification |
ISBN-10 | 3-540-73443-0 / 3540734430 |
ISBN-13 | 978-3-540-73443-7 / 9783540734437 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich