![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Tim Fernando 12 Tim Fernando: A Finite-State Approach to Event Semantics. TIME 2002 : 124- 11 Tim Fernando: Ambiguous Discourse in a Compositional Context. An Operational Perspective. Journal of Logic, Language and Information 10 (1): 63-86 (2001) 10 Tim Fernando: A Modal Logic for Non-Deterministic Discourse Processing. Journal of Logic, Language and Information 8 (4): 445-468 (1999) 9 Tim Fernando: In Conjunction with Qualitative Probability. Annals of Pure and Applied Logic 92 (3): 217-234 (1998) 8 Tim Fernando: Bisimulations and Predicate Logic. The Journal of Symbolic Logic 59 (3): 924-944 (1994) 7 Tim Fernando: A higher-order extension of constraint programming in disourse analysis. PPCP 1993 : 60-69 6 Tim Fernando: Comparative Transition System Semantics. CSL 1992 : 149-166 5 Tim Fernando: Transition Systems and Dynamic Semantics. JELIA 1992 : 232-251 4 Tim Fernando: A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation. CSL 1991 : 96-110 3 Tim Fernando: Provably Recursive Programs and Program Extraction. ICALP 1991 : 303-313 2 Daniel Leivant , Tim Fernando: Meager and replete failures of relative completeness. JACM 35 (4): 953-964 (1988) 1 Daniel Leivant , Tim Fernando: Skinny and Fleshy Failures of Relative Completeness. POPL 1987 : 246-252 ![]() DiSC'03 © 2003 Association for Computing Machinery |