Tim Fernando

Orcid: 0000-0002-8234-8371

According to our database1, Tim Fernando authored at least 42 papers between 1987 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Projecting Temporal Properties, Events and Actions.
Proceedings of the 13th International Conference on Computational Semantics, 2019

Prior Probabilities of Allen Interval Relations over Finite Orders.
Proceedings of the 11th International Conference on Agents and Artificial Intelligence, 2019

MSO with tests and reducts.
Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing, 2019

2017
Predications, Fast and Slow.
Proceedings of the Thirteenth International Symposium on Commonsense Reasoning, 2017

2016
Prior and temporal sequences for natural language.
Synth., 2016

On regular languages over power sets.
J. Lang. Model., 2016

2015
Two Perspectives on Change and Institutions.
Proceedings of the Joint Ontology Workshops 2015 Episode 1: The Argentine Winter of Ontology co-located with the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), 2015

Temporal Forces and Type Coercion in Strings.
Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing, 2015

Between the Event Calculus and Finite State Temporality.
Proceedings of the Formal Grammar - 20th and 21st International Conferences, 2015

Types from Frames as Finite Automata.
Proceedings of the Formal Grammar - 20th and 21st International Conferences, 2015

2013
Segmenting Temporal Intervals for Tense and Aspect.
Proceedings of the 13th Meeting on the Mathematics of Language, 2013

Temporal Dependence in Legal Documents.
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2013, 2013

Finite State Methods and Description Logics.
Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing, 2013

2012
A Finite-State Temporal Ontology and Event-Intervals.
Proceedings of the 10th International Workshop on Finite State Methods and Natural Language Processing, 2012

2011
Regular relations for temporal propositions.
Nat. Lang. Eng., 2011

Constructing Situations and Time.
J. Philos. Log., 2011

Finite-state Representations Embodying Temporal Relations.
Proceedings of the Finite-State Methods and Natural Language Processing, 2011

Strings over intervals.
Proceedings of the Workshop on Textual Entailment, 2011

Steedman's Temporality Proposal and Finite Automata.
Proceedings of the Logic, Language and Meaning - 18th Amsterdam Colloquium, 2011

2009
Situations in LTL as strings.
Inf. Comput., 2009

Temporal Propositions as Vague Predicates.
Proceedings of the Logic, Language and Meaning - 17th Amsterdam Colloquium, 2009

2008
Branching from Inertia Worlds.
J. Semant., 2008

2006
Situations as Strings.
Proceedings of the 13th Workshop on Logic, Language, Information and Computation, 2006

Finite-State Temporal Projection.
Proceedings of the Implementation and Application of Automata, 2006

2005
Schedules in a Temporal Interpretation of Modals.
J. Semant., 2005

2004
A Finite-state Approach to Events in Natural Language Semantics.
J. Log. Comput., 2004

2002
A Finite-State Approach to Event Semantics.
Proceedings of the 9th International Symposium on Temporal Representation and Reasoning, 2002

2001
A Type Reduction from Proof-conditional to Dynamic Semantics.
J. Philos. Log., 2001

Ambiguous Discourse in a Compositional Context. An Operational Perspective.
J. Log. Lang. Inf., 2001

2000
Towards a Many-Dimensional Modal Logic for Semantic Processing.
Proceedings of the Advances in Modal Logic 3, 2000

1999
A Modal Logic for Non-Deterministic Discourse Processing.
J. Log. Lang. Inf., 1999

Ambiguous propositions typed.
Proceedings of the EACL 1999, 1999

1998
In Conjunction with Qualitative Probability.
Ann. Pure Appl. Log., 1998

1994
Bisimulations and Predicate Logic.
J. Symb. Log., 1994

1993
A higher-order extension of constraint programming in disourse analysis.
Proceedings of the Principles and Practice of Constraint Programming, 1993

The donkey strikes back: Extending the dynamic interpretation "constructively".
Proceedings of the Sixth Conference of the European Chapter of the Association for Computational Linguistics, 1993

1992
Transition Systems and Dynamic Semantics.
Proceedings of the Logics in AI, European Workshop, 1992

Comparative Transition System Semantics.
Proceedings of the Computer Science Logic, 6th Workshop, 1992

1991
Provably Recursive Programs and Program Extraction.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation.
Proceedings of the Computer Science Logic, 5th Workshop, 1991

1988
Meager and replete failures of relative completeness.
J. ACM, 1988

1987
Skinny and Fleshy Failures of Relative Completeness.
Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987


  Loading...