A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
From MaRDI portal
Publication:5302730
DOI10.1007/978-3-540-89812-2_10zbMath1162.68660OpenAlexW1599491282MaRDI QIDQ5302730
Publication date: 13 January 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89812-2_10
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Consistency in networks of relations
- Fast planning through planning graph analysis
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Hard examples for resolution
- A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
This page was built for publication: A Global Filtration for Satisfying Goals in Mutual Exclusion Networks