<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">467988781</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180323112539.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170328e19900401xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF03037453</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF03037453</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="4">
   <subfield code="a">The programming language GCLA — A definitional approach to logic programming</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Martin Aronsson, Lars-Henrik Eriksson, Anette Gäredal, Lars Hallnäs, Peter Olin]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">We present a logic programming language, GCLA*** (Generalized horn Clause LAnguage), that is based on a generalization of Prolog. This generalization is unusual in that it takes a quite different view of the meaning of a logic program—a &quot;definitional” view rather than the traditional logical view. GCLA has a number of noteworthy properties, for instance hypothetical and non-monotonic reasoning. This makes implementation of reasoning in knowledge-based systems more direct in GCLA than in Prolog. GCLA is also general enough to incorporate functional programming as a special case. GCLA and its syntax and semantics are described. The use of various language constructs are illustrated with several examples.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Ohmsha, Ltd. and Springer, 1990</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Logic programming languages</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Logic and functional programming</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Partial inductive definitions</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Hypothetical reasoning</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Knowledge based systems languages</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Aronsson</subfield>
   <subfield code="D">Martin</subfield>
   <subfield code="u">Swedish Institute of Computer Science (SICS), Box 1263, S-164 28, Kista, Sweden</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Eriksson</subfield>
   <subfield code="D">Lars-Henrik</subfield>
   <subfield code="u">Swedish Institute of Computer Science (SICS), Box 1263, S-164 28, Kista, Sweden</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Gäredal</subfield>
   <subfield code="D">Anette</subfield>
   <subfield code="u">Swedish Institute of Computer Science (SICS), Box 1263, S-164 28, Kista, Sweden</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Hallnäs</subfield>
   <subfield code="D">Lars</subfield>
   <subfield code="u">Swedish Institute of Computer Science (SICS), Box 1263, S-164 28, Kista, Sweden</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Olin</subfield>
   <subfield code="D">Peter</subfield>
   <subfield code="u">Swedish Institute of Computer Science (SICS), Box 1263, S-164 28, Kista, Sweden</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">New Generation Computing</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">7/4(1990-04-01), 381-404</subfield>
   <subfield code="x">0288-3635</subfield>
   <subfield code="q">7:4&lt;381</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">7</subfield>
   <subfield code="o">354</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF03037453</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/BF03037453</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Aronsson</subfield>
   <subfield code="D">Martin</subfield>
   <subfield code="u">Swedish Institute of Computer Science (SICS), Box 1263, S-164 28, Kista, Sweden</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Eriksson</subfield>
   <subfield code="D">Lars-Henrik</subfield>
   <subfield code="u">Swedish Institute of Computer Science (SICS), Box 1263, S-164 28, Kista, Sweden</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Gäredal</subfield>
   <subfield code="D">Anette</subfield>
   <subfield code="u">Swedish Institute of Computer Science (SICS), Box 1263, S-164 28, Kista, Sweden</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Hallnäs</subfield>
   <subfield code="D">Lars</subfield>
   <subfield code="u">Swedish Institute of Computer Science (SICS), Box 1263, S-164 28, Kista, Sweden</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Olin</subfield>
   <subfield code="D">Peter</subfield>
   <subfield code="u">Swedish Institute of Computer Science (SICS), Box 1263, S-164 28, Kista, Sweden</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">New Generation Computing</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">7/4(1990-04-01), 381-404</subfield>
   <subfield code="x">0288-3635</subfield>
   <subfield code="q">7:4&lt;381</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">7</subfield>
   <subfield code="o">354</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
