5 citations found. Retrieving documents...
M. Koubarakis. Dense time and temporal constraints with 6=. In Proceedings of KR-92, Cambridge, Massachusetts, pages 24--35, 1992.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Indu: An Interval Duration Network - Pujari, Kumari, Sattar (2000)   (1 citation)  (Correct)

....It can only handle pointisable (SIA) relations and to represent the interval information, PDN translates it to equivalent point information. This increases the complexity of the problem. APDN follows the same structure but extends PDN to represent quantitative information as well. Koubarakis [5] also attempts to represent relations between durations of intervals. However, this work addresses a restricted class of temporal constraints. Recently, a unified framework for quantitative and qualitative reasoning is proposed as PIDN [11] PIDN handles the interval and duration information in a ....

M. Koubarakis. Dense time and temporal constraints with 6=. In Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), pages 24--35, 1992.


Combining Qualitative and Quantitative Constraints in Temporal.. - Meiri (1995)   (107 citations)  (Correct)

No context found.

M. Koubarakis. Dense time and temporal constraints with 6=. In Proceedings of KR-92, Cambridge, Massachusetts, pages 24--35, 1992.


A Polynomial Algorithm for Continuous Non-binary Disjunctive CSPs - Salido, Barber (2003)   (Correct)

No context found.

M. Koubarakis, `Dense time and temporal constraints with ', In Proc. 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), 24--35, (1992).


POLYSA: A Polynomial Algorithm for Non-binary Constraint.. - Salido, Barber (2001)   (Correct)

No context found.

Koubarakis M.: Dense time and temporal constraints with . In Proc. 3 rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), (1992) 24-35


A Polynomial Algorithm for Continuous Non-binary Disjunctive CSPs - Salido, Barber (2002)   (Correct)

No context found.

M. Koubarakis, `Dense time and temporal constraints with ', In Proc. 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), 24--35, (1992).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC