Coinductive semantics of Horn Clauses with compact constraint:
Abstract: "A constraint language L with an interpretation in the domain [formula] of non-well-founded sets over a finite set A of atoms which is hereditary finite with a cardinality no more than [kappa] is proposed. L is a qualifier free first order sublanguage with equality, subsumption, disju...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1990
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
562 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "A constraint language L with an interpretation in the domain [formula] of non-well-founded sets over a finite set A of atoms which is hereditary finite with a cardinality no more than [kappa] is proposed. L is a qualifier free first order sublanguage with equality, subsumption, disjunction, and negation. It is proved that the domain [formula] is solution compact and L is satisfication complete in the sense of constraint logic programming (CLP) schema. According to the schema we have now CLP(AFA) just as CLP(R), where R is the domain of real numbers. By general theory of the CLP scheme completeness and soundness theorem are obtained for the class of canonical programs A characterization of the canonical programs is given in terms of bisimulation relation. Operationally this is equivalent to that variables in negative constraints must be grounded in a finite number of steps on the computation. These results are shown directly based on the AFA set theory. A declarative semantics and an operational semantics of a given Horn clause program over the constraint language L are defined coinductively in the domain [formula]. Soundness and completeness are proved by showing a simulation relation between two semantic domains. Basic computational concepts of CLP schema are well understood in this method of ZFC-/AFA set theory A large part of existing constraint logic programming and unification grammar formalisms are reconstructed in the domain [formula]. |
| Beschreibung: | 24 s.- |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010949695 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960916s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)24838860 | ||
| 035 | |a (DE-599)BVBBV010949695 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Mukai, Kuniaki |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Coinductive semantics of Horn Clauses with compact constraint |c by K. Mukai |
| 264 | 1 | |a Tokyo, Japan |c 1990 | |
| 300 | |a 24 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 562 | |
| 520 | 3 | |a Abstract: "A constraint language L with an interpretation in the domain [formula] of non-well-founded sets over a finite set A of atoms which is hereditary finite with a cardinality no more than [kappa] is proposed. L is a qualifier free first order sublanguage with equality, subsumption, disjunction, and negation. It is proved that the domain [formula] is solution compact and L is satisfication complete in the sense of constraint logic programming (CLP) schema. According to the schema we have now CLP(AFA) just as CLP(R), where R is the domain of real numbers. By general theory of the CLP scheme completeness and soundness theorem are obtained for the class of canonical programs | |
| 520 | 3 | |a A characterization of the canonical programs is given in terms of bisimulation relation. Operationally this is equivalent to that variables in negative constraints must be grounded in a finite number of steps on the computation. These results are shown directly based on the AFA set theory. A declarative semantics and an operational semantics of a given Horn clause program over the constraint language L are defined coinductively in the domain [formula]. Soundness and completeness are proved by showing a simulation relation between two semantic domains. Basic computational concepts of CLP schema are well understood in this method of ZFC-/AFA set theory | |
| 520 | 3 | |a A large part of existing constraint logic programming and unification grammar formalisms are reconstructed in the domain [formula]. | |
| 650 | 4 | |a Horn clauses | |
| 650 | 4 | |a Logic programming | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 562 |w (DE-604)BV010923438 |9 562 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007323575 | ||
Datensatz im Suchindex
| _version_ | 1804125436758720512 |
|---|---|
| any_adam_object | |
| author | Mukai, Kuniaki |
| author_facet | Mukai, Kuniaki |
| author_role | aut |
| author_sort | Mukai, Kuniaki |
| author_variant | k m km |
| building | Verbundindex |
| bvnumber | BV010949695 |
| ctrlnum | (OCoLC)24838860 (DE-599)BVBBV010949695 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02466nam a2200325 cb4500</leader><controlfield tag="001">BV010949695</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960916s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24838860</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010949695</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">Mukai, Kuniaki</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Coinductive semantics of Horn Clauses with compact constraint</subfield><subfield code="c">by K. Mukai</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24 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ō <Tōkyō>: ICOT technical report</subfield><subfield code="v">562</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A constraint language L with an interpretation in the domain [formula] of non-well-founded sets over a finite set A of atoms which is hereditary finite with a cardinality no more than [kappa] is proposed. L is a qualifier free first order sublanguage with equality, subsumption, disjunction, and negation. It is proved that the domain [formula] is solution compact and L is satisfication complete in the sense of constraint logic programming (CLP) schema. According to the schema we have now CLP(AFA) just as CLP(R), where R is the domain of real numbers. By general theory of the CLP scheme completeness and soundness theorem are obtained for the class of canonical programs</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">A characterization of the canonical programs is given in terms of bisimulation relation. Operationally this is equivalent to that variables in negative constraints must be grounded in a finite number of steps on the computation. These results are shown directly based on the AFA set theory. A declarative semantics and an operational semantics of a given Horn clause program over the constraint language L are defined coinductively in the domain [formula]. Soundness and completeness are proved by showing a simulation relation between two semantic domains. Basic computational concepts of CLP schema are well understood in this method of ZFC-/AFA set theory</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">A large part of existing constraint logic programming and unification grammar formalisms are reconstructed in the domain [formula].</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Horn clauses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">562</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">562</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007323575</subfield></datafield></record></collection> |
| id | DE-604.BV010949695 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:32Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007323575 |
| oclc_num | 24838860 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 24 s.- |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| 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 |
| spelling | Mukai, Kuniaki Verfasser aut Coinductive semantics of Horn Clauses with compact constraint by K. Mukai Tokyo, Japan 1990 24 s.- txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 562 Abstract: "A constraint language L with an interpretation in the domain [formula] of non-well-founded sets over a finite set A of atoms which is hereditary finite with a cardinality no more than [kappa] is proposed. L is a qualifier free first order sublanguage with equality, subsumption, disjunction, and negation. It is proved that the domain [formula] is solution compact and L is satisfication complete in the sense of constraint logic programming (CLP) schema. According to the schema we have now CLP(AFA) just as CLP(R), where R is the domain of real numbers. By general theory of the CLP scheme completeness and soundness theorem are obtained for the class of canonical programs A characterization of the canonical programs is given in terms of bisimulation relation. Operationally this is equivalent to that variables in negative constraints must be grounded in a finite number of steps on the computation. These results are shown directly based on the AFA set theory. A declarative semantics and an operational semantics of a given Horn clause program over the constraint language L are defined coinductively in the domain [formula]. Soundness and completeness are proved by showing a simulation relation between two semantic domains. Basic computational concepts of CLP schema are well understood in this method of ZFC-/AFA set theory A large part of existing constraint logic programming and unification grammar formalisms are reconstructed in the domain [formula]. Horn clauses Logic programming Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 562 (DE-604)BV010923438 562 |
| spellingShingle | Mukai, Kuniaki Coinductive semantics of Horn Clauses with compact constraint Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Horn clauses Logic programming |
| title | Coinductive semantics of Horn Clauses with compact constraint |
| title_auth | Coinductive semantics of Horn Clauses with compact constraint |
| title_exact_search | Coinductive semantics of Horn Clauses with compact constraint |
| title_full | Coinductive semantics of Horn Clauses with compact constraint by K. Mukai |
| title_fullStr | Coinductive semantics of Horn Clauses with compact constraint by K. Mukai |
| title_full_unstemmed | Coinductive semantics of Horn Clauses with compact constraint by K. Mukai |
| title_short | Coinductive semantics of Horn Clauses with compact constraint |
| title_sort | coinductive semantics of horn clauses with compact constraint |
| topic | Horn clauses Logic programming |
| topic_facet | Horn clauses Logic programming |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT mukaikuniaki coinductivesemanticsofhornclauseswithcompactconstraint |