View in EDS

A game-theoretic characterization of Boolean grammars

Saved in:
Bibliographic Details
Title: A game-theoretic characterization of Boolean grammars
Authors: Kountouriotis, Vassilis1 bk@di.uoa.gr, Nomikos, Christos2 cnomikos@cs.uoi.gr, Rondogiannis, Panos1 prondo@di.uoa.gr
Source: Theoretical Computer Science. Mar2011, Vol. 412 Issue 12-14, p1169-1183. 15p.
Subjects: Game theory, Formal languages, Semantics, Computer science, Grammar, Linguistic context
Abstract: Abstract: We obtain a simple, purely game-theoretic characterization of Boolean grammars [A. Okhotin, Boolean grammars, Information and Computation, 194(1) (2004) 19–48]. In particular, we propose a two-player infinite game of perfect information for Boolean grammars, which is equivalent to their well-founded semantics. The game is directly applicable to the simpler classes of conjunctive and context-free grammars, and offers a promising new connection between game theory and formal languages. [Copyright &y& Elsevier]
Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 57872825
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A game-theoretic characterization of Boolean grammars
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Kountouriotis%2C+Vassilis%22">Kountouriotis, Vassilis</searchLink><relatesTo>1</relatesTo><i> bk@di.uoa.gr</i><br /><searchLink fieldCode="AR" term="%22Nomikos%2C+Christos%22">Nomikos, Christos</searchLink><relatesTo>2</relatesTo><i> cnomikos@cs.uoi.gr</i><br /><searchLink fieldCode="AR" term="%22Rondogiannis%2C+Panos%22">Rondogiannis, Panos</searchLink><relatesTo>1</relatesTo><i> prondo@di.uoa.gr</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Theoretical+Computer+Science%22">Theoretical Computer Science</searchLink>. Mar2011, Vol. 412 Issue 12-14, p1169-1183. 15p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Game+theory%22">Game theory</searchLink><br /><searchLink fieldCode="DE" term="%22Formal+languages%22">Formal languages</searchLink><br /><searchLink fieldCode="DE" term="%22Semantics%22">Semantics</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+science%22">Computer science</searchLink><br /><searchLink fieldCode="DE" term="%22Grammar%22">Grammar</searchLink><br /><searchLink fieldCode="DE" term="%22Linguistic+context%22">Linguistic context</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Abstract: We obtain a simple, purely game-theoretic characterization of Boolean grammars [A. Okhotin, Boolean grammars, Information and Computation, 194(1) (2004) 19–48]. In particular, we propose a two-player infinite game of perfect information for Boolean grammars, which is equivalent to their well-founded semantics. The game is directly applicable to the simpler classes of conjunctive and context-free grammars, and offers a promising new connection between game theory and formal languages. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=57872825
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.tcs.2010.12.051
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 15
        StartPage: 1169
    Subjects:
      – SubjectFull: Game theory
        Type: general
      – SubjectFull: Formal languages
        Type: general
      – SubjectFull: Semantics
        Type: general
      – SubjectFull: Computer science
        Type: general
      – SubjectFull: Grammar
        Type: general
      – SubjectFull: Linguistic context
        Type: general
    Titles:
      – TitleFull: A game-theoretic characterization of Boolean grammars
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Kountouriotis, Vassilis
      – PersonEntity:
          Name:
            NameFull: Nomikos, Christos
      – PersonEntity:
          Name:
            NameFull: Rondogiannis, Panos
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 18
              M: 03
              Text: Mar2011
              Type: published
              Y: 2011
          Identifiers:
            – Type: issn-print
              Value: 03043975
          Numbering:
            – Type: volume
              Value: 412
            – Type: issue
              Value: 12-14
          Titles:
            – TitleFull: Theoretical Computer Science
              Type: main
ResultId 1