Updating \(\leqslant, <\)-chains

DOI10.1016/S0020-0190(01)00278-2zbMath1338.68051OpenAlexW2912070468MaRDI QIDQ294886

James P. Delgrande, Arvind Kumar Gupta

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019001002782?np=y

zbMATH Keywords

algorithmsdata structurestemporal reasoningefficient reasoning

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Logic in artificial intelligence (68T27) Data structures (68P05)

Related Items (1)

Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class

Cites Work

• Efficient algorithms for qualitative reasoning about time
• Unnamed Item
• Unnamed Item

This page was built for publication: Updating \(\leqslant, <\)-chains