메뉴 건너뛰기




Volumn 33, Issue 2, 2007, Pages 153-160

Maximal consistent subsets

Author keywords

[No Author keywords available]

Indexed keywords

CONSISTENT SUBSET; FEATURE STRUCTURE; HEURISTIC OPTIMIZATION; NP COMPLETE; ORDERS OF MAGNITUDE; RUNNING TIME; SEARCH SPACES; UNIFICATION OPERATIONS;

EID: 34347335586     PISSN: 08912017     EISSN: 15309312     Source Type: Journal    
DOI: 10.1162/coli.2007.33.2.153     Document Type: Article
Times cited : (18)

References (23)
  • 2
    • 34347337648 scopus 로고    scopus 로고
    • Scoring for overlay based on informational distance
    • Vienna, Austria
    • Alexandersson, Jan, Tilman Becker, and Norbert Pfleger. 2004. Scoring for overlay based on informational distance. In Proceedings of KONVENS 2004, pages 1-4, Vienna, Austria.
    • (2004) Proceedings of KONVENS 2004 , pp. 1-4
    • Alexandersson, J.1    Becker, T.2    Pfleger, N.3
  • 4
    • 0001159084 scopus 로고
    • Approximating maximum independent sets by excluding subgraphs
    • Boppana, Ravi and Magnús M. Halldórsson. 1992. Approximating maximum independent sets by excluding subgraphs. BIT Numerical Mathematics, 32(2):180-196.
    • (1992) BIT Numerical Mathematics , vol.32 , Issue.2 , pp. 180-196
    • Boppana, R.1    Halldórsson, M.M.2
  • 5
    • 85055256831 scopus 로고
    • Feature structures and nonmonotonicity
    • Bouma, Gosse. 1992. Feature structures and nonmonotonicity. Computational Linguistics, 18 (2):183-204.
    • (1992) Computational Linguistics , vol.18 , Issue.2 , pp. 183-204
    • Bouma, G.1
  • 6
    • 34347338740 scopus 로고    scopus 로고
    • Unification: Classical and default
    • Keith Brown, editor, Elsevier, New York
    • Bouma, Gosse. 2006. Unification: Classical and default. In Keith Brown, editor, Encyclopedia of Language and Linguistics. Elsevier, New York.
    • (2006) Encyclopedia of Language and Linguistics
    • Bouma, G.1
  • 8
    • 34347341727 scopus 로고
    • Feature-value logics: Some limits on the role of defaults
    • C. J. Rupp, Mike Rosner, and Rod Johnson, editors, Academic Press, London
    • Calder, Jonathan. 1993. Feature-value logics: Some limits on the role of defaults. In C. J. Rupp, Mike Rosner, and Rod Johnson, editors, Constraints, Language and Computation. Academic Press, London, pages 20-32.
    • (1993) Constraints, Language and Computation , pp. 20-32
    • Calder, J.1
  • 9
    • 0039624099 scopus 로고
    • Skeptical and creduluous default unification with applications to templates and inheritance
    • Ted Briscoe, Anne Copestake, and Valerie de Paiva, editors, Cambridge University Press, Cambridge, UK
    • Carpenter, Bob. 1992. Skeptical and creduluous default unification with applications to templates and inheritance. In Ted Briscoe, Anne Copestake, and Valerie de Paiva, editors, Default Inheritance within Unification-Based Approaches to the Lexicon. Cambridge University Press, Cambridge, UK, pages 13-37.
    • (1992) Default Inheritance within Unification-Based Approaches to the Lexicon , pp. 13-37
    • Carpenter, B.1
  • 10
    • 0039624100 scopus 로고
    • Defaults in lexical representation
    • E. J. Briscoe, A. Copestake, and V. de Paiva, editors, Cambridge University Press, Cambridge, UK
    • Copestake, Ann. 1993. Defaults in lexical representation. In E. J. Briscoe, A. Copestake, and V. de Paiva, editors, Inheritance, Defaults and the Lexicon. Cambridge University Press, Cambridge, UK, pages 223-245.
    • (1993) Inheritance, Defaults and the Lexicon , pp. 223-245
    • Copestake, A.1
  • 15
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • R. E. Miller and J. W. Thatcher, editors, Plenum Press, New York
    • Karp, Richard. 1972. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations. Plenum Press, New York, pages 85-103.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.1
  • 17
    • 0039621575 scopus 로고    scopus 로고
    • Default representation in constraint-based frameworks
    • Lascarides, Alex and Ann Copestake. 1999. Default representation in constraint-based frameworks. Computational Linguistics, 25:55-105.
    • (1999) Computational Linguistics , vol.25 , pp. 55-105
    • Lascarides, A.1    Copestake, A.2
  • 19
    • 18744384409 scopus 로고    scopus 로고
    • A set-theoretic approach for the induction of inheritance hierarchies
    • Petersen, Wiebke. 2004. A set-theoretic approach for the induction of inheritance hierarchies. Electronic Notes in Theoretical Computer Science, 53:296-308.
    • (2004) Electronic Notes in Theoretical Computer Science , vol.53 , pp. 296-308
    • Petersen, W.1
  • 21
    • 4243753087 scopus 로고    scopus 로고
    • Prüst, Hub, Remko Scha, and Martin van den Berg. 1994. Discourse grammar and verb phrase anaphora. Linguistics and Philosophy, 17(3):261-327.
    • Prüst, Hub, Remko Scha, and Martin van den Berg. 1994. Discourse grammar and verb phrase anaphora. Linguistics and Philosophy, 17(3):261-327.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.