Declarative Formalization of Reasoning Strategies: A Case Study on Heuristic Nonlinear Planning

Authors:
Josefina Sierra-Santibáñez
Affiliations:
Departamento de Lenguajes y Sistemas Informáticos, Universidad Politécnica de Cataluña, 08034 Barcelona, Spain E-mail: jsierra@lsi.upc.es
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2003

Citing 17
Cited 3

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
Applications of circumscription to formalizing common-sense knowledge

Artificial Intelligence
Frames in the space of situations (research note)

Artificial Intelligence
The frame problem in situation the calculus: a simple solution (sometimes) and a completeness result for goal regression

Artificial intelligence and mathematical theory of computation
Circumscription

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Nested abnormality theories

Artificial Intelligence
Using temporal logic to control search in a forward chaining planner

New directions in AI planning
Fast planning through planning graph analysis

Artificial Intelligence
Inferring state constraints for domain-independent planning

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Control knowledge in planning: benefits and tradeoffs

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Using temporal logics to express search control knowledge for planning

Artificial Intelligence
Knowlege in action: logical foundations for specifying and implementing dynamical systems

Knowlege in action: logical foundations for specifying and implementing dynamical systems
Formalizing Commonsense: Papers by John McCarthy

Formalizing Commonsense: Papers by John McCarthy
An ordering on subgoals for planning

Annals of Mathematics and Artificial Intelligence
Applications of the situation calculus to formalizing control-and strategic information: the prolog cut operator

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Pushing the envelope: planning, propositional logic, and stochastic search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Planning for temporally extended goals

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2

Heuristic planning: a declarative approach based on strategies for action selection

Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
From here to human-level AI

Artificial Intelligence
Horn Query Learning with Multiple Refinement

SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the declarative formalization of reasoning strategies by presenting declarative formalizations of: (1) the SNLP algorithm for nonlinear planning, and (2) a particular algorithm for blocks world nonlinear planning proposed in this paper. The formal models of a heuristic forward chaining planner, which can take advantage of declarative formalizations of action selection strategies, and of a reasoning strategy based planner, which can use declarative formalizations of reasoning strategies, are proposed. The effectiveness of these systems is studied from formal and empirical points of view. Empirical results showing how the use of declarative formalizations of reasoning strategies can reduce the amount of search required for solving planning problems (with respect to state of the art planning systems) are presented.