liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
ICONStraint: a dependency directed constraint maintenance system
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.ORCID iD: 0000-0003-1942-6063
1987 (English)Licentiate thesis, monograph (Other academic)
Abstract [en]

Problem solving involves search. In AI we try to find ways of avoiding or minimizing search. An effective approach is to exploit knowledge of the problem domain. Such knowledge often takes the form of a set of constraints. In general, a constraint represents a required relationship among some variables. For this reason we usually assume the existence of some machinery that can enforce a given set of constraints and resolve the conflicts that arise when these are violated. Programming systems based on constraints have been successfully applied to circuit analysis, design and simulation, scene analysis, plan generation, hardware diagnosis and qualitative reasoning. This thesis presents ICONStraint, a programming language based on the constraints paradigm of computation and gives a characterization of consistency conditions and the operations for ensuring consistency in constraint networks designed in the language. In ICONStraint we represent constraint systems in dependency structures and use reason maintenance, local propagation and dependency directed backtracking for computation and consistency maintenance. ICONStraint has been implemented in Interlisp-D.

Place, publisher, year, edition, pages
Linköping: Department of Computer Science, Linköpings universitet , 1987. , p. 147
Series
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 71
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-155725Local ID: LiU-Tek-Lic-1986:11ISBN: 9178700620 (print)OAI: oai:DiVA.org:liu-155725DiVA, id: diva2:1298918
Available from: 2019-03-25 Created: 2019-03-25 Last updated: 2019-03-25Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records BETA

Maleki, Jalal

Search in DiVA

By author/editor
Maleki, Jalal
By organisation
Department of Computer and Information ScienceThe Institute of Technology
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf