Frontiers of Combining Systems: First International Workshop, Munich, March 1996: Applied Logic Series, cartea 3
Editat de F. Baader, K.U. Schulzen Limba Engleză Paperback – 21 apr 2014
Din seria Applied Logic Series
- 18%
Preț: 1170.76 lei - 20%
Preț: 957.51 lei - 18%
Preț: 919.98 lei - 15%
Preț: 621.80 lei - 18%
Preț: 1177.92 lei - 18%
Preț: 919.21 lei - 18%
Preț: 920.28 lei - 18%
Preț: 922.72 lei - 15%
Preț: 615.05 lei - 18%
Preț: 909.08 lei - 18%
Preț: 912.69 lei - 18%
Preț: 915.43 lei - 15%
Preț: 612.55 lei - 15%
Preț: 614.90 lei - 20%
Preț: 962.94 lei - 15%
Preț: 620.38 lei - 18%
Preț: 920.13 lei - 15%
Preț: 624.01 lei - 18%
Preț: 916.19 lei - 15%
Preț: 566.94 lei - 15%
Preț: 623.70 lei - 18%
Preț: 1074.51 lei - 18%
Preț: 918.90 lei - 18%
Preț: 916.64 lei - 18%
Preț: 912.85 lei
Preț: 325.15 lei
Preț vechi: 406.44 lei
-20% Nou
Puncte Express: 488
Preț estimativ în valută:
57.53€ • 67.02$ • 50.24£
57.53€ • 67.02$ • 50.24£
Carte tipărită la comandă
Livrare economică 19 ianuarie-02 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9789401066433
ISBN-10: 9401066434
Pagini: 408
Ilustrații: XI, 388 p. 6 illus.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.57 kg
Ediția:1996
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Applied Logic Series
Locul publicării:Dordrecht, Netherlands
ISBN-10: 9401066434
Pagini: 408
Ilustrații: XI, 388 p. 6 illus.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.57 kg
Ediția:1996
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Applied Logic Series
Locul publicării:Dordrecht, Netherlands
Public țintă
ResearchCuprins
Preface. An Overview of Fibred Semantics and the Combination of Logics; D.M. Gabbay. Generalising Propositional Modal Logic Using Labelled Deductive Systems; A. Russo. A Topography of Labelled Modal Logics; D. Basin, et al. Combining Classical and Intuitionistic Logic, or: Intuitionistic Implication as a Conditional; L. Fariñas del Cerro, A. Herzig. A New Correctness Proof of the Nelson-Oppen Combination Procedure; C. Tinelli, M. Harandi. Cooperation of Decision Procedures for the Satisfiability Problem; C. Ringeissen. Combining Finite Model Generation with Theorem Proving: Problems and Prospects; J. Slaney, T. Surendonk. Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems; F. Giunchiglia, et al. Natural Language Presentation and Combination of Automatically Generated Proofs; B.I. Dahn, A. Wolf. Symbolic Computation: Computer Algebra and Logic; B. Buchberger. Classification of Communication and Cooperation Mechanisms for Logical and Symbolic Computation Systems; J. Calmet, K. Homann. Logic Tuple Spaces for the Coordination of Heterogeneous Agents; E. Denti, et al. Integration Systems and Interaction Spaces; C. Landauer, K.L. Bellman. Combining Constraint Solvers in a Meta CLP Architecture; E. Lamma, et al. Membership-Constraints and Complexity in Logic Programming with Sets; F. Stolzenburg. Integrating Lists, Multisets, and Sets in a Logic Programming Framework; A. Dovier, et al. CLP(chi) for Proving Program Properties; F. Mesnard, et al. First-Order Constrained Lambda Calculus; J.N. Crossley, et al. Unified Relational Framework for Programming Paradigm Combination; N. Habra, B. le Charlier. Model Checking ACTL Constrained Processes; Xiao Jun Chen.