Add to ORKGIn [1], we introduced Planning by Rewriting (PBR), a new paradigm for efficient high-quality planning that exploits plan rewriting rules and efficient local search techniques to transform an easy-to-generate, but possibly suboptimal, initial plan into a low-cost plan. In this paper we show in detail the application of the general framework to query planning in distributed environments. As a result we obtain an scalable and flexible query planner for use in an information mediator
Planning by Rewriting (PbR) is a new paradigm for efficient high-quality planning that exploits pla...
This work outlines a exible framework for optimizing and deploying distributed queries in wide area...
Automated planning is a branch of AI that addresses the problem of generating a course of action to ...
AbstractThe Internet provides access to a wealth of information. For any given topic or application ...
Planning involves the generation of a network of ac-tions that achieves a desired goal given an init...
Domain-independent planning is a hard combinatorial problem. Taking into account plan quality makes...
Researchers have extensively studied the issues that arise in applying a general-purpose planner to ...
Current specialized planners for query processing are designed to work in local, reliable, and predi...
Current specialized planners for query processing are designed to work in local, reliable, and predi...
In this paper we revisit the problem of generating query plans using AI automated planning with a vi...
In this paper we revisit the problem of generating query plans using AI automated planning with a v...
Planning by Rewriting (PbR) is a paradigm for efficient high-quality planning that exploits declarat...
Abstract — To generate plans for collecting data for data mining, an important problem is informatio...
Proceeding of: IEEE Systems, Man, and Cybernetics 2001, 7-10 Oct. 2001Solving problems in dynamic an...
Query planning for information integration using a local-as-view approach is exponential in the size...
Planning by Rewriting (PbR) is a new paradigm for efficient high-quality planning that exploits pla...
This work outlines a exible framework for optimizing and deploying distributed queries in wide area...
Automated planning is a branch of AI that addresses the problem of generating a course of action to ...
AbstractThe Internet provides access to a wealth of information. For any given topic or application ...
Planning involves the generation of a network of ac-tions that achieves a desired goal given an init...
Domain-independent planning is a hard combinatorial problem. Taking into account plan quality makes...
Researchers have extensively studied the issues that arise in applying a general-purpose planner to ...
Current specialized planners for query processing are designed to work in local, reliable, and predi...
Current specialized planners for query processing are designed to work in local, reliable, and predi...
In this paper we revisit the problem of generating query plans using AI automated planning with a vi...
In this paper we revisit the problem of generating query plans using AI automated planning with a v...
Planning by Rewriting (PbR) is a paradigm for efficient high-quality planning that exploits declarat...
Abstract — To generate plans for collecting data for data mining, an important problem is informatio...
Proceeding of: IEEE Systems, Man, and Cybernetics 2001, 7-10 Oct. 2001Solving problems in dynamic an...
Query planning for information integration using a local-as-view approach is exponential in the size...
Planning by Rewriting (PbR) is a new paradigm for efficient high-quality planning that exploits pla...
This work outlines a exible framework for optimizing and deploying distributed queries in wide area...
Automated planning is a branch of AI that addresses the problem of generating a course of action to ...