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
GCLA II. A definitional approach to control
RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.ORCID iD: 0000-0002-9331-0352
1992 (English)Report (Other academic)
Abstract [en]

This paper describes the logic programming language GCLA II, its operational semantics and parts of its theortical foundations. GCLA II is a generalization of the language GCLA (Generalized Horn Clause Language) argumented by a method to guide and constrain proof search. The method is based on specification of strategies in a meta language that is a sub language of GCLA itself. A GCLA II program is partioned into two distinct parts. One is used to express the declarative content of the program, while the other is used to define the possible inference made from this declarative knowledge. Altough the intended use of the declarative part and the procedural parts are quite different, they can both be described in the formalism of partial inductive definitions. Thus we preserve a declarative reading of the program as a whole. In particular, given certain sythactic constraints on the program, the heuristics associated with proof search does not affect the declarative reading of the declarative part of the program at all. Several experiments intepreters and a compiler from GCLA II to Prolog have been implemented.

Place, publisher, year, edition, pages
Swedish Institute of Computer Science , 1992, 1. , p. 57
Series
SICS Research Report, ISSN 0283-3638 ; R92:09
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-22163OAI: oai:DiVA.org:ri-22163DiVA, id: diva2:1041706
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-02-08Bibliographically approved

Open Access in DiVA

fulltext(2153 kB)0 downloads
File information
File name FULLTEXT04.pdfFile size 2153 kBChecksum SHA-512
821b79248f1b8615ce3c4416fa051cceb6fa80feb627f7eca95c8199d5e3ea9fd1bb74e75db47a6427817b7c6f8ba122304c09924913ef9f58bc38e7718bd312
Type fulltextMimetype application/pdf
fulltext(3248 kB)0 downloads
File information
File name FULLTEXT05.pdfFile size 3248 kBChecksum SHA-512
043618eff824d7b1c0e63382099cec5a4d625a7210ad96f0fbe0954e3982a8d681deb2dfe264b7f6ab15ece8fba4383250ad637694e5b18747a59a3cf20b0cd0
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Kreuger, Per
By organisation
Decisions, Networks and Analytics lab
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar
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

urn-nbn

Altmetric score

urn-nbn
Total: 7 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.34.0