Planning and learning in permutation groups

Amos Fiat, Shahar Moses, Adi Shamir, Ilan Shimshoni, G. Tardos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

Planning is defined as the problem of synthesizing a desired behavior from given basic operations, and learning is defined as the dual problem of analyzing a given behavior to determine the unknown basic operations. Algorithms for solving these problems in the context of invertible operations on finite-state environments are developed. In addition to their obvious artificial intelligence applications, the algorithms can efficiently find the shortest way to solve Rubik's cube, test ping-pong protocols, and solve systems of equations over permutation groups.

Original languageEnglish
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherPubl by IEEE
Pages274-279
Number of pages6
ISBN (Print)0818619821
Publication statusPublished - Nov 1989
Event30th Annual Symposium on Foundations of Computer Science - Research Triangle Park, NC, USA
Duration: Oct 30 1989Nov 1 1989

Other

Other30th Annual Symposium on Foundations of Computer Science
CityResearch Triangle Park, NC, USA
Period10/30/8911/1/89

Fingerprint

Planning
Artificial intelligence

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Fiat, A., Moses, S., Shamir, A., Shimshoni, I., & Tardos, G. (1989). Planning and learning in permutation groups. In Annual Symposium on Foundations of Computer Science (Proceedings) (pp. 274-279). Publ by IEEE.

Planning and learning in permutation groups. / Fiat, Amos; Moses, Shahar; Shamir, Adi; Shimshoni, Ilan; Tardos, G.

Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, 1989. p. 274-279.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fiat, A, Moses, S, Shamir, A, Shimshoni, I & Tardos, G 1989, Planning and learning in permutation groups. in Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, pp. 274-279, 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC, USA, 10/30/89.
Fiat A, Moses S, Shamir A, Shimshoni I, Tardos G. Planning and learning in permutation groups. In Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE. 1989. p. 274-279
Fiat, Amos ; Moses, Shahar ; Shamir, Adi ; Shimshoni, Ilan ; Tardos, G. / Planning and learning in permutation groups. Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, 1989. pp. 274-279
@inproceedings{b43df3951c9a4e94960bc5d5bcd2ff99,
title = "Planning and learning in permutation groups",
abstract = "Planning is defined as the problem of synthesizing a desired behavior from given basic operations, and learning is defined as the dual problem of analyzing a given behavior to determine the unknown basic operations. Algorithms for solving these problems in the context of invertible operations on finite-state environments are developed. In addition to their obvious artificial intelligence applications, the algorithms can efficiently find the shortest way to solve Rubik's cube, test ping-pong protocols, and solve systems of equations over permutation groups.",
author = "Amos Fiat and Shahar Moses and Adi Shamir and Ilan Shimshoni and G. Tardos",
year = "1989",
month = "11",
language = "English",
isbn = "0818619821",
pages = "274--279",
booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Planning and learning in permutation groups

AU - Fiat, Amos

AU - Moses, Shahar

AU - Shamir, Adi

AU - Shimshoni, Ilan

AU - Tardos, G.

PY - 1989/11

Y1 - 1989/11

N2 - Planning is defined as the problem of synthesizing a desired behavior from given basic operations, and learning is defined as the dual problem of analyzing a given behavior to determine the unknown basic operations. Algorithms for solving these problems in the context of invertible operations on finite-state environments are developed. In addition to their obvious artificial intelligence applications, the algorithms can efficiently find the shortest way to solve Rubik's cube, test ping-pong protocols, and solve systems of equations over permutation groups.

AB - Planning is defined as the problem of synthesizing a desired behavior from given basic operations, and learning is defined as the dual problem of analyzing a given behavior to determine the unknown basic operations. Algorithms for solving these problems in the context of invertible operations on finite-state environments are developed. In addition to their obvious artificial intelligence applications, the algorithms can efficiently find the shortest way to solve Rubik's cube, test ping-pong protocols, and solve systems of equations over permutation groups.

UR - http://www.scopus.com/inward/record.url?scp=0024766726&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024766726&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0818619821

SP - 274

EP - 279

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - Publ by IEEE

ER -