MS2. An executable,
cognitive model of knowledge construction was developed, and
applied to scheduling, parsing, error detection and correction, and to
medical applications. Our methodology
for parsing Property Grammars [Bès99,Bla01] invisibly interprets linguistic descriptions
as directly executable specifications, without sacrificing efficiency
[44]. It allows the construction
of non-connected structures that show all partial analyses even upon
failure. For diagnosis and repair [26], we use abduction in a novel,
direct way, without the overhead of alternating abductive
steps with resolution steps, as
in previous approaches. We have generalized these methodologies into a
directly executable constructivist cognitive model [45] which has been
applied to medical applications [42,43]. Applications to knowledge
extraction from biological text are studied in [52,56].
MS3.
Intelligent Software for Life Sciences: Since learning that my book on Logic Grammars
[3] was being extensively used around the world for the human genome
project [Ove92], I have been attracted to the intersection of these
fields. Inertia from my successes in my own area made it difficult to
pursue
this interest in earnest until Agriculture and Agri-Food
Canada (AAFC) recently asked for my help with their plant pathogen
identification problem. Their traditional methods could no longer keep
up with the dramatic increase, over the past decade, of collection
rates for biological data. Our results were spectacular: whereas with
previous tools, the processing time increases exponentially with
sequence length or number of sequences, we provided a novel algorithm
for which processing time increases linearly with the amount of data to
be analysed [M10]. Our methods
can moreover be viewed as modules to be
embedded within higher level while still
efficiently executable descriptions of other interesting molecular
biology problems (LifeIntel Explorer™). An invited article with our complete results has
been submitted in 2009 to Molecular Ecology Resources (see [16] under
Monographs). Constraint
based tools for biological sequence
analysis were developed as well with Maryam Bavarian [50].
MS4.
Methods
for the intelligent reconstruction of implicit human language structures
have been developed, both from an Assumptive logic [44] point of view
(see [2], which metagrammatically extends parsers so that implicit
structures are
understood from context), and from a constraint reasoning point of
view(
[43,45])
MS5. High level internet communication: [4,11,12] introduce badly needed high level features into internet programming, and
endows logic programming with remote high performance interaction capabilities.Through supervision, I have also contributed
to concept extraction from natural language, specifically, to the automatic reconstruction of the meaning of acronyms in web
texts (Manuel Zahariev, Gold Medal Award Winner, 2004 [S16], and through supervision and collaboration, to the recognition of named entities in biomedical text ([52 through 55, and Baohua Gu's PhD thesis, 2008 [S18]).
References
[Bès99] Bes, G. and Blache, P. (1999) Proprieties et analyse d'un langage. In Proc. TALN99.
[Bla0] Blache, P. and Balfourier, J.-M. (2001) Property Grammars: a Flexible Constraint-based Approach to Parsing.
In Proc. IWPT-2001.
[Chr05] Christiansen, H. (2005) CHR Grammars. International Journal in Theory and Practice of Logic Programming,
special issue on Constraint Handling Rules.
[Dah89] Abramson, H. and Dahl, V. (1989). Logic Grammars, Springer-Verlag.
[Ove92] Overbeek, R.A.(1992) Invited Tutorial: Logic Programming and Genetic Sequence Analysis, JICSLP, Washington, D.C.
2.1
ARTICLES IN REFEREED PUBLICATIONS
46. Dahl, V. and Maharshak, E. (in press) DNA Replication as a Model for Computational Linguistics. LNCS, Springer-Verlag.
45. Dahl, V., Gu, B. and Maharshak, E. (in press) A Hyprolog methodology for Property Grammars. LNCS, Springer-Verlag (monograph version of workshop paper [56]).
44. Zahariev, M., Dahl, V., Chen, W. and Levesque, A. (2009) Efficient Algorithms for the Discovery of DNA Oligonucleotide Barcodes from Sequence. To appear in: Molecular Ecology Resources.
43. Bavarian, M. and Dahl, V. (2006) Constraint-Based Methods for
Biological Sequence Analysis. In: Journal of Universal Computing Science,
vol. 12, issue 11.
42. Christiansen, H. and Dahl, V. (2003) Logic Grammars for Diagnosis and Repair. In: International Journal on Tools in AI, vol. 12, n. 3, pp. 227-248 (invited contribution: extension of a previous version which was selected as one of the best papers at ICTAI'02).
41. Dahl, V. (2002) On Implicit Meanings.
In: Computational Logic: From Logic Programming into the Future .
F. Sadri and T. Kakas (eds).
(invited contribution), volume in honour
of Bob Kowalski, Springer-Verlag.
40. Dahl, V. (2002) How to speak to your computer so that it will listen. In: C. R. Ramakrishnan and S. Krishnamurthi (eds.). Lecture Notes in Computing Science 2257, Springer-Verlag.
39. Tse, S. and Dahl, V. (2002) Learning and using mathematics the natural way. Applied Mathematics Letters.
38. Tarau, P. and Dahl, V. (2001) High level networking with mobile code and first order-And continuations. Theory and Practice of Logic Programming, 1(1), 359:380, March 2001, CUP.
37. Voll, K., Yeh, T. and Dahl, V. (2001) An Assumptive Logic Programming Methodology for Parsing. Journal of Artificial IntelligenceTools, vol. 10(4), 573:588 (invited contribution: extension of a previous version which was selected as one of the best papers at ICTAI'00).
36. Dahl, V. (1999) The logic of language. In: K. Apt, V. Marek and D.S. Warren (eds.) The Logic Programming Paradigm: A 25-year perspective. Springer-Verlag, pp. 429:451.
35. Dahl, V. (1999) From Speech to Knowledge. In: M.T.Pazienza (ed.) Information Extraction: towards scalable, adaptable systems. Springer-Verlag, LNAI (Lecture Notes in Artificial Intelligence) 1714, pp.49:75.
33. Dahl, V., Tarau, P., Accuosto, P., Rochefort, S. and Scurtescu, M. (1999) A Spanish Interface to LogiMOO - Towards Multilingual Virtual Worlds. Informatica, vol 2.
32. Tarau, P., De Bosschere, K., Dahl, V. and Rochefort, S. (1999) LogiMOO: An Extensible Multi-User Virtual World with Natural Language Control.Logic Programming Journal, 38(3), 331:353.
31. Dahl, V., Tarau,
P., Accuosto, P. , Rochefort,
S. and Scurtescu,
M. (1998) Assumption Grammars for Knowledge-Based Systems.
Informatica, 22(4), 435:444 (Invited
contribution: extension of a previous version which was selected as
one of the best papers at NLDB'97).
30. Tarau, P. and Dahl, V. (1998) A Coordination Logic for Agent Programming in Virtual Worlds. In: Conen, W. and Neumann, G. (Eds.), Coordination Technology for Collaborative Applications - Organizations, Processes, and Agents. Springer-Verlag, ISBN 3-540-64170-X.
27. Tarau, P.,
Dahl, V. and Fall, A. (1996) Backtrackable
State with Linear Affine Implication and Assumption Grammars. In: Lecture
Notes in Computer Science 1179, Springer Verlag:
Concurrency and parallelism, Programming, Networking, and Security. Jaffar, J. and
26
25. Dahl, V. (1995) Understanding and Translating Language-
Challenges of the 90's. AI Communications 8(2), ISSN
0921-7126: 71-77 (expanded version of
Calouste Gulbenkian
Award for Science and Technology
Address,
24. Huang, Y.N., Dahl, V. and Han, J.W. (1995) Fact Updates
in Logic Databases. Int. Journal of Software Engineering and
Knowledge Engineering, vol. 5, No. 3, pp. 467-491.
23. Tarau, P. and Dahl, V. (1995) Logic Programming and Logic Grammars with First-Order Continuations. LNCS Series, Springer-Verlag, vol. 883, pp. 213-229.
22. Abramson, H. and Dahl, V. (1995) Extending Logic Gramamars with ID-LP Specifications. In: A. Sobrino (ed.) Ensayos
sobre programacion
logica. Univ. de Santiago de Compostela Press, pp. 261-282.
20. Dahl, V. (1994) Natural language processing and logic
programming. Journal of Logic Programming, 12 (1), pp.
681-714, 1994 (invited contribution).
19. V. Dahl (1993) What the study of language can contribute to AI. AI Communications, 6(2):92-106.
18. V. Dahl, F. Popowich, and M. Rochemont (1993) A principled characterization of dislocated phrases: Capturing barriers with Static Discontinuity Grammars. Linguistics and Philosophy, 16(4):331-352, August 1993.
17. V. Dahl, G. Sidebottom, and J. Ueberla
(1993) Automatic configuration through constraint-based reasoning.
Int'l. Journal of Expert Systems: Research and Applications,
6(4):561-579.
16. V. Dahl. Comment on implementing
Government-Binding theories (1992) In R. Levine, editor, Formal
Linguistics: Theory and Practice, pages 276-289.
14. V. Dahl. Incomplete types for logic databases. Applied Mathematics Letters, 4(3):25-28, 1991.
13. V. Dahl. Describing linguistic knowledge about constraints in user-friendly ways. Int'l. Journal of Expert Systems: Research and Applications, 3(2):131-146, 1990.
12. V. Dahl and F. Popowich. Parsing and generation with Static Discontinuity Grammars. New Generation Computing, 8(3):245-274, December 1990.
11. Dahl, V. and Massicotte, P. (1990) Interpreting static
discontinuity grammars. Applied Mathematics Letters,
10. V. Dahl (1989) Discontinuous grammars. Computational Intelligence, 5(4):161-179, 1989.
9. H.
Abramson and V. Dahl
(1989) Logic
Grammars Research Monograph, Symbolic
Computation AI Series. Springer-Verlag,
1989.
8. V. Dahl and P.
Massicotte (1988) Processing
techniques for discontinuous grammars. In Meta-Programming for
Logic Programming, pages 141-156. MIT Press, 1988.
6. Dahl, V.
(1986) Logic
Programming for Constructive Expert Systems. Database Systems
and Applications. Benjamin/Cummings, 1986.
4. Dahl, V. and
McCord, M. C. (1983) Treating Coordination in Logic Grammars. American
Journal of Computational Linguistics 9(2): 69-91.
2. V. Dahl. On
database systems development through logic (1982) ACM
Transactions
on Database Systems, 7(1):102-123.
Articles
in Refereed Conference/Workshops Proceedings: Published or Accepted
57.
Bel Enguix, G., Jimenez-Lopez, M.D., and Dahl, V. (in press) Mining Linguistics and Molecular
Biology Texts through Specialized Concept Formation. Poster,
NLPCS'09.
56.
Dahl, V. and Gu, B. (2008) On
Semantically Based Property Grammars. In Proc. CSLP 2008, Hamburg,
Germany.
55.
Gu, B., Popowich, F. and Dahl, V. (2008) Recognizing Biomedical Named
Entities in Chinese Research Abstracts. In Proceedings of the
21th Canadian Conference on Artificial Intelligence (AI-2008).
Windsor,
Ontario, May 28-30, 2008.
54. Gu, B., Dahl, V. and Popowich, F. (2007) Recognizing Biomedical Named Entities in the Absence of Human Annotated Corpora. In Proceedings of IEEE International Conference on Natural Language Processing and Knowledge Engineering (NLP-KE 2007). Beijing, China, August 30 - September 1, 2007.
53. Dahl, V. and Gu, B. (2007) A CHRG Analysis of ambiguity in Biological Texts (Extended Abstract). In Proceedings of 4th International Workshop on Constraints and Language Processing (CSLP-2007), part of the Sixth International and Interdisciplinary Conference on Modeling and Using Context (Context07), Roskilde University, Denmark, 20-24 August 2007.
52. Dahl, V. and Gu, B. (2006) Semantic Property Grammars for
Knowledge Extraction from Biomedical Text. In Proceedings of
22nd
International Conference on Logic Programming (ICLP-2006).
51.
Christiansen,
H. and Dahl, V. (2005) Modeling and Using Context. In
Proc.
5th International and Interdisciplinary Conference CONTEXT 2005,
Paris,
France, July-5-8.
50. Bavarian, M. and Dahl, V. (2005) Constraint Based Methods for Biological Sequence Analysis. In Proc. PROLE 05, Granada, Spain.
49.
Dahl, V. Treating Long-Distance Dependencies through Constraint
Reasoning. In Proc. 3rd
International Workshop on
Multiparadigm Constraint Programming Languages, Saint-Malo,
France,
Sept. 2004.
48. Dahl, V. and Tarau, P. Assumptive Logic Programming. In
Proc. ASAI'04, Cordoba, Sept.
2004.
47. Aguilar Solis, D. and Dahl, V. Coordination revisited: a CHR
approach. In Proc. Iberamia '04, Mexico.
46. Christiansen, H. and Dahl, V. (2004). Assumptions
and Abduction in Prolog. In: Proc.
MULTICPL'04 (Third International
Workshop on Multiparadigm Constraint Programming Language,
Saint-Malo,
France, Sept. 04.
45. Dahl, V. and Voll, K. (2004) Concept
Formation Rules: An Executable Cognitive Model of Knowledge
Construction. In Proc. First
International Workshop on Natural
Language Understanding and Cognitive Sciences (NLUCS'04), Porto,
Portugal, April 2004.
44. Dahl, V. and Blache, P. (2004) Directly Executable
Constraint Based Grammars. In Proc. Journees
Francophones de Programmation
en Logique avec
Contraintes, Angers, France, June 2004.
41. Bès,
G., Dahl, V., Guillot, D., Lamadon, L., Milutinovici.
40. Dahl, Veronica (2001). Meaningful
communication with computers, the web, and robots: research directions.
In: Proc. SLPLT01 (Second International Workshop on Spanish Language
Processing and Language Technologies),
38. Voll, K., Yeh, T. and Dahl, V. (2000) An Assumptive Logic Programming Methodology for Parsing. In Proc. 12th Int'l Conference on Tools with Artificial Intelligence 2000.
37. Rochefort, S., Tarau, P. and Dahl,
V. (2000) Feature Interaction Resolution Through Hypothetical
Reasoning. Proc. 4th World Multiconference
on Systemics, Cybernetics and Informatics
(SCI2000),
36. Andrews, J., Dahl, V. and Jayaraman, B. (1999) Logic Grammars, Compositional Semantics, and Overgeneration. In: S. Fong and P. Sabatier (eds.) Proc. Natural Language Understanding and Logic Programming Workshop (NLULP99), Las Cruces, New Mexico, pp. 1-16.
35. Rochefort,
S. and Dahl, V. (1999) LPed ALE:
An Application of Logic Programming in Distance Education. In: Proc.
Distributed and Internet Programming with Logic and Constraint Languages,
ICLP99, pp.1-11.
34. Rochefort, S., Dahl, V. and Tarau, P. A Framework for Virtual Learning Environments. In Proceedings of EMEDIA'99 World Conference on Educational Multimedia, Hypermedia and Telecommunications, Seattle,
Washington, june 1999.
33. Tarau, P.
and Dahl, V. (1998) Code Migration with First Order Continuations.
(invited contribution) In Proc. Joint Declarative
Programming Conference, La Coruna,
32. Rochefort,
S., Dahl,
V. and Tarau, P. (1998) A Virtual
Environment for Collaborative Learning. In Proc. World Multiconference on Systemics,
Cybernetics and Informatics,
31. Dahl, V., Tarau, P. and Li, R. (1997) Assumption Grammars for Natural Language Processing. In: Lee Naish (ed.) Proc. Fourteenth International Conference on Logic Programming, pages 256-270, MIT Press, 1997.
30. Dahl, V., Tarau,
P., Accuosto, P. , Rochefort,
S. and Scortescu, M. (1997) Assumption
Grammars for Knowledge-Based Systems. Proc. NLDB'97,
29. Tarau, P., Dahl, V. and De Boschere, K. (1997) A Logic Programming Approach to Coordination in Virtual Worlds.In Proc. Workshop on Coordination languages, models, systems in the Software Technology Track of the Hawaii International Conference on System Sciences.
28. Tarau, P.,
Dahl, V. and De Boschere, K. (1997) A
Logic Programming Infrastructure for Remote Execution, Mobile Code
and Agents. In: Proc. Post ICLP Workshop on Logic
Programming and Multi Agents,
27. Tarau, P., Dahl, V., Rochefort, S. and De Bosschere, K. (1997) LogiMOO: a Multi-User Virtual World with Agents and Natural Language Programming, In: Proc. CHI'97, S. Pemberton (ed.), Atlanta, 1997, pp. 323-324, ACM ISBN 0-8979-926-2.
26. Tarau, P.,
Dahl, V. and De Bosschere, K. (1997) Remote
Execution,
25. Li, R., Dahl, V., Moniz
Pereira, L. and Scurtescu, M. (1997) Dealing
with Exceptions in Textual Databases. In Proc. NLDB'97,
24. Zaiane, O.
R., Fall,
A., Rochefort, S., Dahl,
V. and
Tarau, P. (1997) Concept-Based
Retrieval using Controlled Natural Language. In Proc. NLDB'97,
23. Zaiane, O. R., Fall, A., Rochefort, Dahl V. and Tarau, P. (1997) On-Line
Resource Discovery using Natural Language, in Proc. RIAO'97 ,
Computer-Assisted Searching on the Internet, pp. 336-355, McGill
University, Montreal.
22. Rochefort,
S., Dahl, V. and Tarau,
P. (1997) Controlling
Virtual Worlds through Extensible Natural Language. In: Proc. 1997
AAAI Symposium Series "Natural Language Processing for the World Wide
Web", March 1997,
21. Dahl, V., Fall, A., Rochefort,
S. and Tarau, P. (1996) A Hypothetical
Reasoning Framework for Natural Language Processing. In Proc. 8th
IEEE International Conference on Tools with Artificial Intelligence.
20. Dahl, V., Tarau, P. and
Andrews, J.
(1995) Extending Datalog Grammars.
Proc.
Workshop on Natural Language and Databases (NLDB'95),
19. Andrews, Dahl, V. and Tarau,
P. (1995) Continuation Logic Programming: Theory and Practice. In
Proc. ILPS'95 Workshop on Operational and Denotational
Semantics of Logic Programs,
18. Dahl, V., Fall, A. and Tarau,
P. (1995)
Resolving Co-Specification in Contexts. In Proc. IJCAI'95
Workshop
on Context in Language,
17. Dahl, V., P. Tarau, L. Moreno
and M. Palomar (1995)Treating coordination through Datalog grammars. COMPULOGNET/ELSNET/EAGLES
Workshop on Computational Logic for Natural Language Processing,
Edinburgh,
16. Balsa, J., Dahl, V. and
15. Dahl, V., Fall, A., and Thomas, M.C. (1995) Driving Robots through Natural Language. In Proc. 1995 IEEE International Conference on Systems, Man and Cybernetics, pp. 1904-1908.
14. Thomas, M.C., Dahl, V., and Fall, A. (1995) Logic
Planning in Robotics. In Proc. 1995 IEEE International
Conference on Systems, Man and Cybernetics, pp. 2951-2955.
13. P. Tarau, V. Dahl, and A. Fall. Backtrackable State with LinearAssumptions, Continuations and Hidden
Accumulator Grammars. In John Lloyd, editor, Proceedings of ILPS'95 Workshop on Visions for the Future of
Logic Programming , page 642, Portland, Oregon, November 1995. poster abstract.
12. Huang, Y.N. , Dahl, V. and Han, J. (1994) Rule Updates
in Logic
Databases: A
11. Abramson, H. and Dahl, V. (1994) Extending logic grammars with ID-LP specifications. In: Proc. IV Iberoamerican Congress on AI- IBERAMIA '94, Caracas, Venezuela, sponsored by AVINTA,SMIA and AEPIA, Oct. 25-28, pp. 230-246.
10.
9. Dahl, V., Tarau, P. and Huang,
Y-N. (1994) Datalog Grammars.
1994 Joint Conference on Declarative Programming.
8. Dahl, V. (1988) Representing linguistic knowledge
through logic
programming. In: Proc. 4th International
Conference
on Logic Programming,
7. Dahl, V. (1985)
Hiding complexity from the casual writer of parsers.In: Natural Language
Understanding and Logic Programming, pp. 1-19, Elsevier.
6. Dahl, V. (1984) More on gapping grammars In: Dahl and Saint-Dizier (eds.) Proc. International Conference on V Generation Computer Systems, Tokyo, Ohmsha Publishing Co., pages 669-677, 1984.
5. Dahl, V. (1980) A
Three-Valued Logic for Natural Language Computer Applications. In:
Proc. International Symposium on Multiple Valued Logic, pp.
102-107,
4. Dahl, V. (1980) Two
solutions to
the negation problem. In: Proc. Logic Programming
Workshop,
3. Dahl, V. (1979) Quantification
in a three-valued logic for natural language question-answering
systems. In Proc. IJCAI’79,
2. Dahl, V. (1979) Logical
design of deductive, natural language consultable data bases. In: Proc. V International Conference on Very Large Data Bases,
1. Dahl, V. (1977) Some experiences on natural language
question-answering systems. Proc. Workshop on Logic
and Data Bases, CERT,
2.2 INVITED CONTRIBUTIONS (unrefereed)
9. Dahl, V. (2001) About ICLP+CP 2001. In: Logic Programming Newsletter, Nov. 2001.
8. Dahl, V. (1999) Encyclopedia Entry: Logic Programming and Languages. In: J. G. Webster (ed.) Wiley Encyclopedia of Electrical and Electronics Engineering, vol. 11, 576:580.
7. Dahl, V. and Tarau, P. (1998) From Assumptions to Meaning. In: Canadian Artificial Intelligence 42, Spring '98.
6. Dahl, V. (1995) Research on AI in
5. Dahl, V.
(1995) Introduction to the Special Issue: Computational Linguistics
and Logic programming, The Journal of Logic Programming.
4. Dahl, V. (1994) The 1993 International
Logic Programming Symposium AI Magazine, vol. 15, No. 4,
pp. 73.
3. Dahl, V.
(1992) Introduction to the Special Issue: Constraint Reasoning for
Expert Systems, International Journal of Expert Systems, JAI Press Inc., 6(4), p. v-vii (invited contribution).
2. Dahl, V. (1994) Review of the research monograph: "Constraint-Based Grammar Formalisms", by Stuart Shieber. Computational Linguistics.19 (3), pp. 560-564 (invited contribution).
1. Dahl, V. (1985) Prolog, Mumps and Fifth Generation
Computing. In: R. Dayhoff, (ed.) MUMPS User’s group Journal, vol. XV, No. 3,
pp. 3-13 (invited contribution to mark my Keynote
Speech at the MUMPS Conference).
2.3 MISCELLANEOUS: TECHNICAL
REPORTS, CONTRIBUTIONS IN PREPARATION, THESES
M10. Zahariev, M., Dahl, V. and Levesque, A. (T.R., 2008) Efficient Algorithms for the Discovery of Oligonucleotide signatures for DNA Sequences and Groups of Sequences.
M9. Dahl, V. (1988) Static Discontinuity Grammars for Government-Binding Theory. CSS/LCCR TR 88-22, SFU.
M8.
M7. Dahl, V. and Saint-Dizier, P.
(1986) Constrained Discontinuous Grammars- A Linguistically
Motivated Tool
for Processing Language. LCCR TR 86-8, SFU/ INRIA Rapport No. 573.
M6. Dahl, V. (1983) Current Trends in Logic Grammars.
SFU TR
83-2, presented at panel session, International Conference on Logic
Programming,
M5. Dahl, V. (1983) Teoria de Lenguajes.
CLAMI, Primer Simposio Latinoamericano de Informatica
(invited contribution), pp. 1-87.
M4.
Dahl, V. (1977) Un systeme deductif d’interrogation de banques de donnees en espagnol. These
de Doctorat de Specialite en Intelligence Artificielle, Universite
d’Aix-Marseille II, France.
M3.
Dahl, V. and Sambuc,
R. (1976) Un systeme de banque de donnees en logique du premier ordre, en vue de
sa consultation
en langue naturelle. Rapport de DEA, Universite
d'Aix-Marseille II, pp. 1-29.
M2. Dahl, V. and
Elinger, M. (1975) Algoritmo
de Grafos
para la Operacion Optima de Aprovechamientos Hidraulicos.
Informe Tecnico No. 3, Instituto Nacional
de Ciencia y Tecnica
Hidricas, Buenos
Aires, Argentina. (Prize
Winner for Scientific Production in Engineering).
R2. Recent Contributions to publications through supervision:
[S20] Gu, Baohua (2008) Recognizing Named Entities in
Biomedical Text. PhD Thesis Dissertation, SFU.
[S19] Voll, Kimberly (2006) A methodology of error detection:
Improving speech recognition in radiology. PhD thesis, Simon
Fraser University, Burnaby, Canada.
[S18] Bavarian, M. (2006) Design and Analysis of Biological Sequences
using Constraint Handling Rules. Masters thesis, Simon
Fraser University, Burnaby, Canada.
[S17] Barranco-Mendoza, Alma (2005) Stochastic and
Heuristic
Modelling for Analysis of the Growth of Pre-Invasive Lesions and
for
a Multidisciplinary Approach to Early Cancer Diagnosis, Ph D
dissertation, SFU.
[S16] Zahariev, Manuel
(2004) Automatic Expansion of Acronyms, SFU Ph D
dissertation, winner of the 2004
Governor General's Gold Medal Award, Canada.
[S15] Zahariev, Manuel (2003), An Efficient Methodology for
Acronym-Expansion Matching, submitted to Human Languages
Technology Conference, NAACL-HLT 2003, Edmonton, Canada.
[S14] Stephen Rochefort (2002) LPed ALE: A
Multi-Agent System for Asynchronous Learning. E-Learn: World
Conference on E-Learning in Corporate, Government, Healthcare and
Higher Education, Montreal, QC, 2002.
[S13] Fall, A. (1998) The Foundations of
Taxonomic Encoding. Computational Intelligence 14 (4) :
598-642.
[S12] Fall, A (1996) Reference Constraints
and Individual Level Inheritance. Canadian AI Conference,
Toronto : 336-348.
[S11] Fall, A. (1996) Sparse Term Encoding for
Dynamic Taxonomies. Proc. Fourth International Conference on
Conceptual Structures, Sydney, Australia.
[S10] Fall, A. (1996) The Evolution of
Taxonomic Encoding Techniques. In Dahl, V. and Sobrino, A. (eds.)
:201-231, Ensayos sobre Programacion Logica. Santiago de
Compostela University Press.
[S9] Fall, A. (1995) Spanning Tree
Representations of Graphs and Orders in Conceptual Structures. In :
Proc. Third Int. Conf. on Conceptual Structures. Santa Cruz :
232-246.
[S8] Fall, A. (1995) Heterogenous Encoding.
Ibidem :134-146.
[S7] Fall, A. (1995) An Abstract Framework
for Taxonomic Encoding. Ibidem : 162-167.
[S6] Fall, A. (1994) Sparse Logical TermsApplied
Mathematics Letters. 8(5) :11-16.
[S5] Andrews, J.A. (1994) Foundational Issues
in Implementing Constraint Logic Programming Languages.
In Proc. 5th European Symposium on Programming Languages,
Scotland :74-88.
[S4] Calder, J. (1993) Graphical Interaction
with Constraint-Based Grammars. Proc. Third Pacific Rim
Conference on Computational Linguistics, Vancouver : 160-169.
[S3] Sidebottom, G. (1993) Implementing a
CLP(B) with the Connection Theorem Proving Method and a Reason
Maintenance System. Journal of Symbolic Computation, 15
:27-48.
[S2] Andrews, J. (1992) Towards Proof-Theoretic Characterizations of
Constraint Logic Programming Systems. In: Proc. Workshop on Proofs
and
Types in Logic Programming, Washington, D. C. Nov. 1992.
[S1] Dorner, B. and Hagen, E. (1994) Towards
an American Sign Language Interface. Artificial Intelligence
Review, 8 (2-2) : 235-253.
2. Service Related Publications (unrefereed)8. Dahl, V. The Prez is Off the Hook! Long Live the Prez!, Logic Programming Newsletter vol. 18, No. 1, February 2005.
4. Dahl, V. (1998) Yes, You Can- Letter to Young Women Scientists Blossoming in Men's Fields. In: Logic Programming Newsletter, 11(3):6, Aug. 1998. Reprinted from: SCWIST Newsletter, 14(1):4, Jan. 1997.
3. On False Choices Affecting Female Representation in Science and Technology. From my Invited talk at CASCON'96 Workshop The Gender Gap, Toronto, Nov. 1996.
2. Dahl, V. (second edition, 1995) Analysis of Female Underrepresentation in Computing Sciences Departments- What can be done. Simon Fraser University.
1. Dahl, V., Kirkpatrick, D. and Pruzinkiewicz, P. Report on Internal Restructuring of NSERC's Computing
and Information Science Grant Selection Committee. Technical
Report, NSERC, 1992.
back to Verónica
Dahl's home page