Marknadens största urval
Fri frakt över 199 kr
Snabb leverans
Hjälp
Logga in
  1. Hem
  2. Böcker
  3. Företagande & lärande
  4. Data & IT
  5. The Logic of Typed Feature Structures

The Logic of Typed Feature Structures

- With Applications to Unification Grammars, Logic Programs and Constraint Resolution

av Robert L. (Carnegie Mellon University Carpenter

del av Cambridge Tracts in Theoretical Computer Science-serien

The Logic of Typed Feature Structures av Robert L. (Carnegie Mellon University Carpenter
Om The Logic of Typed Feature Structures

This book develops the theory of typed feature structures, a data structure that generalizes both first-order terms and feature structures of unification-based grammars to include inheritance, typing, inequality, cycles and intensionality. The resulting synthesis serves as a logical foundation for grammars, logic programming and constraint-based reasoning systems.

Visa mer
  • Språk:
  • Engelska
  • ISBN:
  • 9780521022545
  • Format:
  • Häftad
  • Sidor:
  • 280
  • Utgiven:
  • 10. november 2005
  • Mått:
  • 170x245x15 mm.
  • Vikt:
  • 453 g.
  Fri leverans
Leveranstid: 2-4 veckor
Förväntad leverans: 17. december 2024

Om Robert L. (Carnegie Mellon University Carpenter

Se alla böcker av Robert L. (Carnegie Mellon University Carpenter

Beskrivning av The Logic of Typed Feature Structures

This book develops the theory of typed feature structures, a data structure that generalizes both first-order terms and feature structures of unification-based grammars to include inheritance, typing, inequality, cycles and intensionality. The resulting synthesis serves as a logical foundation for grammars, logic programming and constraint-based reasoning systems.

Användarnas betyg av The Logic of Typed Feature Structures



Andra köpte även...
Hitta liknande böcker
Boken The Logic of Typed Feature Structures finns i följande kategorier:

Gör som tusentals andra bokälskare

Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.