-
1
-
-
26944480924
-
Extensions of Simple Conceptual Graphs: The Complexity of Rules and Constraints
-
Baget and Mugnier
-
Baget and Mugnier (2002) Baget, J.-F., and Mugnier, M.-L. Extensions of Simple Conceptual Graphs: the Complexity of Rules and Constraints. Jour. of Artif. Intell. Res. 16:425-465.
-
(2002)
Jour. of Artif. Intell. Res.
, vol.16
, pp. 425-465
-
-
Baget, J.-F.1
Mugnier, M.-L.2
-
2
-
-
0000015099
-
Conceptual graphs: Fundamental notions
-
Chein and Mugnier
-
Chein and Mugnier (1992) Chein, M., and Mugnier, M.-L. Conceptual graphs: Fundamental notions. Revue d'Intelligence Artificielle 6(4):365
-
(1992)
Revue d'Intelligence Artificielle
, vol.6
, Issue.4
, pp. 365
-
-
Chein, M.1
Mugnier, M.-L.2
-
5
-
-
0003100354
-
Computational Interpretations of the Gricean Maximes in the Generation of Referring Expressions
-
Dale and Reiter
-
Dale and Reiter (1995) Robbert Dale and Ehud Reiter. Computational Interpretations of the Gricean Maximes in the Generation of Referring Expressions. Cognitive Science 18: 233-263.
-
(1995)
Cognitive Science
, vol.18
, pp. 233-263
-
-
Dale, R.1
Reiter, E.2
-
7
-
-
0042378596
-
Graph-based Generation of Referring Expressions
-
Krahmer et al To appear in
-
Krahmer et al (2003). Krahmer,E. van Erk,S. and Verleg,A. Graph-based Generation of Referring Expressions. To appear in Computational Linguistics 29 (1):53-72.
-
(2003)
Computational Linguistics
, vol.29
, Issue.1
, pp. 53-72
-
-
Krahmer, E.1
Van Erk, S.2
Verleg, A.3
-
8
-
-
84880868863
-
Sentence Generation from Conceptual Graphs
-
Nicolov et al. Conceptual Structures: Applications, Implementation and Theory. Berlin: Springer
-
Nicolov et al. (1995) Nicolov, N., C.Mellish, and G.Ritchie. Sentence Generation from Conceptual Graphs. In Conceptual Structures: Applications, Implementation and Theory . (LNAI 954), p.74-88. Berlin: Springer.
-
(1995)
LNAI
, vol.954
, pp. 74-88
-
-
Nicolov, N.1
Mellish, C.2
Ritchie, G.3
-
10
-
-
0040671641
-
Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm
-
March 2002
-
van Deemter (2002) Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm. Computational Linguistics 28 (1), pp.37-52. March 2002.
-
(2002)
Computational Linguistics
, vol.28
, Issue.1
, pp. 37-52
-
-
Van Deemter1
-
11
-
-
41449097531
-
Graphs and Booleans: On the generation of referring expressions
-
van Deemter and Krahmer (IN PRESS). To appear in "Studies in Linguistics and Philosophy" series, Kluwer, Dordrecht
-
van Deemter and Krahmer (IN PRESS). K. van Deemter and E.Krahmer. Graphs and Booleans: on the generation of referring expressions". To appear in "Computing Meaning, Volume 3", "Studies in Linguistics and Philosophy" series, Kluwer, Dordrecht.
-
Computing Meaning
, vol.3
-
-
Van Deemter, K.1
Krahmer, E.2
|