<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">467988560</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180323112538.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170328e19900601xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF03037512</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF03037512</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Jiang</subfield>
   <subfield code="D">Y.</subfield>
   <subfield code="u">Computer Laboratory, Cambridge University, CB2 3QG, Cambridge, England</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="3">
   <subfield code="a">An epistemic model of logic programming</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Y. Jiang]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">If we view an ordinary logic program as a set of beliefs of animplicit agent about a world, then acompletely epistemic logical view of logic programming would yield a further extension that allows us to reasonexplicitly about beliefs and non-beliefs of any agents. In particular, such a view will accommodate nested beliefs, introspective reasoning of self-beliefs and meta-reasoning of others' beliefs. In this paper, we present the logical foundation of such a view by developing acomputational logic ofquantified epistemic notions. The semantics of the logic is an extension of Kripke'spossible-worlds semantics with variable domains to capture theintensional imputation problem in epistemic notions. A syntactical characterization of this semantics is developed to yield a clausal form of the logic. An efficient resolution mechanisation of this form is described. It is achieved by augmenting Konolige'sB-resolution with a semi-set-of-support strategy with linear resolution. Further refinements on a Horn clausal form of the logic with negation as failure are also discussed.</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">Modal Logics</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Knowledge Representation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Epistemic Logic Programming</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Intension/Extension</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Possible-Worlds Semantics</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Theory Resolution and Negation as Failure</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">New Generation Computing</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">8/1(1990-06-01), 33-59</subfield>
   <subfield code="x">0288-3635</subfield>
   <subfield code="q">8:1&lt;33</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">8</subfield>
   <subfield code="o">354</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF03037512</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/BF03037512</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">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Jiang</subfield>
   <subfield code="D">Y.</subfield>
   <subfield code="u">Computer Laboratory, Cambridge University, CB2 3QG, Cambridge, England</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">8/1(1990-06-01), 33-59</subfield>
   <subfield code="x">0288-3635</subfield>
   <subfield code="q">8:1&lt;33</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">8</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>
