uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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
Logic Program Synthesis as Problem Reduction using Combining Forms
Uppsala University, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Faculty of Social Sciences, Department of Information Science. DATA- OCH SYSTEMVETENSKAP.
2001 (English)In: JOURNAL OF AUTOMATED SOFTWARE ENGINEERING, no 8, 167-193 p.Article in journal (Refereed) Published
Abstract [en]

This paper presents an approach to inductive synthesis of logic programs from examples using problem decomposition and problem reduction principles. This is in contrast to the prevailing logic program induction paradigm, which relies on generalization of

Place, publisher, year, edition, pages
KLUWER ACADEMIC PUBLISHERS , 2001. no 8, 167-193 p.
Keyword [en]
predicate combinators, recursion operators, synthesis by composition and specialization, inductive synthesis, program schemata
Identifiers
URN: urn:nbn:se:uu:diva-39061OAI: oai:DiVA.org:uu-39061DiVA: diva2:66960
Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-14

Open Access in DiVA

No full text

By organisation
Department of Information Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 372 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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