TIME 2014

21st International Symposium on Temporal Representation and Reasoning - Verona, Italy

Call for papers

Aim

TIME Symposium aims to bring together researchers from distinct research areas involving the management of temporal data as well as the reasoning about temporal aspects of information.

This unique and well-established event (see http://time.dico.unimi.it) has as its objectives to bridge theoretical and applied research, as well as to serve as an interdisciplinary forum for exchange among researchers from the areas of artificial intelligence, database management, logic and verification, and beyond.

There are three main tracks in the symposium plus a special track on Interval Temporal Logics, all overseen by the program chairs. The conference is planned as a three-day event, and will be organised as a combination of technical paper presentations, an extended poster session, and keynote talks.

Important Dates

  • Abstract submission: 10 April 2014 24 April 2014 
  • Paper submission: 17 April 2014 26 April 2014 27 April 2014 
  • Paper Notification: 11 June 2014 
  • Start Registration: 15 June 2014 
  • Final version due: 04 July 2014 
  • Presenting authors registration deadline: 30 June 2014  
  • Non-presenting authors and non-authors early registration deadline: 20 July 2014
  • TIME Symposium: 8-10 September 2014

Submissions

Submissions of high quality papers describing research results or on-going work are solicited. Submitted papers should contain original, previously unpublished content, should be written in English, and must not be simultaneously submitted for publication elsewhere. Submitted papers will be refereed by at least three reviewers for quality, correctness, originality, and relevance. Accepted papers will be presented at the symposium and included in the proceedings, which will be published by the IEEE Conference Publishing Services (CPS), as usual within the TIME series. Acceptance of a paper is contingent on one author presenting the paper at the symposium. Submissions should be in PDF format (with the necessary fonts embedded).

They must be formatted according to the IEEE guidelines and must not exceed 10 pages (US letter format); over-length submissions may be rejected without review. Papers should be submitted electronically via the EasyChair system at
https://www.easychair.org/conferences/?conf=time2014

It is also our intention to organise a special issue of a respected journal, containing extended versions of selected papers from the symposium.

Topics

The symposium will encompass:

Temporal Representation and Reasoning in AI includes, but is not limited to:

  • temporal aspects of agent- and policy-based systems
  • spatial and temporal reasoning
  • reasoning about actions and change
  • planning and planning languages
  • ontologies of time and space-time
  • belief and uncertainty in temporal knowledge
  • temporal learning and discovery
  • time in problem solving (e.g. diagnosis, scheduling)
  • time in human-machine interaction
  • temporal information extraction
  • time in natural language processing
  • spatio-temporal knowledge representation systems
  • spatio-temporal ontologies for the semantic web
  • constraint-based temporal reasoning
  • temporal preferences

Temporal Database Management includes, but is not limited to:

  • temporal data models and query languages
  • temporal query processing and indexing
  • temporal data mining
  • time series data management
  • stream data management
  • spatio-temporal data management, including moving objects
  • data currency and expiration
  • indeterminate and imprecise temporal data
  • temporal constraints
  • temporal aspects of business processes and ECA systems
  • real-time databases
  • time-dependent security policies
  • privacy in temporal and spatio-temporal data
  • temporal aspects of multimedia databases
  • temporal aspects of e-services and web applications
  • temporal aspects of distributed systems
  • temporal aspects and big data
  • temporal aspects in NoSQL databases
  • temporal data warehouses
  • temporal healthcare databases and warehouses
  • time series analysis and mining
  • semistructured temporal data
  • novel applications of temporal database management
  • experiences with real applications

Temporal Logic and Verification in Computer Science includes, but is not limited to:

  • specification and verification of systems
  • verification of web applications
  • synthesis and execution
  • model checking algorithms
  • verification of infinite-state systems
  • reasoning about transition systems
  • temporal architectures
  • temporal logics for distributed systems
  • temporal logics for games and open systems
  • temporal logics of knowledge
  • hybrid systems and real-time logics
  • tools and practical systems
  • temporal issues in security

Special Track on Interval Temporal Logics

This year TIME is planning a special track on Interval Temporal Logics, organized by Davide Bresolin (University of Verona) and Guido Sciavicco (University of Murcia). Submissions for this special track will be primarily managed by them, though the final decision on acceptance will be taken by the whole PC. This track is intended to be a follow-up of the First Workshop on Interval Temporal Logics and Duration Calculi held at ESSLLI 2003 summer school (Wien, Austria), and of the special track on Interval Temporal Logics of TIME 2011 (Lubeck, Germany).

Time representation and reasoning with intervals is a challenging research field of Computer Science, with a recognized impact in AI, Databases and Formal Verification. Interval-based languages are involved at many levels in different applications, such as planning and management of medical information, verification of hardware circuits, model-checking and requirement analysis of hybrid systems.

Non-trivial problems rise at every level: expressive power of the languages, decidability and un-decidability of logics at the first-order and at the modal levels, computational complexity of automatic and semi-automatic deduction techniques, and axiomatic systems.

High quality contributions for this special track are welcome in, but are not limited to, any of the following topics:

  • expressiveness and decidability of ITLs
  • proof systems (tableaux-based, SMT-based, etc.) for ITLs
  • model-checking of ITLs
  • modeling of system requirements in terms of time intervals
  • intervals versus time points in temporal modeling
  • Duration Calculus and other extensions and variants of ITLs
  • ITLs for timed automata, hybrid automata, and other models of real time sytems
  • interval algebras and (spatio-)temporal reasoning
  • case studies, applications and tool support for interval-based reasoning

Special Track on Temporal Networks

This year TIME is planning a special track on Temporal Networks, organized by Brent Venable (Tulane University and IHMC) and Luke Hunsberger (Vassar College). Submissions for this special track will be primarily managed by them, though the final decision on acceptance will be taken by the whole PC. For over twenty years, various kinds of temporal networks have been proposed in the literature including: temporal constraint networks (TCNs), simple temporal networks (STNs), disjunctive temporal networks (DTNs), conditional temporal networks (CTNs), STNs with uncertainty, STNs with preferences, STNs with probabilities, and so on. For each kind of network, different notions of consistency/controllability have been defined; and algorithms for determining whether networks have the desired property have been presented. Some algorithms have been proven to be polynomial, others are exponential. Algorithms for managing the execution of various kinds of temporal networks have also been proposed.

This track aims to further progress on the theoretical foundations of temporal networks, the development of new algorithms for processing such networks, and the application of temporal networks to interesting domains.

High quality contributions for this special track are welcome in, but are not limited to, any of the following topics:

  • temporal networks
  • uncertainty in simple temporal networks
  • preferences in simple temporal networks
  • resources in temporal networks
  • consistency notions
  • controllability notions
  • execution algorithms
  • connections between temporal networks and other temporal formalisms (e.g., Allen’s interval algebra, point algebra, timed game automata, etc.)
TIME 2014 © 2014 Frontier Theme