(Enter summary)
Abstract: This paper addresses two issues: how to choose between solutions for a problem specified
by multiple criteria, and how to search for solutions in such situations. We argue against
an approach common in decision theory, reducing several criteria to a single `cost' (e.g.,
using a weighted sum cost function) and instead propose a way of partially ordering solutions
satisfying a set of prioritised soft constraints. We describe a generalisation of the A
search
algorithm which uses this ordering... (Update)
Context of citations to this paper: More
...see [3, 38] 8. data mining: see [13, 31] 9. graph drawing: see [7, 41] 10. heuristic search in artificial intelligence: see [1, 22, 50, 58]; 11. analysis of linear programming: see [15, 16] 12. transportation: see [18, 20, 21] 13. gene finding: see [32, 39] 14....
Cited by: More
Anytime Deliberation For Computer Game Agents - Hawes (2003)
(Correct)
Efficient Maxima-Finding Algorithms for Random Planar Samples - Chen, Hwang, Tsai (2003)
(Correct)
Similar documents (at the sentence level): More
72.3%: State Space Search with Prioritised Soft Constraints - Alechina, Logan (2001)
(Correct)
65.6%: State Space Search With Prioritised Soft Constraints - Alechina, Logan (1999)
(Correct)
38.3%: A* with Bounded Costs - Logan, Alechina (1998)
(Correct)
Active bibliography (related documents): More All
0.2: Route Planning in the Space of Complete Plans - Brian Logan (1997)
(Correct)
0.2: Agent Route Planning in Complex Terrains - Logan, Sloman (1997)
(Correct)
0.1: The Distributed Simulation of Multi-Agent Systems - Logan, Theodoropoulos (2000)
(Correct)
Similar documents based on text: More All
0.1: Modal Quantifiers - Alechina (1995)
(Correct)
0.1: Non-Prioritised Ranked Belief Change - Meyer, Ghose (2001)
(Correct)
Related documents from co-citation: More All
5: Berry-Esseen bounds for the number of maxima in planar regions
- Bai, Hwang et al.
5: Unbounded knapsack problem : dynamic programming revisited
- Andonov, Poirriez et al. - 1997
5: Path Problems in Networks with Vector Valued Edge Weights (context) - Tayi, Rosencrantz - 1997
BibTeX entry: (Update)
N. Alechina and B. Logan, State space search with prioritised soft constraints, Applied Intelligence, 14 (2001), 263--272. http://citeseer.ist.psu.edu/alechina01state.html More
@article{ alechina01state,
author = "Natasha Alechina and Brian Logan",
title = "State Space Search with Prioritised Soft Constraints",
journal = "Applied Intelligence",
volume = "14",
number = "3",
pages = "263-272",
year = "2001",
url = "citeseer.ist.psu.edu/alechina01state.html" }
Citations (may not include all citations):
311
Partial constraint satisfaction
- Freuder, Wallace - 1992
272
Pushing the envelope: Planning
- Kautz, Selman - 1996
158
A formal basis for the heuristic determination of minimum co.. (context) - Hart, Nilsson et al. - 1968
27
Possibility theory in constraint satisfaction problems: Hand..
- Dubois, Fargier et al. - 1996
11
A ffl --- an algorithm using search effort estimates (context) - Pearl - 1982
9
Route planning in CCTT (context) - Campbell, Hull et al. - 1995
9
Route planning with ordered constraints
- Logan - 1997
7
Least commitment---an optimal planning strategy
- Liatsos, Richards - 1997
Documents on the same site (http://www.computer-science.nottingham.ac.uk/Publications/pub95_98.html): More
Managing Mutual Awareness In Collaborative Virtual.. - Benford, Bowers.. (1994)
(Correct)
An Experimental Implementation of the Spatial Model - Greenhalgh (1994)
(Correct)
The Automation of the Timetabling Process in Higher Education - Burke, Elliman, Weare (1995)
(Correct)
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