The study of formal nonmonotonic reasoning has been motivated to a large degree by the need to solve the frame problem and other problems related to representing actions. New efficient implementations of nonmonotonic reasoning, such as SMODELS and DLV, can be used to solve many computational problems that involve actions, including plan generation. SMODELS and its competitors are essential to implement a new approach to knowledge representation and reasoning: to compute solutions to a problem by computing the stable models (answer sets) of the theory that represents it. Marek and Truszczyński call this paradigm Stable model programming. We are trying to assess the viability of stable logic programming for agent specification and planning in realistic scenarios. To do so, we present an encoding of plan generation within the lines of Lifschitz's Answer set planning and evaluate its performance in the simple scenario of Blocks world. Several optimization techniques stemming from mainstream as well as satisfiability planning are added to our planner, and their impact is discussed.

Experiments in answer sets planning (Extended Abstract) / M. Balduccini, G. Brignoli, G.A. Lanzarone, F. Magni, A. Provetti (LECTURE NOTES IN ARTIFICIAL INTELLIGENCE). - In: MICAI 2000: Advances in Artificial Intelligence / [a cura di] O. Cairó, L.E. Sucar, F.J. Cantu. - [s.l] : Springer, 2000. - ISBN 978-3-540-67354-5. - pp. 95-107 (( Intervento presentato al 1. convegno Mexican International Conference on Artificial Intelligence, MICAI 2000 tenutosi a Acapulco nel 2000 [10.1007/10720076_9].

Experiments in answer sets planning (Extended Abstract)

A. Provetti
Ultimo
2000

Abstract

The study of formal nonmonotonic reasoning has been motivated to a large degree by the need to solve the frame problem and other problems related to representing actions. New efficient implementations of nonmonotonic reasoning, such as SMODELS and DLV, can be used to solve many computational problems that involve actions, including plan generation. SMODELS and its competitors are essential to implement a new approach to knowledge representation and reasoning: to compute solutions to a problem by computing the stable models (answer sets) of the theory that represents it. Marek and Truszczyński call this paradigm Stable model programming. We are trying to assess the viability of stable logic programming for agent specification and planning in realistic scenarios. To do so, we present an encoding of plan generation within the lines of Lifschitz's Answer set planning and evaluate its performance in the simple scenario of Blocks world. Several optimization techniques stemming from mainstream as well as satisfiability planning are added to our planner, and their impact is discussed.
Settore INF/01 - Informatica
2000
The American Association for Artificial Intelligence
International Joint Conference on Artificial Intelligence
The Mexican Society for Computer Science
CONACYT REDII
Book Part (author)
File in questo prodotto:
File Dimensione Formato  
balduccini-experiments-MICAI00.pdf

accesso riservato

Tipologia: Publisher's version/PDF
Dimensione 166.18 kB
Formato Adobe PDF
166.18 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/965236
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 0
social impact