Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Knowledge Server for Reasoning about Temporal Constraints Between Classes and Instances of Events*
 

Summary: A Knowledge Server for Reasoning about Temporal Constraints
Between Classes and Instances of Events*
Paolo Terenziani
Dipartimento di Informatica
UniversitÓ del Piemonte Orientale "Amedeo Avogadro"
Spalto Marengo 33, 15100 Alessandria, Italy
E-mail: terenz@mfn.unipmn.it
Luca Anselma
Dipartimento di Informatica
UniversitÓ di Torino
Corso Svizzera 185, 10149 Torino, Italy
E-mail: anselma@di.unito.it
Abstract. Reasoning with temporal constraints is a ubiquitous issue in many computer science tasks, for which
many dedicated approaches have been and are being built. In particular, in many areas, including planning,
workflow, guidelines and protocol management, one needs to represent and reason with temporal constraints
between classes of events (e.g., between the types of actions needed to achieve a goal) and temporal constraints
between instances of events (e.g., between the specific actions being executed). The temporal constraints between
the classes of events must be inherited by the instances, and the consistency of both types of constraints must be
checked. In this paper, we design a general-purpose domain-independent knowledge server dealing with these
issues. In particular, we propose a formalism to represent temporal constraints, and we point out two orthogonal

  

Source: Anselma, Luca - Dipartimento di Informatica, UniversitÓ di Torino

 

Collections: Computer Technologies and Information Sciences