---
_id: '50479'
abstract:
- lang: eng
text: Verifying assertions is an essential part of creating and maintaining knowledge
graphs. Most often, this task cannot be carried out manually due to the sheer
size of modern knowledge graphs. Hence, automatic fact-checking approaches have
been proposed over the last decade. These approaches aim to compute automatically
whether a given assertion is correct or incorrect. However, most fact-checking
approaches are binary classifiers that fail to consider the volatility of some
assertions, i.e., the fact that such assertions are only valid at certain times
or for specific time intervals. Moreover, the few approaches able to predict when
an assertion was valid (i.e., time-point prediction approaches) rely on manual
feature engineering. This paper presents TEMPORALFC, a temporal fact-checking
approach that uses multiple sources of background knowledge to assess the veracity
and temporal validity of a given assertion. We evaluate TEMPORALFC on two datasets
and compare it to the state of the art in fact-checking and time-point prediction.
Our results suggest that TEMPORALFC outperforms the state of the art on the fact-checking
task by 0.13 to 0.15 in terms of Area Under the Receiver Operating Characteristic
curve and on the time-point prediction task by 0.25 to 0.27 in terms of Mean Reciprocal
Rank. Our code is open-source and can be found at https://github.com/dice-group/TemporalFC.
author:
- first_name: Umair
full_name: Qudus, Umair
last_name: Qudus
- first_name: Michael
full_name: Röder, Michael
last_name: Röder
- first_name: Sabrina
full_name: Kirrane, Sabrina
last_name: Kirrane
- first_name: Axel-Cyrille Ngonga
full_name: Ngomo, Axel-Cyrille Ngonga
last_name: Ngomo
citation:
ama: 'Qudus U, Röder M, Kirrane S, Ngomo A-CN. TemporalFC: A Temporal Fact Checking
Approach over Knowledge Graphs. In: R. Payne T, Presutti V, Qi G, et al., eds.
The Semantic Web – ISWC 2023. Vol 14265. Lecture Notes in Computer Science.
Springer, Cham; 2023:465–483. doi:10.1007/978-3-031-47240-4_25'
apa: 'Qudus, U., Röder, M., Kirrane, S., & Ngomo, A.-C. N. (2023). TemporalFC:
A Temporal Fact Checking Approach over Knowledge Graphs. In T. R. Payne, V. Presutti,
G. Qi, M. Poveda-Villalón, G. Stoilos, L. Hollink, Z. Kaoudi, G. Cheng, &
J. Li (Eds.), The Semantic Web – ISWC 2023 (Vol. 14265, pp. 465–483). Springer,
Cham. https://doi.org/10.1007/978-3-031-47240-4_25'
bibtex: '@inproceedings{Qudus_Röder_Kirrane_Ngomo_2023, place={Cham}, series={ Lecture
Notes in Computer Science}, title={TemporalFC: A Temporal Fact Checking Approach
over Knowledge Graphs}, volume={14265}, DOI={10.1007/978-3-031-47240-4_25},
booktitle={The Semantic Web – ISWC 2023}, publisher={Springer, Cham}, author={Qudus,
Umair and Röder, Michael and Kirrane, Sabrina and Ngomo, Axel-Cyrille Ngonga},
editor={R. Payne, Terry and Presutti, Valentina and Qi, Guilin and Poveda-Villalón,
María and Stoilos, Giorgos and Hollink, Laura and Kaoudi, Zoi and Cheng, Gong
and Li, Juanzi}, year={2023}, pages={465–483}, collection={ Lecture Notes in Computer
Science} }'
chicago: 'Qudus, Umair, Michael Röder, Sabrina Kirrane, and Axel-Cyrille Ngonga
Ngomo. “TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs.”
In The Semantic Web – ISWC 2023, edited by Terry R. Payne, Valentina Presutti,
Guilin Qi, María Poveda-Villalón, Giorgos Stoilos, Laura Hollink, Zoi Kaoudi,
Gong Cheng, and Juanzi Li, 14265:465–483. Lecture Notes in Computer Science.
Cham: Springer, Cham, 2023. https://doi.org/10.1007/978-3-031-47240-4_25.'
ieee: 'U. Qudus, M. Röder, S. Kirrane, and A.-C. N. Ngomo, “TemporalFC: A Temporal
Fact Checking Approach over Knowledge Graphs,” in The Semantic Web – ISWC 2023,
Athens, Greece, 2023, vol. 14265, pp. 465–483, doi: 10.1007/978-3-031-47240-4_25.'
mla: 'Qudus, Umair, et al. “TemporalFC: A Temporal Fact Checking Approach over Knowledge
Graphs.” The Semantic Web – ISWC 2023, edited by Terry R. Payne et al.,
vol. 14265, Springer, Cham, 2023, pp. 465–483, doi:10.1007/978-3-031-47240-4_25.'
short: 'U. Qudus, M. Röder, S. Kirrane, A.-C.N. Ngomo, in: T. R. Payne, V. Presutti,
G. Qi, M. Poveda-Villalón, G. Stoilos, L. Hollink, Z. Kaoudi, G. Cheng, J. Li
(Eds.), The Semantic Web – ISWC 2023, Springer, Cham, Cham, 2023, pp. 465–483.'
conference:
end_date: 2023-11-10
location: Athens, Greece
name: The Semantic Web – ISWC 2023
start_date: 2023-11-06
date_created: 2024-01-13T11:22:15Z
date_updated: 2024-01-13T11:48:28Z
ddc:
- '006'
department:
- _id: '34'
doi: 10.1007/978-3-031-47240-4_25
editor:
- first_name: Terry
full_name: R. Payne, Terry
last_name: R. Payne
- first_name: Valentina
full_name: Presutti, Valentina
last_name: Presutti
- first_name: Guilin
full_name: Qi, Guilin
last_name: Qi
- first_name: María
full_name: Poveda-Villalón, María
last_name: Poveda-Villalón
- first_name: Giorgos
full_name: Stoilos, Giorgos
last_name: Stoilos
- first_name: Laura
full_name: Hollink, Laura
last_name: Hollink
- first_name: Zoi
full_name: Kaoudi, Zoi
last_name: Kaoudi
- first_name: Gong
full_name: Cheng, Gong
last_name: Cheng
- first_name: Juanzi
full_name: Li, Juanzi
last_name: Li
file:
- access_level: closed
content_type: application/pdf
creator: uqudus
date_created: 2024-01-13T11:25:48Z
date_updated: 2024-01-13T11:25:48Z
file_id: '50480'
file_name: ISWC 2023 TemporalFC-A Temporal Fact Checking approach over Knowledge
Graphs.pdf
file_size: 1944818
relation: main_file
success: 1
file_date_updated: 2024-01-13T11:25:48Z
has_accepted_license: '1'
intvolume: ' 14265'
jel:
- C
keyword:
- temporal fact checking · ensemble learning · transfer learning · time-point prediction
· temporal knowledge graphs
language:
- iso: eng
license: https://creativecommons.org/publicdomain/zero/1.0/
page: 465–483
place: Cham
project:
- _id: '410'
grant_number: '860801'
name: 'KnowGraphs: KnowGraphs: Knowledge Graphs at Scale'
publication: The Semantic Web – ISWC 2023
publication_identifier:
isbn:
- '9783031472398'
- '9783031472404'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer, Cham
series_title: ' Lecture Notes in Computer Science'
status: public
title: 'TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs'
type: conference
user_id: '83392'
volume: 14265
year: '2023'
...
---
_id: '23456'
article_type: original
author:
- first_name: Davide
full_name: Mattiolo, Davide
last_name: Mattiolo
- first_name: Eckhard
full_name: Steffen, Eckhard
id: '15548'
last_name: Steffen
orcid: 0000-0002-9808-7401
citation:
ama: Mattiolo D, Steffen E. Highly edge‐connected regular graphs without large factorizable
subgraphs. Journal of Graph Theory. 2021;99(1):107-116. doi:10.1002/jgt.22729
apa: Mattiolo, D., & Steffen, E. (2021). Highly edge‐connected regular graphs
without large factorizable subgraphs. Journal of Graph Theory, 99(1),
107–116. https://doi.org/10.1002/jgt.22729
bibtex: '@article{Mattiolo_Steffen_2021, title={Highly edge‐connected regular graphs
without large factorizable subgraphs}, volume={99}, DOI={10.1002/jgt.22729},
number={1}, journal={Journal of Graph Theory}, author={Mattiolo, Davide and Steffen,
Eckhard}, year={2021}, pages={107–116} }'
chicago: 'Mattiolo, Davide, and Eckhard Steffen. “Highly Edge‐connected Regular
Graphs without Large Factorizable Subgraphs.” Journal of Graph Theory 99,
no. 1 (2021): 107–16. https://doi.org/10.1002/jgt.22729.'
ieee: 'D. Mattiolo and E. Steffen, “Highly edge‐connected regular graphs without
large factorizable subgraphs,” Journal of Graph Theory, vol. 99, no. 1,
pp. 107–116, 2021, doi: 10.1002/jgt.22729.'
mla: Mattiolo, Davide, and Eckhard Steffen. “Highly Edge‐connected Regular Graphs
without Large Factorizable Subgraphs.” Journal of Graph Theory, vol. 99,
no. 1, 2021, pp. 107–16, doi:10.1002/jgt.22729.
short: D. Mattiolo, E. Steffen, Journal of Graph Theory 99 (2021) 107–116.
date_created: 2021-08-19T12:45:45Z
date_updated: 2023-05-16T10:39:20Z
doi: 10.1002/jgt.22729
external_id:
arxiv:
- '1912.09704'
intvolume: ' 99'
issue: '1'
keyword:
- factorization
- perfect matchings
- regular graphs
- r-graphs
language:
- iso: eng
page: 107-116
publication: Journal of Graph Theory
publication_identifier:
issn:
- 0364-9024
- 1097-0118
publication_status: published
status: public
title: Highly edge‐connected regular graphs without large factorizable subgraphs
type: journal_article
user_id: '15540'
volume: 99
year: '2021'
...
---
_id: '10586'
abstract:
- lang: eng
text: We consider the problem of transforming a given graph G_s into a desired graph
G_t by applying a minimum number of primitives from a particular set of local
graph transformation primitives. These primitives are local in the sense that
each node can apply them based on local knowledge and by affecting only its 1-neighborhood.
Although the specific set of primitives we consider makes it possible to transform
any (weakly) connected graph into any other (weakly) connected graph consisting
of the same nodes, they cannot disconnect the graph or introduce new nodes into
the graph, making them ideal in the context of supervised overlay network transformations.
We prove that computing a minimum sequence of primitive applications (even centralized)
for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set
of local graph transformation primitives satisfying the aforementioned properties.
On the other hand, we show that this problem admits a polynomial time algorithm
with a constant approximation ratio.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Scheideler C, Setzer A. On the Complexity of Local Graph Transformations.
In: Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14.
doi:10.4230/LIPICS.ICALP.2019.150'
apa: 'Scheideler, C., & Setzer, A. (2019). On the Complexity of Local Graph
Transformations. In Proceedings of the 46th International Colloquium on Automata,
Languages, and Programming (Vol. 132, pp. 150:1--150:14). Patras, Greece:
Dagstuhl Publishing. https://doi.org/10.4230/LIPICS.ICALP.2019.150'
bibtex: '@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity
of Local Graph Transformations}, volume={132}, DOI={10.4230/LIPICS.ICALP.2019.150},
booktitle={Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian
and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs}
}'
chicago: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local
Graph Transformations.” In Proceedings of the 46th International Colloquium
on Automata, Languages, and Programming, 132:150:1--150:14. LIPIcs. Dagstuhl
Publishing, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.150.
ieee: C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,”
in Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.
mla: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph
Transformations.” Proceedings of the 46th International Colloquium on Automata,
Languages, and Programming, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14,
doi:10.4230/LIPICS.ICALP.2019.150.
short: 'C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium
on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.'
conference:
end_date: 2019-07-12
location: Patras, Greece
name: ICALP 2019
start_date: 2019-07-09
date_created: 2019-07-08T17:19:01Z
date_updated: 2022-01-06T06:50:45Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.4230/LIPICS.ICALP.2019.150
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T09:21:27Z
date_updated: 2019-08-26T09:21:27Z
file_id: '12955'
file_name: LIPIcs-ICALP-2019-150.pdf
file_size: 537649
relation: main_file
success: 1
file_date_updated: 2019-08-26T09:21:27Z
has_accepted_license: '1'
intvolume: ' 132'
keyword:
- Graphs transformations
- NP-hardness
- approximation algorithms
language:
- iso: eng
page: 150:1--150:14
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming
publication_status: published
publisher: Dagstuhl Publishing
series_title: LIPIcs
status: public
title: On the Complexity of Local Graph Transformations
type: conference
user_id: '477'
volume: 132
year: '2019'
...
---
_id: '15921'
abstract:
- lang: eng
text: "Ranking plays a central role in a large number of applications driven by
RDF knowledge graphs. Over the last years, many popular RDF knowledge graphs have
grown so large that rankings for the facts they contain cannot be computed directly
using the currently common 64-bit platforms. In this paper, we tackle two problems:\r\nComputing
ranks on such large knowledge bases efficiently and incrementally. First, we present
D-HARE, a distributed approach for computing ranks on very large knowledge graphs.
D-HARE assumes the random surfer model and relies on data partitioning to compute
matrix multiplications and transpositions on disk for matrices of arbitrary size.
Moreover, the data partitioning underlying D-HARE allows the execution of most
of its steps in parallel.\r\nAs very large knowledge graphs are often updated
periodically, we tackle the incremental computation of ranks on large knowledge
bases as a second problem. We address this problem by presenting\r\nI-HARE, an
approximation technique for calculating the overall ranking scores of a knowledge
without the need to recalculate the ranking from scratch at each new revision.
We evaluate our approaches by calculating ranks on the 3 × 10^9 and 2.4 × 10^9
triples from Wikidata resp. LinkedGeoData. Our evaluation demonstrates\r\nthat
D-HARE is the first holistic approach for computing ranks on very large RDF knowledge
graphs. In addition, our incremental approach achieves a root mean squared error
of less than 10E−7 in the best case. Both D-HARE\r\n and I-HARE are open-source
and are available at: https://github.com/dice-group/incrementalHARE.\r\n"
author:
- first_name: Abdelmoneim Amer
full_name: Desouki, Abdelmoneim Amer
last_name: Desouki
- first_name: Michael
full_name: Röder, Michael
last_name: Röder
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
last_name: Ngonga Ngomo
citation:
ama: 'Desouki AA, Röder M, Ngonga Ngomo A-C. Ranking on Very Large Knowledge Graphs.
In: Proceedings of the 30th ACM Conference on Hypertext and Social Media -
HT ’19. ACM; 2019:163-171. doi:10.1145/3342220.3343660'
apa: Desouki, A. A., Röder, M., & Ngonga Ngomo, A.-C. (2019). Ranking on Very
Large Knowledge Graphs. In Proceedings of the 30th ACM Conference on Hypertext
and Social Media - HT ’19 (pp. 163–171). ACM. https://doi.org/10.1145/3342220.3343660
bibtex: '@inproceedings{Desouki_Röder_Ngonga Ngomo_2019, title={Ranking on Very
Large Knowledge Graphs}, DOI={10.1145/3342220.3343660},
booktitle={Proceedings of the 30th ACM Conference on Hypertext and Social Media
- HT ’19}, publisher={ACM}, author={Desouki, Abdelmoneim Amer and Röder, Michael
and Ngonga Ngomo, Axel-Cyrille}, year={2019}, pages={163–171} }'
chicago: Desouki, Abdelmoneim Amer, Michael Röder, and Axel-Cyrille Ngonga Ngomo.
“Ranking on Very Large Knowledge Graphs.” In Proceedings of the 30th ACM Conference
on Hypertext and Social Media - HT ’19, 163–71. ACM, 2019. https://doi.org/10.1145/3342220.3343660.
ieee: A. A. Desouki, M. Röder, and A.-C. Ngonga Ngomo, “Ranking on Very Large Knowledge
Graphs,” in Proceedings of the 30th ACM Conference on Hypertext and Social
Media - HT ’19, 2019, pp. 163–171.
mla: Desouki, Abdelmoneim Amer, et al. “Ranking on Very Large Knowledge Graphs.”
Proceedings of the 30th ACM Conference on Hypertext and Social Media - HT
’19, ACM, 2019, pp. 163–71, doi:10.1145/3342220.3343660.
short: 'A.A. Desouki, M. Röder, A.-C. Ngonga Ngomo, in: Proceedings of the 30th
ACM Conference on Hypertext and Social Media - HT ’19, ACM, 2019, pp. 163–171.'
conference:
end_date: 2019-09-20
name: 30th ACM Conference on Hypertext and Social Media
start_date: 2019-09-17
date_created: 2020-02-18T16:39:35Z
date_updated: 2022-01-06T06:52:41Z
department:
- _id: '574'
doi: 10.1145/3342220.3343660
keyword:
- Knowledge Graphs
- Ranking
- RDF
language:
- iso: eng
page: 163-171
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proceedings of the 30th ACM Conference on Hypertext and Social Media -
HT '19
publication_identifier:
isbn:
- '9781450368858'
publication_status: published
publisher: ACM
status: public
title: Ranking on Very Large Knowledge Graphs
type: conference
user_id: '69382'
year: '2019'
...
---
_id: '48877'
abstract:
- lang: eng
text: OpenML is an online machine learning platform where researchers can easily
share data, machine learning tasks and experiments as well as organize them online
to work and collaborate more efficiently. In this paper, we present an R package
to interface with the OpenML platform and illustrate its usage in combination
with the machine learning R package mlr (Bischl et al. J Mach Learn Res 17(170):1—5,
2016). We show how the OpenML package allows R users to easily search, download
and upload data sets and machine learning tasks. Furthermore, we also show how
to upload results of experiments, share them with others and download results
from other users. Beyond ensuring reproducibility of results, the OpenML platform
automates much of the drudge work, speeds up research, facilitates collaboration
and increases the users’ visibility online.
author:
- first_name: Giuseppe
full_name: Casalicchio, Giuseppe
last_name: Casalicchio
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Michel
full_name: Lang, Michel
last_name: Lang
- first_name: Dominik
full_name: Kirchhoff, Dominik
last_name: Kirchhoff
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Benjamin
full_name: Hofner, Benjamin
last_name: Hofner
- first_name: Heidi
full_name: Seibold, Heidi
last_name: Seibold
- first_name: Joaquin
full_name: Vanschoren, Joaquin
last_name: Vanschoren
- first_name: Bernd
full_name: Bischl, Bernd
last_name: Bischl
citation:
ama: 'Casalicchio G, Bossek J, Lang M, et al. OpenML: An R Package to Connect to
the Machine Learning Platform OpenML. Computational Statistics. 2019;34(3):977–991.
doi:10.1007/s00180-017-0742-2'
apa: 'Casalicchio, G., Bossek, J., Lang, M., Kirchhoff, D., Kerschke, P., Hofner,
B., Seibold, H., Vanschoren, J., & Bischl, B. (2019). OpenML: An R Package
to Connect to the Machine Learning Platform OpenML. Computational Statistics,
34(3), 977–991. https://doi.org/10.1007/s00180-017-0742-2'
bibtex: '@article{Casalicchio_Bossek_Lang_Kirchhoff_Kerschke_Hofner_Seibold_Vanschoren_Bischl_2019,
title={OpenML: An R Package to Connect to the Machine Learning Platform OpenML},
volume={34}, DOI={10.1007/s00180-017-0742-2},
number={3}, journal={Computational Statistics}, author={Casalicchio, Giuseppe
and Bossek, Jakob and Lang, Michel and Kirchhoff, Dominik and Kerschke, Pascal
and Hofner, Benjamin and Seibold, Heidi and Vanschoren, Joaquin and Bischl, Bernd},
year={2019}, pages={977–991} }'
chicago: 'Casalicchio, Giuseppe, Jakob Bossek, Michel Lang, Dominik Kirchhoff, Pascal
Kerschke, Benjamin Hofner, Heidi Seibold, Joaquin Vanschoren, and Bernd Bischl.
“OpenML: An R Package to Connect to the Machine Learning Platform OpenML.” Computational
Statistics 34, no. 3 (2019): 977–991. https://doi.org/10.1007/s00180-017-0742-2.'
ieee: 'G. Casalicchio et al., “OpenML: An R Package to Connect to the Machine
Learning Platform OpenML,” Computational Statistics, vol. 34, no. 3, pp.
977–991, 2019, doi: 10.1007/s00180-017-0742-2.'
mla: 'Casalicchio, Giuseppe, et al. “OpenML: An R Package to Connect to the Machine
Learning Platform OpenML.” Computational Statistics, vol. 34, no. 3, 2019,
pp. 977–991, doi:10.1007/s00180-017-0742-2.'
short: G. Casalicchio, J. Bossek, M. Lang, D. Kirchhoff, P. Kerschke, B. Hofner,
H. Seibold, J. Vanschoren, B. Bischl, Computational Statistics 34 (2019) 977–991.
date_created: 2023-11-14T15:58:57Z
date_updated: 2023-12-13T10:51:17Z
department:
- _id: '819'
doi: 10.1007/s00180-017-0742-2
intvolume: ' 34'
issue: '3'
keyword:
- Databases
- Machine learning
- R
- Reproducible research
language:
- iso: eng
page: 977–991
publication: Computational Statistics
publication_identifier:
issn:
- 0943-4062
status: public
title: 'OpenML: An R Package to Connect to the Machine Learning Platform OpenML'
type: journal_article
user_id: '102979'
volume: 34
year: '2019'
...
---
_id: '39538'
abstract:
- lang: eng
text: This article discusses the application of Pictorial Janus (PJ) for the rapid
development and analysis of protocols by animation and complete visualization.
In order to make PJ applicable in the context of hardware description we first
extend PJ by timing facilities (Timed PJ) and introduce an approach for integrating
VHDL models into this visual framework preserving the simulation semantics of
VHDL. We finally give the example of the specification and animation of a non
interlocked protocol.
author:
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Georg
full_name: Lehrenfeld, Georg
last_name: Lehrenfeld
- first_name: C.
full_name: Tahedl, C.
last_name: Tahedl
citation:
ama: 'Müller W, Lehrenfeld G, Tahedl C. Complete Visual Specification and Animations
of Protocols. In: Proceedings of ASP-DAC’95/CHDL’95/VLSI’95 with EDA Technofair.
; 1995. doi:10.1109/ASPDAC.1995.486383'
apa: Müller, W., Lehrenfeld, G., & Tahedl, C. (1995). Complete Visual Specification
and Animations of Protocols. Proceedings of ASP-DAC’95/CHDL’95/VLSI’95 with
EDA Technofair. https://doi.org/10.1109/ASPDAC.1995.486383
bibtex: '@inproceedings{Müller_Lehrenfeld_Tahedl_1995, place={Chiba, Japan }, title={Complete
Visual Specification and Animations of Protocols}, DOI={10.1109/ASPDAC.1995.486383},
booktitle={Proceedings of ASP-DAC’95/CHDL’95/VLSI’95 with EDA Technofair}, author={Müller,
Wolfgang and Lehrenfeld, Georg and Tahedl, C.}, year={1995} }'
chicago: Müller, Wolfgang, Georg Lehrenfeld, and C. Tahedl. “Complete Visual Specification
and Animations of Protocols.” In Proceedings of ASP-DAC’95/CHDL’95/VLSI’95
with EDA Technofair. Chiba, Japan , 1995. https://doi.org/10.1109/ASPDAC.1995.486383.
ieee: 'W. Müller, G. Lehrenfeld, and C. Tahedl, “Complete Visual Specification and
Animations of Protocols,” 1995, doi: 10.1109/ASPDAC.1995.486383.'
mla: Müller, Wolfgang, et al. “Complete Visual Specification and Animations of Protocols.”
Proceedings of ASP-DAC’95/CHDL’95/VLSI’95 with EDA Technofair, 1995, doi:10.1109/ASPDAC.1995.486383.
short: 'W. Müller, G. Lehrenfeld, C. Tahedl, in: Proceedings of ASP-DAC’95/CHDL’95/VLSI’95
with EDA Technofair, Chiba, Japan , 1995.'
date_created: 2023-01-24T12:05:55Z
date_updated: 2023-01-24T12:05:59Z
department:
- _id: '672'
doi: 10.1109/ASPDAC.1995.486383
keyword:
- Animation
- Protocols
- Timing
- Computer languages
- Electronic mail
- Context modeling
- Visualization
- Control systems
- Flow graphs
- Trademarks
language:
- iso: eng
place: 'Chiba, Japan '
publication: Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair
publication_identifier:
isbn:
- 4-930813-67-0
status: public
title: Complete Visual Specification and Animations of Protocols
type: conference
user_id: '5786'
year: '1995'
...