Reasoning on temporal class diagrams: Undecidability results
This paper introduces a temporal class diagram language useful to model temporal varying data. The atemporal portion of the language contains the core constructors available in both EER diagrams and UML class diagrams. The temporal part of the language is able to distinguish between temporal and ate...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Artale, Alessandro [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2006 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, Inc. 2006 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Annals of mathematics and artificial intelligence - Springer Netherlands, 1990, 46(2006), 3 vom: März, Seite 265-288 |
|---|---|
| Übergeordnetes Werk: |
volume:46 ; year:2006 ; number:3 ; month:03 ; pages:265-288 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10472-006-9019-0 |
|---|
| Katalog-ID: |
OLC2041502746 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2041502746 | ||
| 003 | DE-627 | ||
| 005 | 20230502200230.0 | ||
| 007 | tu | ||
| 008 | 200820s2006 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10472-006-9019-0 |2 doi | |
| 035 | |a (DE-627)OLC2041502746 | ||
| 035 | |a (DE-He213)s10472-006-9019-0-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 510 |a 004 |q VZ |
| 084 | |a 17,1 |2 ssgn | ||
| 100 | 1 | |a Artale, Alessandro |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Reasoning on temporal class diagrams: Undecidability results |
| 264 | 1 | |c 2006 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, Inc. 2006 | ||
| 520 | |a This paper introduces a temporal class diagram language useful to model temporal varying data. The atemporal portion of the language contains the core constructors available in both EER diagrams and UML class diagrams. The temporal part of the language is able to distinguish between temporal and atemporal constructs, and it has the ability to represent dynamic constraints between classes. The language is characterized by a model-theoretic (temporal) semantics. Reasoning services as logical implication and satisfiability are also defined. We show that reasoning on finite models is different from reasoning on unrestricted ones. Then, we prove that reasoning on temporal class diagrams is an undecidable problem on both unrestricted models and on finite ones. | ||
| 650 | 4 | |a description logics | |
| 650 | 4 | |a temporal data models | |
| 650 | 4 | |a temporal logics | |
| 773 | 0 | 8 | |i Enthalten in |t Annals of mathematics and artificial intelligence |d Springer Netherlands, 1990 |g 46(2006), 3 vom: März, Seite 265-288 |w (DE-627)130904104 |w (DE-600)1045926-1 |w (DE-576)02499622X |x 1012-2443 |7 nnns |
| 773 | 1 | 8 | |g volume:46 |g year:2006 |g number:3 |g month:03 |g pages:265-288 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10472-006-9019-0 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2190 | ||
| 951 | |a AR | ||
| 952 | |d 46 |j 2006 |e 3 |c 03 |h 265-288 | ||
| author_variant |
a a aa |
|---|---|
| matchkey_str |
article:10122443:2006----::esnnotmoacasigasnei |
| hierarchy_sort_str |
2006 |
| publishDate |
2006 |
| allfields |
10.1007/s10472-006-9019-0 doi (DE-627)OLC2041502746 (DE-He213)s10472-006-9019-0-p DE-627 ger DE-627 rakwb eng 510 004 VZ 17,1 ssgn Artale, Alessandro verfasserin aut Reasoning on temporal class diagrams: Undecidability results 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, Inc. 2006 This paper introduces a temporal class diagram language useful to model temporal varying data. The atemporal portion of the language contains the core constructors available in both EER diagrams and UML class diagrams. The temporal part of the language is able to distinguish between temporal and atemporal constructs, and it has the ability to represent dynamic constraints between classes. The language is characterized by a model-theoretic (temporal) semantics. Reasoning services as logical implication and satisfiability are also defined. We show that reasoning on finite models is different from reasoning on unrestricted ones. Then, we prove that reasoning on temporal class diagrams is an undecidable problem on both unrestricted models and on finite ones. description logics temporal data models temporal logics Enthalten in Annals of mathematics and artificial intelligence Springer Netherlands, 1990 46(2006), 3 vom: März, Seite 265-288 (DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X 1012-2443 nnns volume:46 year:2006 number:3 month:03 pages:265-288 https://doi.org/10.1007/s10472-006-9019-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_2190 AR 46 2006 3 03 265-288 |
| spelling |
10.1007/s10472-006-9019-0 doi (DE-627)OLC2041502746 (DE-He213)s10472-006-9019-0-p DE-627 ger DE-627 rakwb eng 510 004 VZ 17,1 ssgn Artale, Alessandro verfasserin aut Reasoning on temporal class diagrams: Undecidability results 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, Inc. 2006 This paper introduces a temporal class diagram language useful to model temporal varying data. The atemporal portion of the language contains the core constructors available in both EER diagrams and UML class diagrams. The temporal part of the language is able to distinguish between temporal and atemporal constructs, and it has the ability to represent dynamic constraints between classes. The language is characterized by a model-theoretic (temporal) semantics. Reasoning services as logical implication and satisfiability are also defined. We show that reasoning on finite models is different from reasoning on unrestricted ones. Then, we prove that reasoning on temporal class diagrams is an undecidable problem on both unrestricted models and on finite ones. description logics temporal data models temporal logics Enthalten in Annals of mathematics and artificial intelligence Springer Netherlands, 1990 46(2006), 3 vom: März, Seite 265-288 (DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X 1012-2443 nnns volume:46 year:2006 number:3 month:03 pages:265-288 https://doi.org/10.1007/s10472-006-9019-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_2190 AR 46 2006 3 03 265-288 |
| allfields_unstemmed |
10.1007/s10472-006-9019-0 doi (DE-627)OLC2041502746 (DE-He213)s10472-006-9019-0-p DE-627 ger DE-627 rakwb eng 510 004 VZ 17,1 ssgn Artale, Alessandro verfasserin aut Reasoning on temporal class diagrams: Undecidability results 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, Inc. 2006 This paper introduces a temporal class diagram language useful to model temporal varying data. The atemporal portion of the language contains the core constructors available in both EER diagrams and UML class diagrams. The temporal part of the language is able to distinguish between temporal and atemporal constructs, and it has the ability to represent dynamic constraints between classes. The language is characterized by a model-theoretic (temporal) semantics. Reasoning services as logical implication and satisfiability are also defined. We show that reasoning on finite models is different from reasoning on unrestricted ones. Then, we prove that reasoning on temporal class diagrams is an undecidable problem on both unrestricted models and on finite ones. description logics temporal data models temporal logics Enthalten in Annals of mathematics and artificial intelligence Springer Netherlands, 1990 46(2006), 3 vom: März, Seite 265-288 (DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X 1012-2443 nnns volume:46 year:2006 number:3 month:03 pages:265-288 https://doi.org/10.1007/s10472-006-9019-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_2190 AR 46 2006 3 03 265-288 |
| allfieldsGer |
10.1007/s10472-006-9019-0 doi (DE-627)OLC2041502746 (DE-He213)s10472-006-9019-0-p DE-627 ger DE-627 rakwb eng 510 004 VZ 17,1 ssgn Artale, Alessandro verfasserin aut Reasoning on temporal class diagrams: Undecidability results 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, Inc. 2006 This paper introduces a temporal class diagram language useful to model temporal varying data. The atemporal portion of the language contains the core constructors available in both EER diagrams and UML class diagrams. The temporal part of the language is able to distinguish between temporal and atemporal constructs, and it has the ability to represent dynamic constraints between classes. The language is characterized by a model-theoretic (temporal) semantics. Reasoning services as logical implication and satisfiability are also defined. We show that reasoning on finite models is different from reasoning on unrestricted ones. Then, we prove that reasoning on temporal class diagrams is an undecidable problem on both unrestricted models and on finite ones. description logics temporal data models temporal logics Enthalten in Annals of mathematics and artificial intelligence Springer Netherlands, 1990 46(2006), 3 vom: März, Seite 265-288 (DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X 1012-2443 nnns volume:46 year:2006 number:3 month:03 pages:265-288 https://doi.org/10.1007/s10472-006-9019-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_2190 AR 46 2006 3 03 265-288 |
| allfieldsSound |
10.1007/s10472-006-9019-0 doi (DE-627)OLC2041502746 (DE-He213)s10472-006-9019-0-p DE-627 ger DE-627 rakwb eng 510 004 VZ 17,1 ssgn Artale, Alessandro verfasserin aut Reasoning on temporal class diagrams: Undecidability results 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, Inc. 2006 This paper introduces a temporal class diagram language useful to model temporal varying data. The atemporal portion of the language contains the core constructors available in both EER diagrams and UML class diagrams. The temporal part of the language is able to distinguish between temporal and atemporal constructs, and it has the ability to represent dynamic constraints between classes. The language is characterized by a model-theoretic (temporal) semantics. Reasoning services as logical implication and satisfiability are also defined. We show that reasoning on finite models is different from reasoning on unrestricted ones. Then, we prove that reasoning on temporal class diagrams is an undecidable problem on both unrestricted models and on finite ones. description logics temporal data models temporal logics Enthalten in Annals of mathematics and artificial intelligence Springer Netherlands, 1990 46(2006), 3 vom: März, Seite 265-288 (DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X 1012-2443 nnns volume:46 year:2006 number:3 month:03 pages:265-288 https://doi.org/10.1007/s10472-006-9019-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_2190 AR 46 2006 3 03 265-288 |
| language |
English |
| source |
Enthalten in Annals of mathematics and artificial intelligence 46(2006), 3 vom: März, Seite 265-288 volume:46 year:2006 number:3 month:03 pages:265-288 |
| sourceStr |
Enthalten in Annals of mathematics and artificial intelligence 46(2006), 3 vom: März, Seite 265-288 volume:46 year:2006 number:3 month:03 pages:265-288 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
description logics temporal data models temporal logics |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Annals of mathematics and artificial intelligence |
| authorswithroles_txt_mv |
Artale, Alessandro @@aut@@ |
| publishDateDaySort_date |
2006-03-01T00:00:00Z |
| hierarchy_top_id |
130904104 |
| dewey-sort |
3510 |
| id |
OLC2041502746 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2041502746</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502200230.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2006 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10472-006-9019-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2041502746</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10472-006-9019-0-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">17,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Artale, Alessandro</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Reasoning on temporal class diagrams: Undecidability results</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, Inc. 2006</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper introduces a temporal class diagram language useful to model temporal varying data. The atemporal portion of the language contains the core constructors available in both EER diagrams and UML class diagrams. The temporal part of the language is able to distinguish between temporal and atemporal constructs, and it has the ability to represent dynamic constraints between classes. The language is characterized by a model-theoretic (temporal) semantics. Reasoning services as logical implication and satisfiability are also defined. We show that reasoning on finite models is different from reasoning on unrestricted ones. Then, we prove that reasoning on temporal class diagrams is an undecidable problem on both unrestricted models and on finite ones.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">description logics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">temporal data models</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">temporal logics</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of mathematics and artificial intelligence</subfield><subfield code="d">Springer Netherlands, 1990</subfield><subfield code="g">46(2006), 3 vom: März, Seite 265-288</subfield><subfield code="w">(DE-627)130904104</subfield><subfield code="w">(DE-600)1045926-1</subfield><subfield code="w">(DE-576)02499622X</subfield><subfield code="x">1012-2443</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:46</subfield><subfield code="g">year:2006</subfield><subfield code="g">number:3</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:265-288</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10472-006-9019-0</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">46</subfield><subfield code="j">2006</subfield><subfield code="e">3</subfield><subfield code="c">03</subfield><subfield code="h">265-288</subfield></datafield></record></collection>
|
| author |
Artale, Alessandro |
| spellingShingle |
Artale, Alessandro ddc 510 ssgn 17,1 misc description logics misc temporal data models misc temporal logics Reasoning on temporal class diagrams: Undecidability results |
| authorStr |
Artale, Alessandro |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)130904104 |
| format |
Article |
| dewey-ones |
510 - Mathematics 004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1012-2443 |
| topic_title |
510 004 VZ 17,1 ssgn Reasoning on temporal class diagrams: Undecidability results description logics temporal data models temporal logics |
| topic |
ddc 510 ssgn 17,1 misc description logics misc temporal data models misc temporal logics |
| topic_unstemmed |
ddc 510 ssgn 17,1 misc description logics misc temporal data models misc temporal logics |
| topic_browse |
ddc 510 ssgn 17,1 misc description logics misc temporal data models misc temporal logics |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Annals of mathematics and artificial intelligence |
| hierarchy_parent_id |
130904104 |
| dewey-tens |
510 - Mathematics 000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Annals of mathematics and artificial intelligence |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X |
| title |
Reasoning on temporal class diagrams: Undecidability results |
| ctrlnum |
(DE-627)OLC2041502746 (DE-He213)s10472-006-9019-0-p |
| title_full |
Reasoning on temporal class diagrams: Undecidability results |
| author_sort |
Artale, Alessandro |
| journal |
Annals of mathematics and artificial intelligence |
| journalStr |
Annals of mathematics and artificial intelligence |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science 000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2006 |
| contenttype_str_mv |
txt |
| container_start_page |
265 |
| author_browse |
Artale, Alessandro |
| container_volume |
46 |
| class |
510 004 VZ 17,1 ssgn |
| format_se |
Aufsätze |
| author-letter |
Artale, Alessandro |
| doi_str_mv |
10.1007/s10472-006-9019-0 |
| dewey-full |
510 004 |
| title_sort |
reasoning on temporal class diagrams: undecidability results |
| title_auth |
Reasoning on temporal class diagrams: Undecidability results |
| abstract |
This paper introduces a temporal class diagram language useful to model temporal varying data. The atemporal portion of the language contains the core constructors available in both EER diagrams and UML class diagrams. The temporal part of the language is able to distinguish between temporal and atemporal constructs, and it has the ability to represent dynamic constraints between classes. The language is characterized by a model-theoretic (temporal) semantics. Reasoning services as logical implication and satisfiability are also defined. We show that reasoning on finite models is different from reasoning on unrestricted ones. Then, we prove that reasoning on temporal class diagrams is an undecidable problem on both unrestricted models and on finite ones. © Springer Science+Business Media, Inc. 2006 |
| abstractGer |
This paper introduces a temporal class diagram language useful to model temporal varying data. The atemporal portion of the language contains the core constructors available in both EER diagrams and UML class diagrams. The temporal part of the language is able to distinguish between temporal and atemporal constructs, and it has the ability to represent dynamic constraints between classes. The language is characterized by a model-theoretic (temporal) semantics. Reasoning services as logical implication and satisfiability are also defined. We show that reasoning on finite models is different from reasoning on unrestricted ones. Then, we prove that reasoning on temporal class diagrams is an undecidable problem on both unrestricted models and on finite ones. © Springer Science+Business Media, Inc. 2006 |
| abstract_unstemmed |
This paper introduces a temporal class diagram language useful to model temporal varying data. The atemporal portion of the language contains the core constructors available in both EER diagrams and UML class diagrams. The temporal part of the language is able to distinguish between temporal and atemporal constructs, and it has the ability to represent dynamic constraints between classes. The language is characterized by a model-theoretic (temporal) semantics. Reasoning services as logical implication and satisfiability are also defined. We show that reasoning on finite models is different from reasoning on unrestricted ones. Then, we prove that reasoning on temporal class diagrams is an undecidable problem on both unrestricted models and on finite ones. © Springer Science+Business Media, Inc. 2006 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_2190 |
| container_issue |
3 |
| title_short |
Reasoning on temporal class diagrams: Undecidability results |
| url |
https://doi.org/10.1007/s10472-006-9019-0 |
| remote_bool |
false |
| ppnlink |
130904104 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10472-006-9019-0 |
| up_date |
2024-07-04T04:53:48.244Z |
| _version_ |
1803622891645829121 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2041502746</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502200230.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2006 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10472-006-9019-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2041502746</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10472-006-9019-0-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">17,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Artale, Alessandro</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Reasoning on temporal class diagrams: Undecidability results</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, Inc. 2006</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper introduces a temporal class diagram language useful to model temporal varying data. The atemporal portion of the language contains the core constructors available in both EER diagrams and UML class diagrams. The temporal part of the language is able to distinguish between temporal and atemporal constructs, and it has the ability to represent dynamic constraints between classes. The language is characterized by a model-theoretic (temporal) semantics. Reasoning services as logical implication and satisfiability are also defined. We show that reasoning on finite models is different from reasoning on unrestricted ones. Then, we prove that reasoning on temporal class diagrams is an undecidable problem on both unrestricted models and on finite ones.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">description logics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">temporal data models</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">temporal logics</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of mathematics and artificial intelligence</subfield><subfield code="d">Springer Netherlands, 1990</subfield><subfield code="g">46(2006), 3 vom: März, Seite 265-288</subfield><subfield code="w">(DE-627)130904104</subfield><subfield code="w">(DE-600)1045926-1</subfield><subfield code="w">(DE-576)02499622X</subfield><subfield code="x">1012-2443</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:46</subfield><subfield code="g">year:2006</subfield><subfield code="g">number:3</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:265-288</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10472-006-9019-0</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">46</subfield><subfield code="j">2006</subfield><subfield code="e">3</subfield><subfield code="c">03</subfield><subfield code="h">265-288</subfield></datafield></record></collection>
|
| score |
7.4004602 |