Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Fast algebraic methods for interval constraint problems

From MaRDI portal
Publication:1370620
Jump to:navigation, search

DOI10.1023/A:1018968024833zbMath0880.68012MaRDI QIDQ1370620

Alexander Reinefeld, Peter B. Ladkin

Publication date: 26 October 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)


zbMATH Keywords

pruning techniqueconstraint problems


Mathematics Subject Classification ID

Logic programming (68N17)


Related Items (7)

Modelling and solving temporal reasoning as propositional satisfiability ⋮ Spatial reasoning with rectangular cardinal relations. The convex tractable subalgebra ⋮ Unnamed Item ⋮ Reasoning about qualitative temporal information ⋮ Unnamed Item ⋮ Relation algebras and their application in temporal and spatial reasoning ⋮ Collective singleton-based consistency for qualitative constraint networks: theory and practice




This page was built for publication: Fast algebraic methods for interval constraint problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1370620&oldid=13517931"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:07.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki