CLEDA - LEDA with constraint logic programming Public Deposited

http://ir.library.oregonstate.edu/concern/technical_reports/cz30pv05m

Cover lists authors as: Tim Budd, Masami Takikawsa [i.e. Takikawa].

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • CLEDA is a new programming language descended from the multiparadigm, strongly typed, compiled programming language LEDA. In addition to the four paradigms supported by LEDA, which are imperative, functional, object-oriented, and relational, CLEDA supports the constraint logic programming paradigm. CLEDA is intended to be used to write applications that involve constrained search problems. Constructs provided to support constraint logic programming include: [1] Built-in inference engine: All boolean expressions are "predicates" in the logic programming sense. Built-in operators "&" and "|" support left-most depth first search and automatic backtracking. Logical expressions can be used in any programming paradigms. [2] User definable constraint solver: Constrained variables of a domain are represented in terms of objects of the corresponding class. Operations and predicates for the domain are written as methods of the class. To restore the necessary information upon backtracking, CLEDA introduces a new built-in operator "<-". This operator is similar to the assignment operator ":=", but saves the necessary information to be recovered when backtracking occurs. This paper describes the design and implementation of the language CLEDA.
Resource Type
Date Available
Date Issued
Series
Keyword
Subject
Rights Statement
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2012-04-11T22:43:49Z (GMT) No. of bitstreams: 1 Cleda Leda with constraint logic programming.pdf: 238726 bytes, checksum: 25220951160fbcb3f47112dc9e984166 (MD5)
  • description.provenance : Submitted by Laura Wilson (laura.wilson@oregonstate.edu) on 2012-04-11T22:42:44Z No. of bitstreams: 1 Cleda Leda with constraint logic programming.pdf: 238726 bytes, checksum: 25220951160fbcb3f47112dc9e984166 (MD5)
  • description.provenance : Made available in DSpace on 2012-04-11T22:43:49Z (GMT). No. of bitstreams: 1 Cleda Leda with constraint logic programming.pdf: 238726 bytes, checksum: 25220951160fbcb3f47112dc9e984166 (MD5) Previous issue date: 1993-03-05

Relationships

In Administrative Set:
Last modified: 07/18/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items