Incremental constraint satisfaction for equational logic programming:
Abstract: "In this paper we are concerned with an instance of the CLP scheme specialized in solving equations with respect to a Horn equational theory [epsilon]. The intended structure [eta]/[epsilon] is given by the finest partition induced by [epsilon] on the Herbrand Universe [eta] over a fi...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Pisa
1991
|
| Series: | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report
1991,20 |
| Subjects: | |
| Summary: | Abstract: "In this paper we are concerned with an instance of the CLP scheme specialized in solving equations with respect to a Horn equational theory [epsilon]. The intended structure [eta]/[epsilon] is given by the finest partition induced by [epsilon] on the Herbrand Universe [eta] over a finite one sorted alphabet. This work deals with the description of an incremental constraint solver as the kernel of an operational semantics for the language CLP ([eta]/[epsilon]) The primary issues are: how to verify the solvability of constraints in the structure [eta]/[epsilon] by using some sound and complete semantic unification procedure such as narrowing, how to simplify constraints in a computation sequence, how to achieve incrementality in the computation process and how to profit from finitely failed derivations as a heuristic for optimizing the algorithms. Fixpoint and model-theoretic semantics are obtained in a straightforward way. |
| Physical Description: | 39 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010848112 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960712s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)28227679 | ||
| 035 | |a (DE-599)BVBBV010848112 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Alpuente, María |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Incremental constraint satisfaction for equational logic programming |c M. Alpuente ; M. Falaschi ; G. Levi |
| 264 | 1 | |a Pisa |c 1991 | |
| 300 | |a 39 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |v 1991,20 | |
| 520 | 3 | |a Abstract: "In this paper we are concerned with an instance of the CLP scheme specialized in solving equations with respect to a Horn equational theory [epsilon]. The intended structure [eta]/[epsilon] is given by the finest partition induced by [epsilon] on the Herbrand Universe [eta] over a finite one sorted alphabet. This work deals with the description of an incremental constraint solver as the kernel of an operational semantics for the language CLP ([eta]/[epsilon]) | |
| 520 | 3 | |a The primary issues are: how to verify the solvability of constraints in the structure [eta]/[epsilon] by using some sound and complete semantic unification procedure such as narrowing, how to simplify constraints in a computation sequence, how to achieve incrementality in the computation process and how to profit from finitely failed derivations as a heuristic for optimizing the algorithms. Fixpoint and model-theoretic semantics are obtained in a straightforward way. | |
| 650 | 4 | |a Logic programming | |
| 700 | 1 | |a Falaschi, Moreno |e Verfasser |4 aut | |
| 700 | 1 | |a Scutellà, Maria Grazia |e Verfasser |4 aut | |
| 810 | 2 | |a Dipartimento di Informatica: Technical report |t Università degli Studi <Pisa> |v 1991,20 |w (DE-604)BV010841375 |9 1991,20 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007250757 | ||
Record in the Search Index
| _version_ | 1804125334037069824 |
|---|---|
| any_adam_object | |
| author | Alpuente, María Falaschi, Moreno Scutellà, Maria Grazia |
| author_facet | Alpuente, María Falaschi, Moreno Scutellà, Maria Grazia |
| author_role | aut aut aut |
| author_sort | Alpuente, María |
| author_variant | m a ma m f mf m g s mg mgs |
| building | Verbundindex |
| bvnumber | BV010848112 |
| ctrlnum | (OCoLC)28227679 (DE-599)BVBBV010848112 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02034nam a2200325 cb4500</leader><controlfield tag="001">BV010848112</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960712s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28227679</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010848112</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">Alpuente, María</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Incremental constraint satisfaction for equational logic programming</subfield><subfield code="c">M. Alpuente ; M. Falaschi ; G. Levi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pisa</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">39 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">Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report</subfield><subfield code="v">1991,20</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper we are concerned with an instance of the CLP scheme specialized in solving equations with respect to a Horn equational theory [epsilon]. The intended structure [eta]/[epsilon] is given by the finest partition induced by [epsilon] on the Herbrand Universe [eta] over a finite one sorted alphabet. This work deals with the description of an incremental constraint solver as the kernel of an operational semantics for the language CLP ([eta]/[epsilon])</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The primary issues are: how to verify the solvability of constraints in the structure [eta]/[epsilon] by using some sound and complete semantic unification procedure such as narrowing, how to simplify constraints in a computation sequence, how to achieve incrementality in the computation process and how to profit from finitely failed derivations as a heuristic for optimizing the algorithms. Fixpoint and model-theoretic semantics are obtained in a straightforward way.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Falaschi, Moreno</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Scutellà, Maria Grazia</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Dipartimento di Informatica: Technical report</subfield><subfield code="t">Università degli Studi <Pisa></subfield><subfield code="v">1991,20</subfield><subfield code="w">(DE-604)BV010841375</subfield><subfield code="9">1991,20</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007250757</subfield></datafield></record></collection> |
| id | DE-604.BV010848112 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:59:54Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007250757 |
| oclc_num | 28227679 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 39 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |
| spelling | Alpuente, María Verfasser aut Incremental constraint satisfaction for equational logic programming M. Alpuente ; M. Falaschi ; G. Levi Pisa 1991 39 S. txt rdacontent n rdamedia nc rdacarrier Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report 1991,20 Abstract: "In this paper we are concerned with an instance of the CLP scheme specialized in solving equations with respect to a Horn equational theory [epsilon]. The intended structure [eta]/[epsilon] is given by the finest partition induced by [epsilon] on the Herbrand Universe [eta] over a finite one sorted alphabet. This work deals with the description of an incremental constraint solver as the kernel of an operational semantics for the language CLP ([eta]/[epsilon]) The primary issues are: how to verify the solvability of constraints in the structure [eta]/[epsilon] by using some sound and complete semantic unification procedure such as narrowing, how to simplify constraints in a computation sequence, how to achieve incrementality in the computation process and how to profit from finitely failed derivations as a heuristic for optimizing the algorithms. Fixpoint and model-theoretic semantics are obtained in a straightforward way. Logic programming Falaschi, Moreno Verfasser aut Scutellà, Maria Grazia Verfasser aut Dipartimento di Informatica: Technical report Università degli Studi <Pisa> 1991,20 (DE-604)BV010841375 1991,20 |
| spellingShingle | Alpuente, María Falaschi, Moreno Scutellà, Maria Grazia Incremental constraint satisfaction for equational logic programming Logic programming |
| title | Incremental constraint satisfaction for equational logic programming |
| title_auth | Incremental constraint satisfaction for equational logic programming |
| title_exact_search | Incremental constraint satisfaction for equational logic programming |
| title_full | Incremental constraint satisfaction for equational logic programming M. Alpuente ; M. Falaschi ; G. Levi |
| title_fullStr | Incremental constraint satisfaction for equational logic programming M. Alpuente ; M. Falaschi ; G. Levi |
| title_full_unstemmed | Incremental constraint satisfaction for equational logic programming M. Alpuente ; M. Falaschi ; G. Levi |
| title_short | Incremental constraint satisfaction for equational logic programming |
| title_sort | incremental constraint satisfaction for equational logic programming |
| topic | Logic programming |
| topic_facet | Logic programming |
| volume_link | (DE-604)BV010841375 |
| work_keys_str_mv | AT alpuentemaria incrementalconstraintsatisfactionforequationallogicprogramming AT falaschimoreno incrementalconstraintsatisfactionforequationallogicprogramming AT scutellamariagrazia incrementalconstraintsatisfactionforequationallogicprogramming |