Göm menyn
Files: Description Format
Fulltext PDF (requires Acrobat Reader)
Fulltext PostScript (requires a PostScript Reader)
Author: Erik Sandewall
Article title: Assessments of Ramification Methods that Use Static Domain Constraints
Publ. type: Article
Volume: 1
Article No: 3
Language: English
Abstract [en]: The paper analyzes and compares methods for ramification, or for update, which are based on minimization of change while respecting static domain constraints. The main results are:
  • An underlying semantics for propagation oriented ramification, called causal propagation semantics
  • Comparative assessments of a number of previously proposed entailment methods for ramification, in particular, methods based on minimization of change after partitioning of the state variables (fluents). This includes the methods previously proposed by del Val and Shoham, by Kartha and Lifschitz, and by our group.
  • Assessment of two ranges of sound applicability for one of those entailment methods, MSCC, relative to causal propagation semantics.
  • Identification of an essential feature for minimization-based approaches to ramification, namely changeset-partitioning.
Keywords: Ramification, static domain constraints
Publisher: Linköping University Electronic Press
Year: 1996
Available: 1996-11-05
No. of pages: 19
Series: Linköping Electronic Articles in Computer and Information Science
ISSN: 1401-9841

Responsible for this page: Peter Berkesand
Last updated: 2017-02-21