Logic for Programming and Automated Reasoning
Editat de Michel Parigot, Andrei Voronkoven Limba Engleză Paperback – 23 oct 2000
Preț: 387.47 lei
Nou
Puncte Express: 581
Preț estimativ în valută:
68.55€ • 79.87$ • 59.86£
68.55€ • 79.87$ • 59.86£
Carte tipărită la comandă
Livrare economică 17-31 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540412854
ISBN-10: 3540412859
Pagini: 508
Ilustrații: XIV, 490 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.76 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540412859
Pagini: 508
Ilustrații: XIV, 490 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.76 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Nonmononic reasoning.- On the Complexity of Theory Curbing.- Descriptive complexity.- Graph Operations and Monadic Second-Order Logic: A Survey.- Efficient First Order Functional Program Interpreter with Time Bound Certifications.- Specification and automatic proof-assistants.- Encoding Temporal Logics in Executable Z: A Case Study for the ZETA System.- Behavioural Constructor Implementation for Regular Algebras.- An Extensible Proof Text Editor.- A Tactic Language for the System Coq.- Theorem proving.- Proof Simplification for Model Generation and Its Applications.- Have SPASS with OCC1N = g .- Verification.- Compiling and Verifying Security Protocols.- Equational Binary Decision Diagrams.- A PVS Proof Obligation Generator for Lustre Programs.- Logic programming and CLP.- Efficient Structural Information Analysis for Real CLP Languages.- Playing Logic Programs with the Alpha-Beta Algorithm.- Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison.- Nonclassical logics and lambda calculus.- Quantified Propositional Gödel Logics.- Proof-Search in Implicative Linear Logic as a Matching Problem.- A New Model Construction for the Polymorphic Lambda Calculus.- Church’s Lambda Delta Calculus.- Logic and databases.- Querying Inconsistent Databases.- How to Decide Query Containment under Constraints Using a Description Logic.- Program analysis.- Static Reduction Analysis for Imperative Object Oriented Languages.- An Abstract Interpretation Approach to Termination of Logic Programs.- Using an Abstract Representation to Specialize Functional Logic Programs.- Binding-Time Analysis by Constraint Solving.- Mu-calculus.- Efficient Evaluation Methods for Guarded Logics and Datalog LITE.- On the Alternation-Free Horn ?-Calculus.-Planning and reasoning about actions.- The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus.- Solving Planning Problems by Partial Deduction.- A Kripkean Semantics for Dynamic Logic Programming.
Caracteristici
Includes supplementary material: sn.pub/extras