Bibliothek

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • PACS. 75.10.Hk Classical spin models – 75.10.Nr Spin-glass and other random models – 89.70.+c Information science  (1)
  • modal logic  (1)
Materialart
Erscheinungszeitraum
Schlagwörter
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    The European physical journal 23 (2001), S. 121-136 
    ISSN: 1434-6036
    Schlagwort(e): PACS. 75.10.Hk Classical spin models – 75.10.Nr Spin-glass and other random models – 89.70.+c Information science
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Physik
    Notizen: Abstract: Gallager codes are the best error-correcting codes to date. In this paper we study them by using the tools of statistical mechanics. The corresponding statistical mechanics model is a spin model on a sparse random graph. The model can be solved by elementary methods (i.e. without replicas) in a large connectivity limit. For low enough temperatures it presents a completely frozen glassy phase (q EA = 1). The same scenario is shown to hold for finite connectivities. In this case we adopt the replica approach and exhibit a one-step replica symmetry breaking order parameter. We argue that our ansatz yields the exact solution of the model. This allows us to determine the whole phase diagram and to understand the performances of Gallager codes.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Journal of automated reasoning 15 (1995), S. 317-337 
    ISSN: 1573-0670
    Schlagwort(e): modal logic ; translation methods ; set theory ; theorem proving
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract The paper presents aset-theoretic translation method for polymodal logics that reduces derivability in a large class of propositional polymodal logics to derivability in a very weak first-order set theory Ω. Unlike most existing translation methods, the one we propose applies to any normal complete finitely axiomatizable polymodal logic, regardless of whether it is first-order complete or an explicit semantics is available. The finite axiomatizability of Ω allows one to implement mechanical proof-search procedures via the deduction theorem. Alternatively, more specialized and efficient techniques can be employed. In the last part of the paper, we briefly discuss the application ofset T-resolution to support automated derivability in (a suitable extension of) Ω.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...