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
- 23% Preț: 600.38 lei
- 18% Preț: 1082.63 lei
- 20% Preț: 967.62 lei
- 18% Preț: 929.66 lei
- 15% Preț: 628.24 lei
- 18% Preț: 1190.42 lei
- 18% Preț: 928.88 lei
- 18% Preț: 929.96 lei
- 18% Preț: 932.43 lei
- 15% Preț: 621.40 lei
- 18% Preț: 918.66 lei
- 18% Preț: 922.30 lei
- 18% Preț: 925.07 lei
- 15% Preț: 618.89 lei
- 15% Preț: 621.27 lei
- 20% Preț: 973.09 lei
- 15% Preț: 626.81 lei
- 18% Preț: 929.83 lei
- 15% Preț: 630.48 lei
- 18% Preț: 925.85 lei
- 15% Preț: 572.79 lei
- 15% Preț: 630.17 lei
- 18% Preț: 1085.89 lei
- 18% Preț: 928.58 lei
- 18% Preț: 920.17 lei
Preț: 328.39 lei
Preț vechi: 410.49 lei
-20% Nou
Puncte Express: 493
Preț estimativ în valută:
62.85€ • 65.51$ • 52.32£
62.85€ • 65.51$ • 52.32£
Carte tipărită la comandă
Livrare economică 06-20 ianuarie 25
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.