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ț: 1114.65 lei
- 20% Preț: 996.22 lei
- 18% Preț: 957.13 lei
- 15% Preț: 646.75 lei
- 18% Preț: 1225.62 lei
- 18% Preț: 956.33 lei
- 18% Preț: 957.44 lei
- 18% Preț: 959.98 lei
- 15% Preț: 639.73 lei
- 18% Preț: 945.79 lei
- 18% Preț: 949.55 lei
- 18% Preț: 952.40 lei
- 15% Preț: 637.13 lei
- 15% Preț: 639.59 lei
- 20% Preț: 1001.86 lei
- 15% Preț: 645.28 lei
- 18% Preț: 957.32 lei
- 15% Preț: 649.06 lei
- 18% Preț: 953.20 lei
- 15% Preț: 589.65 lei
- 15% Preț: 648.74 lei
- 18% Preț: 1117.99 lei
- 18% Preț: 956.03 lei
- 18% Preț: 953.65 lei
Preț: 338.03 lei
Preț vechi: 422.53 lei
-20% Nou
Puncte Express: 507
Preț estimativ în valută:
64.70€ • 67.29$ • 54.22£
64.70€ • 67.29$ • 54.22£
Carte tipărită la comandă
Livrare economică 13-27 martie
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.