SARA 2009 - PDF Preprint Papers

SARA 2009 International Symposium on Abstraction

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SARA-2009 Paper

click to vote

SARA
2009
Springer

105views Artificial Intelligence» more SARA 2009»

Reformulating Planning Problems by Eliminating Unpromising Actions

1 years 12 months ago

Download webdocs.cs.ualberta.ca

Despite a big progress in solving planning problems, more complex problems still remain hard and challenging for existing planners. One of the most promising research directions i...

Lukás Chrpa, Roman Barták

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	105	Reformulating Planning Problems by Eliminating Unpromising Actions	claim
2	97	Abstraction-Based Heuristics with True Distance Computations	claim
3	97	Tightened Transitive Closure of Integer Addition Constraints	claim
4	85	Abstract Planning with Unknown Object Quantities and Properties	claim
5	82	Downward Path Preserving State Space Abstractions (Extended Abstract)	claim
6	73	Integrating Constraint Models for Sequential and Partial-Order Planning	claim
7	70	Light Algorithms for Maintaining Max-RPC During Search	claim
8	68	Some Interval Approximation Techniques for MINLP	claim
9	68	Automated Redesign with the General Redesign Engine	claim
10	67	Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles	claim
11	64	A Practical Use of Imperfect Recall	claim
12	63	Cluster Graphs as Abstractions for Constraint Satisfaction Problems	claim
13	62	A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances	claim
14	61	Inconsistency-Tolerant Reasoning with Classical Logic and Large Databases	claim
15	61	Rewriting Constraint Models with Metamodels	claim
16	59	Automatically Enhancing Constraint Model Instances during Tailoring	claim
17	57	Modelling Equidistant Frequency Permutation Arrays in Constraints	claim
18	56	Common Subexpressions in Constraint Models of Planning Problems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers