SFr. 70.00
€ 75.60


bestellen

Artikel-Nr. 5085236


Diesen Artikel in meine
Wunschliste
Diesen Artikel
weiterempfehlen
Diesen Preis
beobachten

Weitersagen:


Herausgeber: 
  • Andrei Voronkov
  • Moshe Vardi
  • Logic for Programming, Artificial Intelligence, and Reasoning: 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, Pr 
     

    (Buch)
    Dieser Artikel gilt, aufgrund seiner Grösse, beim Versand als 3 Artikel!


    Übersicht

    Auf mobile öffnen
     
    Lieferstatus:   Auf Bestellung (Lieferzeit unbekannt)
    Veröffentlichung:  September 2003  
    Genre:  EDV / Informatik 
     
    Artificial Intelligence / C / Computer architecture & logic design / Computer logic / Computer programming / Computer programming / software engineering / computer science / Computer Science Logic and Foundations of Programming
    ISBN:  9783540201014 
    EAN-Code: 
    9783540201014 
    Verlag:  Springer EN 
    Einband:  Kartoniert  
    Sprache:  English  
    Serie:  Lecture Notes in Artificial Intelligence
    #2850 - Lecture Notes in Computer Science  
    Dimensionen:  H 233 mm / B 155 mm / D  
    Gewicht:  1400 gr 
    Seiten:  436 
    Illustration:  XI, 436 p. 
    Zus. Info:  EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025. 
    Bewertung: Titel bewerten / Meinung schreiben
    Inhalt:
    From Tableaux to Automata for Description Logics.- Disproving False Conjectures.- A Formal Proof of Dickson's Lemma in ACL2.- Imperative Object-Based Calculi in Co-inductive Type Theories.- Congruence Closure with Integer Offsets.- A Machine-Verified Code Generator.- A Translation Characterizing the Constructive Content of Classical Theories.- Extensions of Non-standard Inferences to Description Logics with Transitive Roles.- Extended Canonicity of Certain Topological Properties of Set Spaces.- Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics.- Improving Dependency Pairs.- On Closure under Complementation of Equational Tree Automata for Theories Extending AC.- Completeness of E-Unification with Eager Variable Elimination.- Computable Numberings.- Handling Equality in Monodic Temporal Resolution.- Once upon a Time in the West.- Ordered Diagnosis.- Computing Preferred Answer Sets in Answer Set Programming.- A Syntax-Based Approach to Reasoning about Actions and Events.- Minimizing Automata on Infinite Words.- Gandy's Theorem for Abstract Structures without the Equality Test.- Efficient SAT Engines for Concise Logics: Accelerating Proof Search for Zero-One Linear Constraint Systems.- NP-Completeness Results for Deductive Problems on Stratified Terms.- Is Cantor's Theorem Automatic?.- Automatic Structures of Bounded Degree.- An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems.- A Logical Study on Qualitative Default Reasoning with Probabilities.- On Structuring Proof Search for First Order Linear Logic.- Strict Geometry of Interaction Graph Models.- Connection-Based Proof Construction in Non-commutative Logic.

      



    Wird aktuell angeschaut...
     

    Zurück zur letzten Ansicht


    AGB | Datenschutzerklärung | Mein Konto | Impressum | Partnerprogramm
    Newsletter | 1Advd.ch RSS News-Feed Newsfeed | 1Advd.ch Facebook-Page Facebook | 1Advd.ch Twitter-Page Twitter
    Forbidden Planet AG © 1999-2026
    Alle Angaben ohne Gewähr
     
    SUCHEN

     
     Kategorien
    Im Sortiment stöbern
    Genres
    Hörbücher
    Aktionen
     Infos
    Mein Konto
    Warenkorb
    Meine Wunschliste
     Kundenservice
    Recherchedienst
    Fragen / AGB / Kontakt
    Partnerprogramm
    Impressum
    © by Forbidden Planet AG 1999-2026