default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTim Fernando
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c28]Tim Fernando, David Woods, Carl Vogel:
MSO with tests and reducts. FSMNLP 2019: 27-36- [c27]Tim Fernando, Carl Vogel:
Prior Probabilities of Allen Interval Relations over Finite Orders. ICAART (2) 2019: 952-961 - [c26]Tim Fernando:
Projecting Temporal Properties, Events and Actions. IWCS (1) 2019: 1-12 - 2017
- [c25]Tim Fernando:
Predications, Fast and Slow. COMMONSENSE 2017 - 2016
- [j14]Tim Fernando:
On regular languages over power sets. J. Lang. Model. 4(1): 29-56 (2016) - [j13]Tim Fernando
:
Prior and temporal sequences for natural language. Synth. 193(11): 3625-3637 (2016) - 2015
- [c24]Tim Fernando:
Types from Frames as Finite Automata. FG 2015: 19-40 - [c23]Derek Kelleher, Tim Fernando, Carl Vogel:
Between the Event Calculus and Finite State Temporality. FG 2015: 112-129 - [c22]Derek Kelleher, Tim Fernando, Carl Vogel:
Temporal Forces and Type Coercion in Strings. FSMNLP 2015 - [c21]Tim Fernando:
Two Perspectives on Change and Institutions. JOWO@IJCAI 2015 - 2013
- [c20]Tim Fernando:
Finite State Methods and Description Logics. FSMNLP 2013: 63-71 - [c19]Daniel Isemann, Khurshid Ahmad, Tim Fernando, Carl Vogel:
Temporal Dependence in Legal Documents. IDEAL 2013: 497-504 - [c18]Tim Fernando:
Segmenting Temporal Intervals for Tense and Aspect. MOL 2013: 30-40 - 2012
- [c17]Tim Fernando:
A Finite-State Temporal Ontology and Event-Intervals. FSMNLP 2012: 80-89 - 2011
- [j12]Tim Fernando:
Constructing Situations and Time. J. Philos. Log. 40(3): 371-396 (2011) - [j11]Tim Fernando:
Regular relations for temporal propositions. Nat. Lang. Eng. 17(2): 163-184 (2011) - [c16]Tim Fernando:
Steedman's Temporality Proposal and Finite Automata. Amsterdam Colloquium on Logic, Language and Meaning 2011: 301-310 - [c15]Tim Fernando:
Strings over intervals. TextInfer@EMNLP 2011: 50-58 - [c14]Tim Fernando:
Finite-state Representations Embodying Temporal Relations. FSMNLP 2011: 12-20
2000 – 2009
- 2009
- [j10]Tim Fernando:
Situations in LTL as strings. Inf. Comput. 207(10): 980-999 (2009) - [c13]Tim Fernando:
Temporal Propositions as Vague Predicates. Amsterdam Colloquium on Logic, Language and Meaning 2009: 143-152 - 2008
- [j9]Tim Fernando:
Branching from Inertia Worlds. J. Semant. 25(3): 321-344 (2008) - 2006
- [c12]Tim Fernando:
Finite-State Temporal Projection. CIAA 2006: 230-241 - [c11]Tim Fernando:
Situations as Strings. WoLLIC 2006: 23-36 - 2005
- [j8]Tim Fernando:
Schedules in a Temporal Interpretation of Modals. J. Semant. 22(2): 211-229 (2005) - 2004
- [j7]Tim Fernando:
A Finite-state Approach to Events in Natural Language Semantics. J. Log. Comput. 14(1): 79-92 (2004) - 2002
- [c10]Tim Fernando:
A Finite-State Approach to Event Semantics. TIME 2002: 124-131 - 2001
- [j6]Tim Fernando:
Ambiguous Discourse in a Compositional Context. An Operational Perspective. J. Log. Lang. Inf. 10(1): 63-86 (2001) - [j5]Tim Fernando:
A Type Reduction from Proof-conditional to Dynamic Semantics. J. Philos. Log. 30(2): 121-153 (2001) - 2000
- [c9]Tim Fernando:
Towards a Many-Dimensional Modal Logic for Semantic Processing. Advances in Modal Logic 2000: 139-151
1990 – 1999
- 1999
- [j4]Tim Fernando:
A Modal Logic for Non-Deterministic Discourse Processing. J. Log. Lang. Inf. 8(4): 445-468 (1999) - [c8]Tim Fernando:
Ambiguous propositions typed. EACL 1999: 86-93 - 1998
- [j3]Tim Fernando:
In Conjunction with Qualitative Probability. Ann. Pure Appl. Log. 92(3): 217-234 (1998) - 1994
- [j2]Tim Fernando:
Bisimulations and Predicate Logic. J. Symb. Log. 59(3): 924-944 (1994) - 1993
- [c7]Tim Fernando:
The donkey strikes back: Extending the dynamic interpretation "constructively". EACL 1993: 130-138 - [c6]Tim Fernando:
A higher-order extension of constraint programming in disourse analysis. PPCP 1993: 60-69 - 1992
- [c5]Tim Fernando:
Comparative Transition System Semantics. CSL 1992: 149-166 - [c4]Tim Fernando:
Transition Systems and Dynamic Semantics. JELIA 1992: 232-251 - 1991
- [c3]Tim Fernando:
A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation. CSL 1991: 96-110 - [c2]Tim Fernando:
Provably Recursive Programs and Program Extraction. ICALP 1991: 303-313
1980 – 1989
- 1988
- [j1]Daniel Leivant, Tim Fernando:
Meager and replete failures of relative completeness. J. ACM 35(4): 953-964 (1988) - 1987
- [c1]Daniel Leivant, Tim Fernando:
Skinny and Fleshy Failures of Relative Completeness. POPL 1987: 246-252
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
