A correct top-down proof procedure for a general logic program with integrity constraints

Abstract: "We present a correct top-down procedure for every general logic program with integrity constraints. Recently, stable model semantics [4] of logic programs was proposed and has been investigated intensively. Although there are correct bottom-up procedures for every general logic progr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Satoh, Ken 1959- (VerfasserIn), Iwayama, Noboru (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Tokyo, Japan 1992
Schriftenreihe:Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 739
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

MARC

LEADER 00000nam a2200000 cb4500
001 BV010956256
003 DE-604
005 00000000000000.0
007 t|
008 960918s1992 xx |||| 00||| engod
035 |a (OCoLC)26562345 
035 |a (DE-599)BVBBV010956256 
040 |a DE-604  |b ger  |e rakddb 
041 0 |a eng 
049 |a DE-91G 
100 1 |a Satoh, Ken  |d 1959-  |e Verfasser  |0 (DE-588)134075757  |4 aut 
245 1 0 |a A correct top-down proof procedure for a general logic program with integrity constraints  |c by K. Satoh & N. Iwayama- 
264 1 |a Tokyo, Japan  |c 1992 
300 |a 16 S. 
336 |b txt  |2 rdacontent 
337 |b n  |2 rdamedia 
338 |b nc  |2 rdacarrier 
490 1 |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report  |v 739 
520 3 |a Abstract: "We present a correct top-down procedure for every general logic program with integrity constraints. Recently, stable model semantics [4] of logic programs was proposed and has been investigated intensively. Although there are correct bottom-up procedures for every general logic program [10, 3, 12] based on stable models, there are no proposed correct top-down procedure for every general logic program. Our proposed procedure is correct not only for successful derivation but also for finite failure. This procedure is an extension of Eshghi's procedure [2] which is correct for every call-consistent logic program, and can be regarded as a combination of the ancestor-resolution [8] and consistency checking in updates of implicit deletions [11]." 
650 4 |a Logic programming 
700 1 |a Iwayama, Noboru  |e Verfasser  |4 aut 
830 0 |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report  |v 739  |w (DE-604)BV010923438  |9 739 
943 1 |a oai:aleph.bib-bvb.de:BVB01-007328417 

Datensatz im Suchindex

DE-BY-TUM_call_number 0111 2001 B 6123
DE-BY-TUM_katkey 766198
DE-BY-TUM_location 01
DE-BY-TUM_media_number 040010305961
_version_ 1820856868554145792
any_adam_object
author Satoh, Ken 1959-
Iwayama, Noboru
author_GND (DE-588)134075757
author_facet Satoh, Ken 1959-
Iwayama, Noboru
author_role aut
aut
author_sort Satoh, Ken 1959-
author_variant k s ks
n i ni
building Verbundindex
bvnumber BV010956256
ctrlnum (OCoLC)26562345
(DE-599)BVBBV010956256
format Book
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01805nam a2200301 cb4500</leader><controlfield tag="001">BV010956256</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">960918s1992 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26562345</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010956256</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Satoh, Ken</subfield><subfield code="d">1959-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)134075757</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A correct top-down proof procedure for a general logic program with integrity constraints</subfield><subfield code="c">by K. Satoh &amp; N. Iwayama-</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō &lt;Tōkyō&gt;: ICOT technical report</subfield><subfield code="v">739</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present a correct top-down procedure for every general logic program with integrity constraints. Recently, stable model semantics [4] of logic programs was proposed and has been investigated intensively. Although there are correct bottom-up procedures for every general logic program [10, 3, 12] based on stable models, there are no proposed correct top-down procedure for every general logic program. Our proposed procedure is correct not only for successful derivation but also for finite failure. This procedure is an extension of Eshghi's procedure [2] which is correct for every call-consistent logic program, and can be regarded as a combination of the ancestor-resolution [8] and consistency checking in updates of implicit deletions [11]."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Iwayama, Noboru</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō &lt;Tōkyō&gt;: ICOT technical report</subfield><subfield code="v">739</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">739</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007328417</subfield></datafield></record></collection>
id DE-604.BV010956256
illustrated Not Illustrated
indexdate 2024-12-23T14:17:59Z
institution BVB
language English
oai_aleph_id oai:aleph.bib-bvb.de:BVB01-007328417
oclc_num 26562345
open_access_boolean
owner DE-91G
DE-BY-TUM
owner_facet DE-91G
DE-BY-TUM
physical 16 S.
publishDate 1992
publishDateSearch 1992
publishDateSort 1992
record_format marc
series Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
series2 Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
spellingShingle Satoh, Ken 1959-
Iwayama, Noboru
A correct top-down proof procedure for a general logic program with integrity constraints
Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
Logic programming
title A correct top-down proof procedure for a general logic program with integrity constraints
title_auth A correct top-down proof procedure for a general logic program with integrity constraints
title_exact_search A correct top-down proof procedure for a general logic program with integrity constraints
title_full A correct top-down proof procedure for a general logic program with integrity constraints by K. Satoh & N. Iwayama-
title_fullStr A correct top-down proof procedure for a general logic program with integrity constraints by K. Satoh & N. Iwayama-
title_full_unstemmed A correct top-down proof procedure for a general logic program with integrity constraints by K. Satoh & N. Iwayama-
title_short A correct top-down proof procedure for a general logic program with integrity constraints
title_sort a correct top down proof procedure for a general logic program with integrity constraints
topic Logic programming
topic_facet Logic programming
volume_link (DE-604)BV010923438
work_keys_str_mv AT satohken acorrecttopdownproofprocedureforagenerallogicprogramwithintegrityconstraints
AT iwayamanoboru acorrecttopdownproofprocedureforagenerallogicprogramwithintegrityconstraints