On fuzzy temporal constraint networks.

Lluis Vila; Lluis Godó

Mathware and Soft Computing (1994)

  • Volume: 1, Issue: 3, page 315-334
  • ISSN: 1134-5632

Abstract

top
Temporal Constraint Networks are a well-defined, natural and efficient formalism for representing temporal knowledge based on metric temporal constraints. They support the representation of both metric and some qualitative temporal relations and are provided with efficient algorithms based on CSP techniques. Recently, a generalization based on fuzzy sets has been proposed in order to cope with vagueness in temporal relations. In this paper we generalize some earlier definitions for Fuzzy Temporal Constraint Networks, we identify and define interesting queries in a fuzzy temporal constraint network, an explore a method for efficiently computing them in a specific case. Further analysis of some measures on possibility distributions turns out to be fundamental in order to precisely determine some of these queries. We discuss the advantages and shortcomings of various choices and propose specific alternatives which satisfactorily avoid the problems of previous proposals. The results presented in this paper can be useful in the design of a system for temporal reasoning under uncertainty. for instance, we have applied them to defining a possibilistic temporal logic where approximate and temporal representation and reasoning are consistently combined.

How to cite

top

Vila, Lluis, and Godó, Lluis. "On fuzzy temporal constraint networks.." Mathware and Soft Computing 1.3 (1994): 315-334. <http://eudml.org/doc/39032>.

@article{Vila1994,
abstract = {Temporal Constraint Networks are a well-defined, natural and efficient formalism for representing temporal knowledge based on metric temporal constraints. They support the representation of both metric and some qualitative temporal relations and are provided with efficient algorithms based on CSP techniques. Recently, a generalization based on fuzzy sets has been proposed in order to cope with vagueness in temporal relations. In this paper we generalize some earlier definitions for Fuzzy Temporal Constraint Networks, we identify and define interesting queries in a fuzzy temporal constraint network, an explore a method for efficiently computing them in a specific case. Further analysis of some measures on possibility distributions turns out to be fundamental in order to precisely determine some of these queries. We discuss the advantages and shortcomings of various choices and propose specific alternatives which satisfactorily avoid the problems of previous proposals. The results presented in this paper can be useful in the design of a system for temporal reasoning under uncertainty. for instance, we have applied them to defining a possibilistic temporal logic where approximate and temporal representation and reasoning are consistently combined.},
author = {Vila, Lluis, Godó, Lluis},
journal = {Mathware and Soft Computing},
keywords = {Inteligencia artificial; Conjuntos difusos; Medida del tiempo; temporal constraint networks; possibilistic temporal logic},
language = {eng},
number = {3},
pages = {315-334},
title = {On fuzzy temporal constraint networks.},
url = {http://eudml.org/doc/39032},
volume = {1},
year = {1994},
}

TY - JOUR
AU - Vila, Lluis
AU - Godó, Lluis
TI - On fuzzy temporal constraint networks.
JO - Mathware and Soft Computing
PY - 1994
VL - 1
IS - 3
SP - 315
EP - 334
AB - Temporal Constraint Networks are a well-defined, natural and efficient formalism for representing temporal knowledge based on metric temporal constraints. They support the representation of both metric and some qualitative temporal relations and are provided with efficient algorithms based on CSP techniques. Recently, a generalization based on fuzzy sets has been proposed in order to cope with vagueness in temporal relations. In this paper we generalize some earlier definitions for Fuzzy Temporal Constraint Networks, we identify and define interesting queries in a fuzzy temporal constraint network, an explore a method for efficiently computing them in a specific case. Further analysis of some measures on possibility distributions turns out to be fundamental in order to precisely determine some of these queries. We discuss the advantages and shortcomings of various choices and propose specific alternatives which satisfactorily avoid the problems of previous proposals. The results presented in this paper can be useful in the design of a system for temporal reasoning under uncertainty. for instance, we have applied them to defining a possibilistic temporal logic where approximate and temporal representation and reasoning are consistently combined.
LA - eng
KW - Inteligencia artificial; Conjuntos difusos; Medida del tiempo; temporal constraint networks; possibilistic temporal logic
UR - http://eudml.org/doc/39032
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.