Multiworld augmented term rewriting

Technical Report

Público Deposited

Citeable URL: https://ir.library.oregonstate.edu/concern/technical_reports/47429b47t

Descriptions

Attribute Name	Values
Creator	Oregon State University. Dept. of Computer Science Takikawa, Masami Crowl, Lawrence Alan, 1959-
Abstract	Augmented term rewriting (ATR) is a simple, uniform, and extensible computational model for constraint programming. Unfortunately, ATR cannot solve combinatorial constraint satisfaction problems (CCSPs). To enable solution of CCSPs, we introduce (don't know) nondeterminism into ATR via the choice expression, which identifies a set of possible values that may satisfy the constraints. The selection of a possible value from the expression represents one of many "possible worlds" in which the constraints may be satised. We show that our extended ATR, multiworld augmented term rewriting (MATR), is capable of expressing CCSPs concisely and readably via examples and via our experience with a significant application. We also show that an implementation of MATR can use the efficient constrain-and-generate technique for solving CCSPs, and describe our prototype implementation.
Resource Type	Research Paper
Fecha Disponible	2012-04-17T23:21:49+00:00
Fecha de Emisión	1994-11
Series	Technical report (Oregon State University. Department of Computer Science)
Subject	Constraint programming (Computer science)
Declaración de derechos	Copyright Not Evaluated
Publisher	Corvallis, OR : Oregon State University, Dept. of Computer Science
Peer Reviewed	No
Language	English [eng]
Replaces	http://hdl.handle.net/1957/28791

Miniatura	Título	Fecha de subida	Visibilidad	Acciones
	Multiworld_augmented_term_rewriting.pdf	2017-07-18	Público	Descargar