Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Implementational Issues in GCLA: A-Sufficiency and the Definiens Operation
RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.ORCID iD: 0000-0002-0236-783X
1993 (English)Report (Refereed)
Abstract [en]

We present algorithms for computing A-sufficient substitutions and constraint sets together with the definiens operation. These operations are primitive operations in the language GCLA. The paper first defines those primitives, which together form a dual rule to SLD resolution, and then describes the different algorithms and some of their properties together with examples. One of the algorithms shows how a definition can be compiled into a representation holding all possible A-sufficient substitutions/constraint sets together with their corresponding definiens. This representation makes the computation at runtime of a definiens and an A-sufficient substitution/constraint set have the same complexity as the table lookup operation clause/2 in Prolog. The paper also describes the generalisation from unification (sets of equalities) to constraint sets and satisfiability of systems of equalities and inequalities.

Place, publisher, year, edition, pages
Swedish Institute of Computer Science , 1993, 1.
Series
SICS Research Report, ISSN 0283-3638 ; R93:02
Keyword [en]
GCLA, inequality, constraints, negation
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-21371OAI: oai:DiVA.org:ri-21371DiVA: diva2:1041407
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2017-08-24Bibliographically approved

Open Access in DiVA

fulltext(2447 kB)1 downloads
File information
File name FULLTEXT01.pdfFile size 2447 kBChecksum SHA-512
14d38e67af924b40c352a6dce238d018ab5d2d7b69fae71a66bcf39348a0601f61d127af9348045e3c3e7f3c676bebbc1206aca5d219a3b48adfb993f322c902
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Aronsson, Martin
By organisation
Decisions, Networks and Analytics lab
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 1 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 18 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
v. 2.28.0