https://iccl.inf.tu-dresden.de/w/api.php?action=feedcontributions&feedformat=atom&user=Irina+DragosteInternational Center for Computational Logic - Benutzerbeiträge [de]2026-04-18T06:58:27ZBenutzerbeiträgeMediaWiki 1.43.1https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3309&diff=35982Inproceedings33092022-04-06T10:01:30Z<p>Irina Dragoste: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Martin<br />
|ErsterAutorNachname=Bromberger<br />
|FurtherAuthors=Irina Dragoste; Rasha Faqeh; Christof Fetzer; Larry González; Markus Krötzsch; Maximilian Marx; Harish K Murali; Christoph Weidenbach<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic<br />
|To appear=0<br />
|Year=2022<br />
|Month=April<br />
|Booktitle=Proc. of the 13th 27th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2022)<br />
|Pages=480-501<br />
|Publisher=Springer<br />
|Editor=Dana Fisman, Grigore Rosu<br />
|Series=LNCS<br />
|Volume=13243<br />
}}<br />
{{Publikation Tool<br />
|Tool=SPASS-SPL (https://github.com/mbromber/eval-sorted-datalog-hammer)<br />
}}<br />
{{Publikation Details<br />
|Abstract=In a previous paper, we have shown that clause sets belonging to the Horn Bernays-Schönfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. We verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine. In this paper, we improve our Datalog hammer in several ways: we generalize it to mixed real-integer arithmetic and finite first-order sorts; we extend the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and we significantly reduce the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real world benchmark examples. Finally, we replace the before file-based interface between SPASS-SPL and VLog by a close coupling resulting in a single executable binary.<br />
|ISBN=978-3-030-99523-2<br />
|Download=Bromberger et al A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic.pdf<br />
|DOI Name=10.1007/978-3-030-99524-9<br />
|Projekt=CPEC, ScaDS.AI, Cfaed<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3309&diff=35981Inproceedings33092022-04-06T10:00:05Z<p>Irina Dragoste: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Martin<br />
|ErsterAutorNachname=Bromberger<br />
|FurtherAuthors=Irina Dragoste; Rasha Faqeh; Christof Fetzer; Larry González; Markus Krötzsch; Maximilian Marx; Harish K Murali; Christoph Weidenbach<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic<br />
|To appear=0<br />
|Year=2022<br />
|Month=April<br />
|Booktitle=Proc. of the 13th 27th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2022)<br />
|Pages=480-501<br />
|Publisher=Springer<br />
|Editor=Dana Fisman, Grigore Rosu<br />
|Series=LNCS<br />
|Volume=13243<br />
}}<br />
{{Publikation Tool<br />
|Tool=SPASS-SPL {https://github.com/mbromber/eval-sorted-datalog-hammer}<br />
}}<br />
{{Publikation Details<br />
|Abstract=In a previous paper, we have shown that clause sets belonging to the Horn Bernays-Schönfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. We verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine. In this paper, we improve our Datalog hammer in several ways: we generalize it to mixed real-integer arithmetic and finite first-order sorts; we extend the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and we significantly reduce the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real world benchmark examples. Finally, we replace the before file-based interface between SPASS-SPL and VLog by a close coupling resulting in a single executable binary.<br />
|ISBN=978-3-030-99523-2<br />
|Download=Bromberger et al A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic.pdf<br />
|DOI Name=10.1007/978-3-030-99524-9<br />
|Projekt=CPEC, ScaDS.AI, Cfaed<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3309&diff=35980Inproceedings33092022-04-06T09:59:42Z<p>Irina Dragoste: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Martin<br />
|ErsterAutorNachname=Bromberger<br />
|FurtherAuthors=Irina Dragoste; Rasha Faqeh; Christof Fetzer; Larry González; Markus Krötzsch; Maximilian Marx; Harish K Murali; Christoph Weidenbach<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic<br />
|To appear=0<br />
|Year=2022<br />
|Month=April<br />
|Booktitle=Proc. of the 13th 27th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2022)<br />
|Pages=480-501<br />
|Publisher=Springer<br />
|Editor=Dana Fisman, Grigore Rosu<br />
|Series=LNCS<br />
|Volume=13243<br />
}}<br />
{{Publikation Tool<br />
|Tool=SPASS-SPL [https://github.com/mbromber/eval-sorted-datalog-hammer]<br />
}}<br />
{{Publikation Details<br />
|Abstract=In a previous paper, we have shown that clause sets belonging to the Horn Bernays-Schönfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. We verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine. In this paper, we improve our Datalog hammer in several ways: we generalize it to mixed real-integer arithmetic and finite first-order sorts; we extend the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and we significantly reduce the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real world benchmark examples. Finally, we replace the before file-based interface between SPASS-SPL and VLog by a close coupling resulting in a single executable binary.<br />
|ISBN=978-3-030-99523-2<br />
|Download=Bromberger et al A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic.pdf<br />
|DOI Name=10.1007/978-3-030-99524-9<br />
|Projekt=CPEC, ScaDS.AI, Cfaed<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3309&diff=35979Inproceedings33092022-04-06T09:59:09Z<p>Irina Dragoste: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Martin<br />
|ErsterAutorNachname=Bromberger<br />
|FurtherAuthors=Irina Dragoste; Rasha Faqeh; Christof Fetzer; Larry González; Markus Krötzsch; Maximilian Marx; Harish K Murali; Christoph Weidenbach<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic<br />
|To appear=0<br />
|Year=2022<br />
|Month=April<br />
|Booktitle=Proc. of the 13th 27th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2022)<br />
|Pages=480-501<br />
|Publisher=Springer<br />
|Editor=Dana Fisman, Grigore Rosu<br />
|Series=LNCS<br />
|Volume=13243<br />
}}<br />
{{Publikation Tool<br />
|Tool=[[SPASS-SPL|https://github.com/mbromber/eval-sorted-datalog-hammer]]<br />
}}<br />
{{Publikation Details<br />
|Abstract=In a previous paper, we have shown that clause sets belonging to the Horn Bernays-Schönfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. We verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine. In this paper, we improve our Datalog hammer in several ways: we generalize it to mixed real-integer arithmetic and finite first-order sorts; we extend the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and we significantly reduce the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real world benchmark examples. Finally, we replace the before file-based interface between SPASS-SPL and VLog by a close coupling resulting in a single executable binary.<br />
|ISBN=978-3-030-99523-2<br />
|Download=Bromberger et al A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic.pdf<br />
|DOI Name=10.1007/978-3-030-99524-9<br />
|Projekt=CPEC, ScaDS.AI, Cfaed<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3309&diff=35978Inproceedings33092022-04-06T09:58:48Z<p>Irina Dragoste: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Martin<br />
|ErsterAutorNachname=Bromberger<br />
|FurtherAuthors=Irina Dragoste; Rasha Faqeh; Christof Fetzer; Larry González; Markus Krötzsch; Maximilian Marx; Harish K Murali; Christoph Weidenbach<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic<br />
|To appear=0<br />
|Year=2022<br />
|Month=April<br />
|Booktitle=Proc. of the 13th 27th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2022)<br />
|Pages=480-501<br />
|Publisher=Springer<br />
|Editor=Dana Fisman, Grigore Rosu<br />
|Series=LNCS<br />
|Volume=13243<br />
}}<br />
{{Publikation Tool<br />
|Tool=SPASS-SPL [[https://github.com/mbromber/eval-sorted-datalog-hammer]]<br />
}}<br />
{{Publikation Details<br />
|Abstract=In a previous paper, we have shown that clause sets belonging to the Horn Bernays-Schönfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. We verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine. In this paper, we improve our Datalog hammer in several ways: we generalize it to mixed real-integer arithmetic and finite first-order sorts; we extend the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and we significantly reduce the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real world benchmark examples. Finally, we replace the before file-based interface between SPASS-SPL and VLog by a close coupling resulting in a single executable binary.<br />
|ISBN=978-3-030-99523-2<br />
|Download=Bromberger et al A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic.pdf<br />
|DOI Name=10.1007/978-3-030-99524-9<br />
|Projekt=CPEC, ScaDS.AI, Cfaed<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3309&diff=35977Inproceedings33092022-04-06T09:57:41Z<p>Irina Dragoste: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Martin<br />
|ErsterAutorNachname=Bromberger<br />
|FurtherAuthors=Irina Dragoste; Rasha Faqeh; Christof Fetzer; Larry González; Markus Krötzsch; Maximilian Marx; Harish K Murali; Christoph Weidenbach<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic<br />
|To appear=0<br />
|Year=2022<br />
|Month=April<br />
|Booktitle=Proc. of the 13th 27th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2022)<br />
|Pages=480-501<br />
|Publisher=Springer<br />
|Editor=Dana Fisman, Grigore Rosu<br />
|Series=LNCS<br />
|Volume=13243<br />
}}<br />
{{Publikation Tool<br />
|Tool=SPASS-SPL [https://github.com/mbromber/eval-sorted-datalog-hammer]<br />
}}<br />
{{Publikation Details<br />
|Abstract=In a previous paper, we have shown that clause sets belonging to the Horn Bernays-Schönfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. We verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine. In this paper, we improve our Datalog hammer in several ways: we generalize it to mixed real-integer arithmetic and finite first-order sorts; we extend the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and we significantly reduce the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real world benchmark examples. Finally, we replace the before file-based interface between SPASS-SPL and VLog by a close coupling resulting in a single executable binary.<br />
|ISBN=978-3-030-99523-2<br />
|Download=Bromberger et al A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic.pdf<br />
|DOI Name=10.1007/978-3-030-99524-9<br />
|Projekt=CPEC, ScaDS.AI, Cfaed<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3309&diff=35968Inproceedings33092022-04-04T20:57:17Z<p>Irina Dragoste: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Martin<br />
|ErsterAutorNachname=Bromberger<br />
|FurtherAuthors=Irina Dragoste; Rasha Faqeh; Christof Fetzer; Larry González; Markus Krötzsch; Maximilian Marx; Harish K Murali; Christoph Weidenbach<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic<br />
|To appear=0<br />
|Year=2022<br />
|Month=April<br />
|Booktitle=Proc. of the 13th 27th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2022)<br />
|Pages=480-501<br />
|Publisher=Springer<br />
|Editor=Dana Fisman, Grigore Rosu<br />
|Series=LNCS<br />
|Volume=13243<br />
}}<br />
{{Publikation Tool<br />
|Tool=SPASS-SPL (https://github.com/mbromber/eval-sorted-datalog-hammer)<br />
}}<br />
{{Publikation Details<br />
|Abstract=In a previous paper, we have shown that clause sets belonging to the Horn Bernays-Schönfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. We verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine. In this paper, we improve our Datalog hammer in several ways: we generalize it to mixed real-integer arithmetic and finite first-order sorts; we extend the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and we significantly reduce the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real world benchmark examples. Finally, we replace the before file-based interface between SPASS-SPL and VLog by a close coupling resulting in a single executable binary.<br />
|ISBN=978-3-030-99523-2<br />
|Download=Bromberger et al A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic.pdf<br />
|DOI Name=10.1007/978-3-030-99524-9<br />
|Projekt=CPEC, ScaDS.AI, Cfaed<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3309&diff=35967Inproceedings33092022-04-04T20:48:59Z<p>Irina Dragoste: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Martin<br />
|ErsterAutorNachname=Bromberger<br />
|FurtherAuthors=Irina Dragoste; Rasha Faqeh; Christof Fetzer; Larry González; Markus Krötzsch; Maximilian Marx; Harish K Murali; Christoph Weidenbach<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic<br />
|To appear=0<br />
|Year=2022<br />
|Month=April<br />
|Booktitle=Proc. of the 13th 27th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2022)<br />
|Pages=480-501<br />
|Publisher=Springer<br />
|Editor=Dana Fisman, Grigore Rosu<br />
|Series=LNCS<br />
|Volume=13243<br />
}}<br />
{{Publikation Tool<br />
|Tool=SPASS-SPL<br />
}}<br />
{{Publikation Details<br />
|Abstract=In a previous paper, we have shown that clause sets belonging to the Horn Bernays-Schönfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. We verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine. In this paper, we improve our Datalog hammer in several ways: we generalize it to mixed real-integer arithmetic and finite first-order sorts; we extend the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and we significantly reduce the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real world benchmark examples. Finally, we replace the before file-based interface between SPASS-SPL and VLog by a close coupling resulting in a single executable binary.<br />
|ISBN=978-3-030-99523-2<br />
|Download=Bromberger et al A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic.pdf<br />
|DOI Name=10.1007/978-3-030-99524-9<br />
|Projekt=CPEC, ScaDS.AI, Cfaed<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3309&diff=35966Inproceedings33092022-04-04T20:48:34Z<p>Irina Dragoste: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Martin<br />
|ErsterAutorNachname=Bromberger<br />
|FurtherAuthors=Irina Dragoste; Rasha Faqeh; Christof Fetzer; Larry González; Markus Krötzsch; Maximilian Marx; Harish K Murali; Christoph Weidenbach<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic<br />
|To appear=0<br />
|Year=2022<br />
|Month=April<br />
|Booktitle=Proc. of the 13th 27th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2022)<br />
|Pages=480-501<br />
|Publisher=Springer<br />
|Editor=Dana Fisman, Grigore Rosu<br />
|Series=LNCS<br />
|Volume=13243<br />
}}<br />
{{Publikation Tool<br />
|Tool=SPASS-SPL<br />
}}<br />
{{Publikation Details<br />
|Abstract=In a previous paper, we have shown that clause sets belonging to the Horn Bernays-Schönfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. We verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine. In this paper, we improve our Datalog hammer in several ways: we generalize it to mixed real-integer arithmetic and finite first-order sorts; we extend the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and we significantly reduce the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real world benchmark examples. Finally, we replace the before file-based interface between SPASS-SPL and VLog by a close coupling resulting in a single executable binary.<br />
|ISBN=978-3-030-99523-2<br />
|Download=Bromberger et al A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic.pdf<br />
|DOI Name=https://doi.org/10.1007/978-3-030-99524-9<br />
|Projekt=CPEC, ScaDS.AI, Cfaed<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3309&diff=35965Inproceedings33092022-04-04T20:43:28Z<p>Irina Dragoste: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Martin<br />
|ErsterAutorNachname=Bromberger<br />
|FurtherAuthors=Irina Dragoste; Rasha Faqeh; Christof Fetzer; Larry González; Markus Krötzsch; Maximilian Marx; Harish K Murali; Christoph Weidenbach<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic<br />
|To appear=0<br />
|Year=2022<br />
|Month=April<br />
|Booktitle=Proc. of the 13th 27th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2022)<br />
|Pages=480-501<br />
|Publisher=Springer<br />
|Editor=Dana Fisman, Grigore Rosu<br />
|Series=LNCS<br />
|Volume=13243<br />
}}<br />
{{Publikation Tool<br />
|Tool=SPASS-SPL<br />
}}<br />
{{Publikation Details<br />
|Abstract=In a previous paper, we have shown that clause sets belonging to the Horn Bernays-Schönfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. We verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine. In this paper, we improve our Datalog hammer in several ways: we generalize it to mixed real-integer arithmetic and finite first-order sorts; we extend the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and we significantly reduce the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real world benchmark examples. Finally, we replace the before file-based interface between SPASS-SPL and VLog by a close coupling resulting in a single executable binary.<br />
|Download=Bromberger et al A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic.pdf<br />
|DOI Name=Springer<br />
|Projekt=CPEC, ScaDS.AI, Cfaed<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Bromberger_et_al_A_Sorted_Datalog_Hammer_for_Supervisor_Verification_Conditions_Modulo_Simple_Linear_Arithmetic.pdf&diff=35964Datei:Bromberger et al A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic.pdf2022-04-04T20:42:29Z<p>Irina Dragoste: </p>
<hr />
<div></div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3309&diff=35963Inproceedings33092022-04-04T20:31:20Z<p>Irina Dragoste: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Martin<br />
|ErsterAutorNachname=Bromberger<br />
|FurtherAuthors=Irina Dragoste; Rasha Faqeh; Christof Fetzer; Larry González; Markus Krötzsch; Maximilian Marx; Harish K Murali; Christoph Weidenbach<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic<br />
|To appear=0<br />
|Year=2022<br />
|Month=April<br />
|Booktitle=Proc. of the 13th 27th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2022)<br />
|Pages=480-501<br />
|Publisher=Springer<br />
|Editor=Dana Fisman, Grigore Rosu<br />
|Series=LNCS<br />
|Volume=13243<br />
}}<br />
{{Publikation Tool<br />
|Tool=SPASS-SPL<br />
}}<br />
{{Publikation Details<br />
|Abstract=In a previous paper, we have shown that clause sets belonging to the Horn Bernays-Schönfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. We verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine. In this paper, we improve our Datalog hammer in several ways: we generalize it to mixed real-integer arithmetic and finite first-order sorts; we extend the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and we significantly reduce the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real world benchmark examples. Finally, we replace the before file-based interface between SPASS-SPL and VLog by a close coupling resulting in a single executable binary.<br />
|Projekt=CPEC, ScaDS.AI, Cfaed<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3309/en&diff=35962Inproceedings3309/en2022-04-04T20:28:12Z<p>Irina Dragoste: Page created automatically by parser function on page Inproceedings3309</p>
<hr />
<div>#REDIRECT [[Inproceedings3309]]</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3309&diff=35961Inproceedings33092022-04-04T20:28:11Z<p>Irina Dragoste: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Martin |ErsterAutorNachname=Bromberger |FurtherAuthors=Irina Dragoste; Rasha Faqeh; Christof Fetzer; Larry Gonz…“</p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Martin<br />
|ErsterAutorNachname=Bromberger<br />
|FurtherAuthors=Irina Dragoste; Rasha Faqeh; Christof Fetzer; Larry González; Markus Krötzsch; Maximilian Marx; Harish K Murali; Christoph Weidenbach<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic<br />
|To appear=0<br />
|Year=2022<br />
|Month=April<br />
|Booktitle=Proc. (Part II) of the 13th 27th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2022)<br />
|Pages=480-501<br />
|Publisher=Springer<br />
|Editor=Dana Fisman, Grigore Rosu<br />
|Series=LNCS<br />
|Volume=13243<br />
}}<br />
{{Publikation Tool<br />
|Tool=SPASS-SPL<br />
}}<br />
{{Publikation Details<br />
|Abstract=In a previous paper, we have shown that clause sets belonging to the Horn Bernays-Schönfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. We verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine. In this paper, we improve our Datalog hammer in several ways: we generalize it to mixed real-integer arithmetic and finite first-order sorts; we extend the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and we significantly reduce the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real world benchmark examples. Finally, we replace the before file-based interface between SPASS-SPL and VLog by a close coupling resulting in a single executable binary.<br />
|Projekt=CPEC, ScaDS.AI, Cfaed<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Wissensbasierte_Systeme&diff=35720Wissensbasierte Systeme2022-01-25T14:31:07Z<p>Irina Dragoste: </p>
<hr />
<div>{{Forschungsgruppe<br />
|Name EN=Knowledge-Based Systems<br />
|Kurzname=InfSys<br />
|Beschreibung DE=In der Forschungsgruppe Wissensbasierte Systeme beschäftigen wir uns mit Methoden der intelligenten Verwaltung und Verarbeitung von Informationen in Computersystemen. Unsere Arbeitsgebiete liegen dabei besonders im Bereich der symbolischen Künstlichen Intelligenz (KI) und der logischen Methoden in der Informatik. Dies umfasst Fragestellungen der Wissensrepräsentation und des logischen Schließens, der diskreten Optimierung und Problemlösung, sowie der Datenbanken. Unsere Arbeit verbindet dabei erkenntnisorientierte Grundlagenforschung mit angewandten Arbeiten bishin zur Entwicklung praktischer Systeme.<br />
<br />
Die Forschungsgruppe ist am Institut für Theoretische Informatik der Fakultät Informatik angesiedelt und gehört darüber hinaus zum [[cfaed|Center for Advancing Electronics]] der TUD.<br />
|Beschreibung EN=The research group Knowledge-Based Systems is concerned with methods for the intelligent management and processing of information in computer systems. This includes research questions from knowledge representation, reasoning and formal logic, but also covers topics related to databases and distributed systems. Important application areas of this research can be found in the fields of semantic technologies, artificial intelligence, and knowledge management.<br />
<br />
The research group is affiliated with the Institute for Theoretical Computer Science.<br />
|Forschungsgruppenleiter=Markus Krötzsch<br />
|Sekretariat Mail=secretary_wbs@mailbox.tu-dresden.de<br />
|Bild=Knowledge-Based Systems 2022-01-25.jpg<br />
|Ehemalige Forschungsgruppe=0<br />
|Name DE=Wissensbasierte Systeme<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Knowledge-Based_Systems_2022-01-25.jpg&diff=35719Datei:Knowledge-Based Systems 2022-01-25.jpg2022-01-25T14:31:03Z<p>Irina Dragoste: new KBS group photo 2022</p>
<hr />
<div>new KBS group photo 2022</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Wissensbasierte_Systeme&diff=35714Wissensbasierte Systeme2022-01-25T07:19:26Z<p>Irina Dragoste: </p>
<hr />
<div>{{Forschungsgruppe<br />
|Name EN=Knowledge-Based Systems<br />
|Kurzname=InfSys<br />
|Beschreibung DE=In der Forschungsgruppe Wissensbasierte Systeme beschäftigen wir uns mit Methoden der intelligenten Verwaltung und Verarbeitung von Informationen in Computersystemen. Unsere Arbeitsgebiete liegen dabei besonders im Bereich der symbolischen Künstlichen Intelligenz (KI) und der logischen Methoden in der Informatik. Dies umfasst Fragestellungen der Wissensrepräsentation und des logischen Schließens, der diskreten Optimierung und Problemlösung, sowie der Datenbanken. Unsere Arbeit verbindet dabei erkenntnisorientierte Grundlagenforschung mit angewandten Arbeiten bishin zur Entwicklung praktischer Systeme.<br />
<br />
Die Forschungsgruppe ist am Institut für Theoretische Informatik der Fakultät Informatik angesiedelt und gehört darüber hinaus zum [[cfaed|Center for Advancing Electronics]] der TUD.<br />
|Beschreibung EN=The research group Knowledge-Based Systems is concerned with methods for the intelligent management and processing of information in computer systems. This includes research questions from knowledge representation, reasoning and formal logic, but also covers topics related to databases and distributed systems. Important application areas of this research can be found in the fields of semantic technologies, artificial intelligence, and knowledge management.<br />
<br />
The research group is affiliated with the Institute for Theoretical Computer Science.<br />
|Forschungsgruppenleiter=Markus Krötzsch<br />
|Sekretariat Mail=secretary_wbs@mailbox.tu-dresden.de<br />
|Bild=Group-logo-text-darker.png<br />
|Ehemalige Forschungsgruppe=0<br />
|Name DE=Wissensbasierte Systeme<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Group-logo-text-darker.png&diff=35713Datei:Group-logo-text-darker.png2022-01-25T07:18:24Z<p>Irina Dragoste: </p>
<hr />
<div></div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=VLog&diff=34667VLog2021-10-07T16:05:06Z<p>Irina Dragoste: </p>
<hr />
<div>{{DataOrTool<br />
|name=VLog<br />
|short description EN=A fast, highly scalable rule engine for existential rules and Datalog.<br />
|short description DE=A fast, highly scalable rule engine for existential rules and Datalog.<br />
|contact persons=Markus Kroetzsch<br />
|contributors=Markus Kroetzsch; Jacopo Urbani; Ceriel Jacobs; Irina Dragoste; David Carral; Maximilian Marx; Larry González<br />
|publication date=2018/04/13<br />
|long description EN=<b>VLog</b> (Vertical Datalog) is a <b>rule engine</b> that supports reasoning over <i>Horn existential rules</i> with stratified negation and, implicitly, <i>Datalog</i>. It uses a novel strategy based on a vertical storage architecture [1], which exhibits a state-of-the-art performance, distinguishing itself by excellent memory footprint and scalability [2].<br />
<br />
The engine applies a bottom-up strategy for existential rules, supporting the two most studied materialisation algorithms: the <i>Skolem</i> and the <i>Restricted (Standard) Chase</i>. The latter is recommended for use, as it leads to termination in more cases. <br />
<br />
VLog can be used for <i>query answering</i>, <i>federated reasoning</i> and <i>data integration</i>. It allows the use of multiple datasources at the same time, of various types (RDF stores, CSV files, OWL ontologies and remote SPARQL endpoints). <br />
<br />
VLog is open-source, and it provides two main tools for such reasoning tasks:<br />
* the core C++ reasoner <b>VLog</b> (https://github.com/karmaresearch/vlog), which is a command-line client with an interactive web interface that provides graphical representations of each rule executions, useful for tracing and debugging rule programs. The pre-compiled binaries can be obtained via Docker (karmaresearch/vlog), which facilitates a platfom-independent use.<br />
* the Java API <b>Rulewerk</b> (https://github.com/knowsys/rulewerk), which integrates the core reasoner for all major OSs, allowing an easy embedding into other applications, and providing additional functionality. It comprises of multiple <i>Maven</i> modules (<i>org.semanticweb.rulewerk</i>): <i>rulewerk-core</i> provides essential data models for rules and facts, and an interface for essential reasoner functionality; <i>rulewerk-parser</i> supports processing knowledge bases in Rulewerk syntax; <i>rulewerk-owlapi</i> supports converting rules from OWL ontology using the OWL API; <i>rulewerk-rdf</i> supports loading data from RDF files; <i>rulewerk-graal</i> supports converting rules, facts and queries from Graal API objects and DLGP files; <i>rulewerk-client</i> is stand-alone application that builds a command-line client for Rulewerk; <i>rulewerk-commands</i> provides support for running commands, as done by the client; <i>rulewerk-vlog</i> supports using VLog as a reasoning backend for Rulewerk; and <i>rulewerk-examples</i> demonstrates the use of above functionality.<br />
<br />
<br />
[1] Urbani, J., Jacobs, C., Krötzsch, M.: Column-oriented Datalog materialization for large<br />
knowledge graphs. In: Proc. 30th AAAI Conf. on Artificial Intelligence (AAAI’16). pp.<br />
258–264. AAAI Press (2016)<br />
<br />
[2] Urbani, J., Krötzsch, M., Jacobs, C., Dragoste, I., Carral, D.: Efficient model construction<br />
for Horn logic with VLog: System description. In: Proc. 9th Int. Joint Conf. on Automated<br />
Reasoning (IJCAR’18). LNAI, Springer (2018)<br />
|long description DE=<b>VLog</b> (Vertical Datalog) is a <b>rule engine</b> that supports reasoning over <i>Horn existential rules</i> with stratified negation and, implicitly, <i>Datalog</i>. It uses a novel strategy based on a vertical storage architecture [1], which exhibits a state-of-the-art performance, distinguishing itself by excellent memory footprint and scalability [2].<br />
<br />
The engine applies a bottom-up strategy for existential rules, supporting the two most studied materialisation algorithms: the <i>Skolem</i> and the <i>Restricted (Standard) Chase</i>. The latter is recommended for use, as it leads to termination in more cases. <br />
<br />
VLog can be used for <i>query answering</i>, <i>federated reasoning</i> and <i>data integration</i>. It allows the use of multiple datasources at the same time, of various types (RDF stores, CSV files, OWL ontologies and remote SPARQL endpoints). <br />
<br />
VLog is open-source, and it provides two main tools for such reasoning tasks:<br />
* the core C++ reasoner <b>VLog</b> (https://github.com/karmaresearch/vlog), which is a command-line client with an interactive web interface that provides graphical representations of each rule executions, useful for tracing and debugging rule programs. The pre-compiled binaries can be obtained via Docker (karmaresearch/vlog), which facilitates a platfom-independent use.<br />
* the Java API <b>Rulewerk</b> (https://github.com/knowsys/rulewerk), which integrates the core reasoner for all major OSs, allowing an easy embedding into other applications, and providing additional functionality. It comprises of multiple <i>Maven</i> modules (<i>org.semanticweb.rulewerk</i>): <i>rulewerk-core</i> provides essential data models for rules and facts, and an interface for essential reasoner functionality; <i>rulewerk-parser</i> supports processing knowledge bases in Rulewerk syntax; <i>rulewerk-owlapi</i> supports converting rules from OWL ontology using the OWL API; <i>rulewerk-rdf</i> supports loading data from RDF files; <i>rulewerk-graal</i> supports converting rules, facts and queries from Graal API objects and DLGP files; <i>rulewerk-client</i> is stand-alone application that builds a command-line client for Rulewerk; <i>rulewerk-commands</i> provides support for running commands, as done by the client; <i>rulewerk-vlog</i> supports using VLog as a reasoning backend for Rulewerk; and <i>rulewerk-examples</i> demonstrates the use of above functionality.<br />
<br />
<br />
[1] Urbani, J., Jacobs, C., Krötzsch, M.: Column-oriented Datalog materialization for large<br />
knowledge graphs. In: Proc. 30th AAAI Conf. on Artificial Intelligence (AAAI’16). pp.<br />
258–264. AAAI Press (2016)<br />
<br />
[2] Urbani, J., Krötzsch, M., Jacobs, C., Dragoste, I., Carral, D.: Efficient model construction<br />
for Horn logic with VLog: System description. In: Proc. 9th Int. Joint Conf. on Automated<br />
Reasoning (IJCAR’18). LNAI, Springer (2018)<br />
|projekt=DIAMOND; HAEC B08<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
|dataOrTool=Tool<br />
|Projektstatus=aktiv<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Existenzielle Regeln<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Logic and Decision Procedures<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Semantische Technologien<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=VLog&diff=34666VLog2021-10-07T16:00:41Z<p>Irina Dragoste: </p>
<hr />
<div>{{DataOrTool<br />
|name=VLog<br />
|short description EN=A fast, highly scalable rule engine for existential rules and Datalog.<br />
|short description DE=A fast, highly scalable rule engine for existential rules and Datalog.<br />
|contact persons=Markus Kroetzsch<br />
|contributors=Markus Kroetzsch; Jacopo Urbani; Ceriel Jacobs; Irina Dragoste; David Carral; Maximilian Marx; Larry González<br />
|publication date=2018/04/13<br />
|long description EN=<b>VLog</b> (Vertical Datalog) is a <b>rule engine</b> that supports reasoning over <i>Horn existential rules</i> with stratified negation and, implicitly, <i>Datalog</i>. It uses a novel strategy based on a vertical storage architecture [1], which exhibits a state-of-the-art performance, distinguishing itself by excellent memory footprint and scalability [2].<br />
<br />
The engine applies a bottom-up strategy for existential rules, supporting the two most studied materialisation algorithms: the <i>Skolem</i> and the <i>Restricted (Standard) Chase</i>. The latter is recommended for use, as it leads to termination in more cases. <br />
<br />
VLog can be used for <i>query answering</i>, <i>federated reasoning</i> and <i>data integration</i>. It allows the use of multiple datasources at the same time, of various types (RDF stores, CSV files, OWL ontologies and remote SPARQL endpoints). <br />
<br />
VLog is open-source, and it provides two main tools for such reasoning tasks:<br />
* the core C++ reasoner <b>VLog</b> (https://github.com/karmaresearch/vlog), which is a command-line client with an interactive web interface that provides graphical representations of each rule executions, useful for tracing and debugging rule programs. The pre-compiled binaries can be obtained via Docker (karmaresearch/vlog), which facilitates a platfom-independent use.<br />
* the Java API <b>Rulewerk</b> (https://github.com/knowsys/vlog4j), which integrates the core reasoner for all major OSs, allowing an easy embedding into other applications, and providing additional functionality. It comprises of multiple <i>Maven</i> modules (<i>org.semanticweb.vlog4j</i>): <i>vlog4j-core</i> provides essential data models for rules and facts, and essential reasoner functionality; <i>vlog4j-owlapi</i> supports converting rules from OWL ontology using the OWL API; <i>vlog4j-rdf</i> supports loading data from RDF files; and <i>vlog4j-examples</i> demonstrates the use of above functionality.<br />
<br />
<br />
[1] Urbani, J., Jacobs, C., Krötzsch, M.: Column-oriented Datalog materialization for large<br />
knowledge graphs. In: Proc. 30th AAAI Conf. on Artificial Intelligence (AAAI’16). pp.<br />
258–264. AAAI Press (2016)<br />
<br />
[2] Urbani, J., Krötzsch, M., Jacobs, C., Dragoste, I., Carral, D.: Efficient model construction<br />
for Horn logic with VLog: System description. In: Proc. 9th Int. Joint Conf. on Automated<br />
Reasoning (IJCAR’18). LNAI, Springer (2018)<br />
|long description DE=<b>VLog</b> (Vertical Datalog) is a <b>rule engine</b> that supports reasoning over <i>Horn existential rules</i> with stratified negation and, implicitly, <i>Datalog</i>. It uses a novel strategy based on a vertical storage architecture [1], which exhibits a state-of-the-art performance, distinguishing itself by excellent memory footprint and scalability [2].<br />
<br />
The engine applies a bottom-up strategy for existential rules, supporting the two most studied materialisation algorithms: the <i>Skolem</i> and the <i>Restricted (Standard) Chase</i>. The latter is recommended for use, as it leads to termination in more cases. <br />
<br />
VLog can be used for <i>query answering</i>, <i>federated reasoning</i> and <i>data integration</i>. It allows the use of multiple datasources at the same time, of various types (RDF stores, CSV files, OWL ontologies and remote SPARQL endpoints). <br />
<br />
VLog is open-source, and it provides two main tools for such reasoning tasks:<br />
* the core C++ reasoner <b>VLog</b> (https://github.com/karmaresearch/vlog), which is a command-line client with an interactive web interface that provides graphical representations of each rule executions, useful for tracing and debugging rule programs. The pre-compiled binaries can be obtained via Docker (karmaresearch/vlog), which facilitates a platfom-independent use.<br />
* the Java API <b>Rulewerk</b> (https://github.com/knowsys/rulewerk), which integrates the core reasoner for all major OSs, allowing an easy embedding into other applications, and providing additional functionality. It comprises of multiple <i>Maven</i> modules (<i>org.semanticweb.rulewerk</i>): <i>rulewerk-core</i> provides essential data models for rules and facts, and an interface for essential reasoner functionality; <i>rulewerk-parser</i> supports processing knowledge bases in Rulewerk syntax; <i>rulewerk-owlapi</i> supports converting rules from OWL ontology using the OWL API; <i>rulewerk-rdf</i> supports loading data from RDF files; <i>rulewerk-graal</i> supports converting rules, facts and queries from Graal API objects and DLGP files; <i>rulewerk-client</i> is stand-alone application that builds a command-line client for Rulewerk; <i>rulewerk-commands</i> provides support for running commands, as done by the client; <i>rulewerk-vlog</i> supports using VLog as a reasoning backend for Rulewerk; and <i>rulewerk-examples</i> demonstrates the use of above functionality.<br />
<br />
<br />
[1] Urbani, J., Jacobs, C., Krötzsch, M.: Column-oriented Datalog materialization for large<br />
knowledge graphs. In: Proc. 30th AAAI Conf. on Artificial Intelligence (AAAI’16). pp.<br />
258–264. AAAI Press (2016)<br />
<br />
[2] Urbani, J., Krötzsch, M., Jacobs, C., Dragoste, I., Carral, D.: Efficient model construction<br />
for Horn logic with VLog: System description. In: Proc. 9th Int. Joint Conf. on Automated<br />
Reasoning (IJCAR’18). LNAI, Springer (2018)<br />
|projekt=DIAMOND; HAEC B08<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
|dataOrTool=Tool<br />
|Projektstatus=aktiv<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Existenzielle Regeln<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Logic and Decision Procedures<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Semantische Technologien<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Seminar_29.07.2021&diff=34489Seminar 29.07.20212021-07-29T12:32:50Z<p>Irina Dragoste: </p>
<hr />
<div>{{Veranstaltung<br />
|Titel EN=Challenges of Using Leapfrog Triejoin for Datalog Programs<br />
|Beschreibung EN=Datalog is a well-understood relational query language and there are efficient implementations, based on different concepts and technologies. Nevertheless, the search for faster and more efficient reasoners continues. A promising approach for further improvements is the so-called leapfrog triejoin by Veldhuizen. Leapfrog triejoin is a variable-oriented join algorithm and computes the matches of a Datalog rule as a result tree following a previously defined variable order. Leapfrog triejoin is worst-case optimal w.r.t. the AGM bound, which provides a tight bound on the maximum result size of full conjunctive queries, and empirical evaluations suggest that leapfrog triejoin is relevant in practice, too.<br />
<br />
The focus of the current research concerning leapfrog triejoin lies on the theoretical and practical aspects of computing a single join. Implementing a Datalog reasoner based on leapfrog triejoin, however, requires to compute the consequences of a Datalog program with several rules and, thus, several joins. The main task is to find variable orders for all the joins that are both locally and globally good. We discuss challenges, which arise naturally in this setting, as well as potential approaches.<br />
<br />
<br />
This talk will take place online via BigBlueButton. To access the room, take one of the following links:<br />
<br />
with ZIH-login: <br />
<br />
https://selfservice.zih.tu-dresden.de/l/link.php?m=136288&p=07d4d73e<br />
<br />
without ZIH-login:<br />
https://selfservice.zih.tu-dresden.de/link.php?m=136288&p=788f2a1a<br />
|Veranstaltungsart=Vortrag<br />
|Start=2021/07/29 13:00:00<br />
|Ende=2021/07/29 14:30:00<br />
|Vortragender=Philipp Hanisch<br />
|PDF=Slides-Seminar-20210729<br />
|Event series=Research Seminar Logic and AI<br />
|In News anzeigen=1<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Seminar_29.07.2021&diff=34488Seminar 29.07.20212021-07-29T12:32:23Z<p>Irina Dragoste: </p>
<hr />
<div>{{Veranstaltung<br />
|Titel EN=Challenges of Using Leapfrog Triejoin for Datalog Programs<br />
|Beschreibung EN=Datalog is a well-understood relational query language and there are efficient implementations, based on different concepts and technologies. Nevertheless, the search for faster and more efficient reasoners continues. A promising approach for further improvements is the so-called leapfrog triejoin by Veldhuizen. Leapfrog triejoin is a variable-oriented join algorithm and computes the matches of a Datalog rule as a result tree following a previously defined variable order. Leapfrog triejoin is worst-case optimal w.r.t. the AGM bound, which provides a tight bound on the maximum result size of full conjunctive queries, and empirical evaluations suggest that leapfrog triejoin is relevant in practice, too.<br />
<br />
The focus of the current research concerning leapfrog triejoin lies on the theoretical and practical aspects of computing a single join. Implementing a Datalog reasoner based on leapfrog triejoin, however, requires to compute the consequences of a Datalog program with several rules and, thus, several joins. The main task is to find variable orders for all the joins that are both locally and globally good. We discuss challenges, which arise naturally in this setting, as well as potential approaches.<br />
<br />
<br />
This talk will take place online via BigBlueButton. To access the room, take one of the following links:<br />
<br />
with ZIH-login: <br />
<br />
https://selfservice.zih.tu-dresden.de/l/link.php?m=136288&p=07d4d73e<br />
<br />
without ZIH-login:<br />
https://selfservice.zih.tu-dresden.de/link.php?m=136288&p=788f2a1a<br />
|Veranstaltungsart=Vortrag<br />
|Start=2021/07/29 13:00:00<br />
|Ende=2021/07/29 14:30:00<br />
|Vortragender=Philipp Hanisch<br />
|PDF=Slides-Seminar-20210729.pdf<br />
|Event series=Research Seminar Logic and AI<br />
|In News anzeigen=1<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Seminar_29.07.2021&diff=34487Seminar 29.07.20212021-07-29T12:29:42Z<p>Irina Dragoste: </p>
<hr />
<div>{{Veranstaltung<br />
|Titel EN=Challenges of Using Leapfrog Triejoin for Datalog Programs<br />
|Beschreibung EN=Datalog is a well-understood relational query language and there are efficient implementations, based on different concepts and technologies. Nevertheless, the search for faster and more efficient reasoners continues. A promising approach for further improvements is the so-called leapfrog triejoin by Veldhuizen. Leapfrog triejoin is a variable-oriented join algorithm and computes the matches of a Datalog rule as a result tree following a previously defined variable order. Leapfrog triejoin is worst-case optimal w.r.t. the AGM bound, which provides a tight bound on the maximum result size of full conjunctive queries, and empirical evaluations suggest that leapfrog triejoin is relevant in practice, too.<br />
<br />
The focus of the current research concerning leapfrog triejoin lies on the theoretical and practical aspects of computing a single join. Implementing a Datalog reasoner based on leapfrog triejoin, however, requires to compute the consequences of a Datalog program with several rules and, thus, several joins. The main task is to find variable orders for all the joins that are both locally and globally good. We discuss challenges, which arise naturally in this setting, as well as potential approaches.<br />
<br />
<br />
This talk will take place online via BigBlueButton. To access the room, take one of the following links:<br />
<br />
with ZIH-login: <br />
<br />
https://selfservice.zih.tu-dresden.de/l/link.php?m=136288&p=07d4d73e<br />
<br />
without ZIH-login:<br />
https://selfservice.zih.tu-dresden.de/link.php?m=136288&p=788f2a1a<br />
|Veranstaltungsart=Vortrag<br />
|Start=2021/07/29 13:00:00<br />
|Ende=2021/07/29 14:30:00<br />
|Vortragender=Philipp Hanisch<br />
|PDF=[[Datei:Slides-Seminar-20210729.pdf]]<br />
|Event series=Research Seminar Logic and AI<br />
|In News anzeigen=1<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Seminar_29.07.2021&diff=34486Seminar 29.07.20212021-07-29T12:28:59Z<p>Irina Dragoste: </p>
<hr />
<div>{{Veranstaltung<br />
|Titel EN=Challenges of Using Leapfrog Triejoin for Datalog Programs<br />
|Beschreibung EN=Datalog is a well-understood relational query language and there are efficient implementations, based on different concepts and technologies. Nevertheless, the search for faster and more efficient reasoners continues. A promising approach for further improvements is the so-called leapfrog triejoin by Veldhuizen. Leapfrog triejoin is a variable-oriented join algorithm and computes the matches of a Datalog rule as a result tree following a previously defined variable order. Leapfrog triejoin is worst-case optimal w.r.t. the AGM bound, which provides a tight bound on the maximum result size of full conjunctive queries, and empirical evaluations suggest that leapfrog triejoin is relevant in practice, too.<br />
<br />
The focus of the current research concerning leapfrog triejoin lies on the theoretical and practical aspects of computing a single join. Implementing a Datalog reasoner based on leapfrog triejoin, however, requires to compute the consequences of a Datalog program with several rules and, thus, several joins. The main task is to find variable orders for all the joins that are both locally and globally good. We discuss challenges, which arise naturally in this setting, as well as potential approaches.<br />
<br />
<br />
This talk will take place online via BigBlueButton. To access the room, take one of the following links:<br />
<br />
with ZIH-login: <br />
<br />
https://selfservice.zih.tu-dresden.de/l/link.php?m=136288&p=07d4d73e<br />
<br />
without ZIH-login:<br />
https://selfservice.zih.tu-dresden.de/link.php?m=136288&p=788f2a1a<br />
|Veranstaltungsart=Vortrag<br />
|Start=2021/07/29 13:00:00<br />
|Ende=2021/07/29 14:30:00<br />
|Vortragender=Philipp Hanisch<br />
|PDF=[[Datei:Slides-Seminar-20210729]]<br />
|Event series=Research Seminar Logic and AI<br />
|In News anzeigen=1<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Seminar_29.07.2021&diff=34485Seminar 29.07.20212021-07-29T12:28:24Z<p>Irina Dragoste: </p>
<hr />
<div>{{Veranstaltung<br />
|Titel EN=Challenges of Using Leapfrog Triejoin for Datalog Programs<br />
|Beschreibung EN=Datalog is a well-understood relational query language and there are efficient implementations, based on different concepts and technologies. Nevertheless, the search for faster and more efficient reasoners continues. A promising approach for further improvements is the so-called leapfrog triejoin by Veldhuizen. Leapfrog triejoin is a variable-oriented join algorithm and computes the matches of a Datalog rule as a result tree following a previously defined variable order. Leapfrog triejoin is worst-case optimal w.r.t. the AGM bound, which provides a tight bound on the maximum result size of full conjunctive queries, and empirical evaluations suggest that leapfrog triejoin is relevant in practice, too.<br />
<br />
The focus of the current research concerning leapfrog triejoin lies on the theoretical and practical aspects of computing a single join. Implementing a Datalog reasoner based on leapfrog triejoin, however, requires to compute the consequences of a Datalog program with several rules and, thus, several joins. The main task is to find variable orders for all the joins that are both locally and globally good. We discuss challenges, which arise naturally in this setting, as well as potential approaches.<br />
<br />
<br />
This talk will take place online via BigBlueButton. To access the room, take one of the following links:<br />
<br />
with ZIH-login: <br />
<br />
https://selfservice.zih.tu-dresden.de/l/link.php?m=136288&p=07d4d73e<br />
<br />
without ZIH-login:<br />
https://selfservice.zih.tu-dresden.de/link.php?m=136288&p=788f2a1a<br />
|Veranstaltungsart=Vortrag<br />
|Start=2021/07/29 13:00:00<br />
|Ende=2021/07/29 14:30:00<br />
|Vortragender=Philipp Hanisch<br />
|PDF=Datei:Slides-Seminar-20210729<br />
|Event series=Research Seminar Logic and AI<br />
|In News anzeigen=1<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=KBS_Seminar&diff=31929KBS Seminar2020-11-10T11:09:54Z<p>Irina Dragoste: </p>
<hr />
<div>'''Bold text'''{{#leftsidenav:<!--<br />
<br />
*** The first part defines the content of the left-side navigation.<br />
*** We use a headline "Contents" (you could use any text)<br />
*** and then insert the automatically generated table of contents (you could make a manual list of links there instead)<br />
*** (this is all writting inside a comment area, hence it does not show on page)<br />
<br />
-->{{LeftsidenavHeading|Contents}}<br />
<div class="no-toc-head">__TOC__</div><br />
|<!--<br />
<br />
*** Now comes the actual main part of the page (right-hand side).<br />
<br />
-->{{Main heading|KBS Seminar}}<br />
'''Update: This seminar is not currently running. It has been replaced by a new seminar on related topics: [[Research Seminar Logic and AI]].'''<br />
<br />
In this seminar, we invite speakers to present their research on Knowledge-Based Systems related topics. This includes presentations of published or accepted papers, rehearsals for future talks at conferences, defenses of very good student theses, as well as presentations of ongoing research. Coffee is usually provided. All are welcome.<br />
<br />
The seminar is organised by the [[Wissensbasierte Systeme/en|Knowledge Based Systems]] group. Please contact [[Irina Dragoste/en|Irina Dragoste]] if you would like to give a talk or invite a speaker.<br />
<br />
===Schedule and Location===<br />
<br />
The seminar takes place most Thursdays from 13.00 &ndash; 14.30 in room [[APB 3027/en|APB 3027]]. Please see the detailed programme for information on upcoming seminars.<br />
<br />
====Recent and Upcoming Talks====<br />
<br />
<table class="table" ><br />
<tr><th>Date</th><th>Speaker</th><th>Topic</th></tr><br />
{{#ask: [[Event series::KBS Seminar]]<br />
| ?Titel EN=<br />
| ?Datum#ISO=<br />
| ?Vortragender=<br />
| sort=Datum<br />
| order=desc<br />
| format=plainlist<br />
| template=Talk short inline/en<br />
| searchlabel=<br />
| link=none<br />
| limit=5<br />
}}<br />
<tr><td></td><td>{{#ask: [[Event series::KBS Seminar]]|<br />
| ?Datum=Date<br />
| ?=Title<br />
| ?Vortragender=Speaker<br />
| mainlabel=-<br />
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks &hellip;}}</td><td>{{Upcoming events feed<br />
| L=/en<br />
| query=[[Event series::KBS Seminar]]<br />
| label=Subscribe to upcoming talks (iCal)<br />
| calendartitle=ICCL KBS_Seminar<br />
}}</td></tr><br />
</table><br />
<br />
===Calendar===<br />
Temporary unavailable<br />
<br />
{{#ask:[[Event series::KBS Seminar]][[Start::+]]<br />
| ?Start<br />
| ?Ende<br />
| ?Titel EN=title<br />
| ?Raum=Room<br />
| ?Veranstaltungsart=<br/>Type<br />
| ?Vortragender=<br/>Speaker<br />
| ?Beschreibung EN=<br/>Details<br />
| format=eventcalendar<br />
| firstday=Monday<br />
| defaultview=month<br />
| limit=1000<br />
| link=subject<br />
}}<br />
<br />
}}<!-- Closing braces for the two-column layout ("leftsidenav" at the top); DON'T DELETE THIS BY ACCIDENT. --><br />
<br />
{{#set:<br />
|Title=Research Seminar Knowledge-Based Systems<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
|Lecturer=Markus Krötzsch<br />
|Lecturer=Irina Dragoste<br />
|Modul=INF-AQUA<br />
|Modul=INF-PM-FOR<br />
|Term=WS<br />
|Year=2018<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
}}<br />
[[Kategorie:Event series]] [[Kategorie:Vorlesung]]</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=KBS_Seminar&diff=31267KBS Seminar2020-09-10T12:20:30Z<p>Irina Dragoste: </p>
<hr />
<div>{{#leftsidenav:<!--<br />
<br />
*** The first part defines the content of the left-side navigation.<br />
*** We use a headline "Contents" (you could use any text)<br />
*** and then insert the automatically generated table of contents (you could make a manual list of links there instead)<br />
*** (this is all writting inside a comment area, hence it does not show on page)<br />
<br />
-->{{LeftsidenavHeading|Contents}}<br />
<div class="no-toc-head">__TOC__</div><br />
|<!--<br />
<br />
*** Now comes the actual main part of the page (right-hand side).<br />
<br />
-->{{Main heading|KBS Seminar}}<br />
<br />
In this seminar, we invite speakers to present their research on Knowledge-Based Systems related topics. This includes presentations of published or accepted papers, rehearsals for future talks at conferences, defenses of very good student theses, as well as presentations of ongoing research. Coffee is usually provided. All are welcome.<br />
<br />
The seminar is organised by the [[Wissensbasierte Systeme/en|Knowledge Based Systems]] group. Please contact [[Irina Dragoste/en|Irina Dragoste]] if you would like to give a talk or invite a speaker.<br />
<br />
===Schedule and Location===<br />
<br />
The seminar takes place most Thursdays from 13.00 &ndash; 14.30 in room [[APB 3027/en|APB 3027]]. Please see the detailed programme for information on upcoming seminars.<br />
<br />
====Recent and Upcoming Talks====<br />
<br />
<table class="table" ><br />
<tr><th>Date</th><th>Speaker</th><th>Topic</th></tr><br />
{{#ask: [[Event series::KBS Seminar]]<br />
| ?Titel EN=<br />
| ?Datum#ISO=<br />
| ?Vortragender=<br />
| sort=Datum<br />
| order=desc<br />
| format=plainlist<br />
| template=Talk short inline/en<br />
| searchlabel=<br />
| link=none<br />
| limit=5<br />
}}<br />
<tr><td></td><td>{{#ask: [[Event series::KBS Seminar]]|<br />
| ?Datum=Date<br />
| ?=Title<br />
| ?Vortragender=Speaker<br />
| mainlabel=-<br />
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks &hellip;}}</td><td>{{Upcoming events feed<br />
| L=/en<br />
| query=[[Event series::KBS Seminar]]<br />
| label=Subscribe to upcoming talks (iCal)<br />
| calendartitle=ICCL KBS_Seminar<br />
}}</td></tr><br />
</table><br />
<br />
===Information for Students===<br />
<br />
Students are generally welcome to participate in this research seminar. It is possible to earn credits for modules INF-AQUA and INF-PM-FOR. Students who would like to take advantage of this option should register at the start of the seminar by contacting [[Markus Krötzsch]] to discuss the details.<br />
<br />
===Calendar===<br />
Temporary unavailable<br />
<br />
{{#ask:[[Event series::KBS Seminar]][[Start::+]]<br />
| ?Start<br />
| ?Ende<br />
| ?Titel EN=title<br />
| ?Raum=Room<br />
| ?Veranstaltungsart=<br/>Type<br />
| ?Vortragender=<br/>Speaker<br />
| ?Beschreibung EN=<br/>Details<br />
| format=eventcalendar<br />
| firstday=Monday<br />
| defaultview=month<br />
| limit=1000<br />
| link=subject<br />
}}<br />
<br />
}}<!-- Closing braces for the two-column layout ("leftsidenav" at the top); DON'T DELETE THIS BY ACCIDENT. --><br />
<br />
{{#set:<br />
|Title=Research Seminar Knowledge-Based Systems<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
|Lecturer=Markus Krötzsch<br />
|Lecturer=Irina Dragoste<br />
|Modul=INF-AQUA<br />
|Modul=INF-PM-FOR<br />
|Term=WS<br />
|Year=2018<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
}}<br />
[[Kategorie:Event series]] [[Kategorie:Vorlesung]]</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Smoke_Test_Planning_using_Answer_Set_Programming&diff=31266Smoke Test Planning using Answer Set Programming2020-09-10T12:16:05Z<p>Irina Dragoste: </p>
<hr />
<div>{{Veranstaltung<br />
|Titel EN=Smoke Test Planning using Answer Set Programming<br />
|Beschreibung EN=Smoke testing is an important method to increase stability and reliability of hardware-depending systems. Due to concurrent access to the same physical resource and the impracticality of the use of virtualization, smoke testing requires some form of planning. In this paper, we propose to decompose test cases in terms of atomic actions consisting of preconditions and effects. We present a solution based on answer set programming with multi-shot solving that automatically generates short parallel test plans. Experiments suggest that the approach is feasible for non-inherently sequential test cases and scales up to thousands of test cases.<br />
<br />
<br />
This talk will be held online and take approximately 30 minutes after which questions can be asked. If there is any interest in attending, please send an e-mail to thomas.feller@tu-dresden.de.<br />
|Veranstaltungsart=Vortrag<br />
|Start=2020/09/10 13:00:00<br />
|Ende=2020/09/10 14:30:00<br />
|Raum=online<br />
|Vortragender=Valentin Roland<br />
|Event series=Research Seminar Logic and AI<br />
|In News anzeigen=1<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Research_Seminar_Logic_and_AI_(WS2020)&diff=31265Research Seminar Logic and AI (WS2020)2020-09-10T12:11:51Z<p>Irina Dragoste: Irina Dragoste verschob die Seite Research Seminar Logic and AI (WS2020) nach Research Seminar Logic and AI</p>
<hr />
<div>#WEITERLEITUNG [[Research Seminar Logic and AI]]</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Research_Seminar_Logic_and_AI&diff=31264Research Seminar Logic and AI2020-09-10T12:11:51Z<p>Irina Dragoste: Irina Dragoste verschob die Seite Research Seminar Logic and AI (WS2020) nach Research Seminar Logic and AI</p>
<hr />
<div>{{#leftsidenav:<!--<br />
<br />
*** The first part defines the content of the left-side navigation.<br />
*** We use a headline "Contents" (you could use any text)<br />
*** and then insert the automatically generated table of contents (you could make a manual list of links there instead)<br />
*** (this is all writting inside a comment area, hence it does not show on page)<br />
<br />
-->{{LeftsidenavHeading|Contents}}<br />
<div class="no-toc-head">__TOC__</div><br />
|<!--<br />
<br />
*** Now comes the actual main part of the page (right-hand side).<br />
<br />
-->{{Main heading|Research Seminar Logic and AI}}<br />
<br />
In this research seminar, we invite speakers to present their research on topucs related to logic and artificial intelligence. This includes presentations of published or accepted papers, rehearsals for future talks at conferences, defenses of very good student theses, as well as presentations of ongoing research. Coffee is usually provided. All are welcome.<br />
<br />
The seminar is organised by the [[Computational Logic/en|Computational Logic]] group. Please contact [[Thomas Feller/en|Thomas Feller]] if you would like to give a talk or invite a speaker.<br />
<br />
===Schedule and Location===<br />
<br />
The seminar takes place most Thursdays from 13.00 &ndash; 14.30. Because of the ongoing pandemic this research seminar will take place online until further notice. If you want to attend a talk, please contact [[Thomas Feller/en|Thomas Feller]] to obtain the link leading to the online room.<br />
Please see the detailed programme for information on upcoming seminars.<br />
<br />
====Recent and Upcoming Talks====<br />
<br />
<table class="table" ><br />
<tr><th>Date</th><th>Speaker</th><th>Topic</th></tr><br />
{{#ask: [[Event series::Research Seminar Logic and AI]]<br />
| ?Titel EN=<br />
| ?Datum#ISO=<br />
| ?Vortragender=<br />
| sort=Datum<br />
| order=desc<br />
| format=plainlist<br />
| template=Talk short inline/en<br />
| searchlabel=<br />
| link=none<br />
| limit=5<br />
}}<br />
<tr><td></td><td>{{#ask: [[Event series::Research Seminar Logic and AI]]|<br />
| ?Datum=Date<br />
| ?=Title<br />
| ?Vortragender=Speaker<br />
| mainlabel=-<br />
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks &hellip;}}</td><td>{{Upcoming events feed<br />
| L=/en<br />
| query=[[Event series::Research Seminar Logic and AI]]<br />
| label=Subscribe to upcoming talks (iCal)<br />
| calendartitle=ICCL Research Seminar Logic and AI<br />
}}</td></tr><br />
</table><br />
<br />
<br />
===Calendar===<br />
Temporary unavailable<br />
<br />
{{#ask:[[Event series::Research Seminar Logic and AI]][[Start::+]]<br />
| ?Start<br />
| ?Ende<br />
| ?Titel EN=title<br />
| ?Raum=Room<br />
| ?Veranstaltungsart=<br/>Type<br />
| ?Vortragender=<br/>Speaker<br />
| ?Beschreibung EN=<br/>Details<br />
| format=eventcalendar<br />
| firstday=Monday<br />
| defaultview=month<br />
| limit=1000<br />
| link=subject<br />
}}<br />
<br />
}}<!-- Closing braces for the two-column layout ("leftsidenav" at the top); DON'T DELETE THIS BY ACCIDENT. --><br />
<br />
{{#set:<br />
|Title=Research Seminar Logic and AI<br />
|Forschungsgruppe=Computational Logic<br />
|Lecturer=Sebastian Rudolph<br />
|Lecturer=Thomas Feller<br />
|Modul=INF-AQUA<br />
|Modul=INF-PM-FOR<br />
|Term=WS<br />
|Year=2020<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
}}<br />
[[Kategorie:Event series]] [[Kategorie:Vorlesung]]</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Research_Seminar_Logic_and_AI_(WS2020)/en&diff=31263Research Seminar Logic and AI (WS2020)/en2020-09-10T12:11:12Z<p>Irina Dragoste: Irina Dragoste verschob die Seite Research Seminar Logic and AI (WS2020)/en nach Research Seminar Logic and AI/en</p>
<hr />
<div>#WEITERLEITUNG [[Research Seminar Logic and AI/en]]</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Research_Seminar_Logic_and_AI/en&diff=31262Research Seminar Logic and AI/en2020-09-10T12:11:12Z<p>Irina Dragoste: Irina Dragoste verschob die Seite Research Seminar Logic and AI (WS2020)/en nach Research Seminar Logic and AI/en</p>
<hr />
<div>{{Vorlesung/en}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Test_(WS2020)/en&diff=31201Test (WS2020)/en2020-09-08T20:51:43Z<p>Irina Dragoste: Page created automatically by parser function on page Test (WS2020)</p>
<hr />
<div>{{Vorlesung/en}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=KBS_Seminar&diff=30963KBS Seminar2020-07-09T12:34:26Z<p>Irina Dragoste: </p>
<hr />
<div>{{#leftsidenav:<!--<br />
<br />
*** The first part defines the content of the left-side navigation.<br />
*** We use a headline "Contents" (you could use any text)<br />
*** and then insert the automatically generated table of contents (you could make a manual list of links there instead)<br />
*** (this is all writting inside a comment area, hence it does not show on page)<br />
<br />
-->{{LeftsidenavHeading|Contents}}<br />
<div class="no-toc-head">__TOC__</div><br />
|<!--<br />
<br />
*** Now comes the actual main part of the page (right-hand side).<br />
<br />
-->{{Main heading|KBS Seminar}}<br />
<br />
In this seminar, we invite speakers to present their research on Knowledge-Based Systems related topics. This includes presentations of published or accepted papers, rehearsals for future talks at conferences, defenses of very good student theses, as well as presentations of ongoing research. Coffee is usually provided. All are welcome.<br />
<br />
The seminar is organised by the [[Wissensbasierte Systeme/en|Knowledge Based Systems]] group. Please contact [[Thomas Feller/en|Thomas Feller]] if you would like to give a talk or invite a speaker.<br />
<br />
===Schedule and Location===<br />
<br />
The seminar takes place most Thursdays from 13.00 &ndash; 14.30 in room [[APB 3027/en|APB 3027]]. Please see the detailed programme for information on upcoming seminars.<br />
<br />
====Recent and Upcoming Talks====<br />
<br />
<table class="table" ><br />
<tr><th>Date</th><th>Speaker</th><th>Topic</th></tr><br />
{{#ask: [[Event series::KBS Seminar]]<br />
| ?Titel EN=<br />
| ?Datum#ISO=<br />
| ?Vortragender=<br />
| sort=Datum<br />
| order=desc<br />
| format=plainlist<br />
| template=Talk short inline/en<br />
| searchlabel=<br />
| link=none<br />
| limit=5<br />
}}<br />
<tr><td></td><td>{{#ask: [[Event series::KBS Seminar]]|<br />
| ?Datum=Date<br />
| ?=Title<br />
| ?Vortragender=Speaker<br />
| mainlabel=-<br />
| sort=Datum | order=desc | limit=0 | searchlabel=View older talks &hellip;}}</td><td>{{Upcoming events feed<br />
| L=/en<br />
| query=[[Event series::KBS Seminar]]<br />
| label=Subscribe to upcoming talks (iCal)<br />
| calendartitle=ICCL KBS_Seminar<br />
}}</td></tr><br />
</table><br />
<br />
===Information for Students===<br />
<br />
Students are generally welcome to participate in this research seminar. It is possible to earn credits for modules INF-AQUA and INF-PM-FOR. Students who would like to take advantage of this option should register at the start of the seminar by contacting [[Markus Krötzsch]] to discuss the details.<br />
<br />
===Calendar===<br />
Temporary unavailable<br />
<br />
{{#ask:[[Event series::KBS Seminar]][[Start::+]]<br />
| ?Start<br />
| ?Ende<br />
| ?Titel EN=title<br />
| ?Raum=Room<br />
| ?Veranstaltungsart=<br/>Type<br />
| ?Vortragender=<br/>Speaker<br />
| ?Beschreibung EN=<br/>Details<br />
| format=eventcalendar<br />
| firstday=Monday<br />
| defaultview=month<br />
| limit=1000<br />
| link=subject<br />
}}<br />
<br />
}}<!-- Closing braces for the two-column layout ("leftsidenav" at the top); DON'T DELETE THIS BY ACCIDENT. --><br />
<br />
{{#set:<br />
|Title=Research Seminar Knowledge-Based Systems<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
|Lecturer=Markus Krötzsch<br />
|Lecturer=Irina Dragoste<br />
|Modul=INF-AQUA<br />
|Modul=INF-PM-FOR<br />
|Term=WS<br />
|Year=2018<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
}}<br />
[[Kategorie:Event series]] [[Kategorie:Vorlesung]]</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Tutorial4.pdf&diff=30182Datei:Tutorial4.pdf2020-03-22T13:41:45Z<p>Irina Dragoste: Irina Dragoste lud eine neue Version von Datei:Tutorial4.pdf hoch</p>
<hr />
<div></div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Tutorial-3.pdf&diff=30180Datei:Tutorial-3.pdf2020-03-22T13:40:18Z<p>Irina Dragoste: </p>
<hr />
<div></div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Tutorial-2.pdf&diff=30178Datei:Tutorial-2.pdf2020-03-22T13:37:52Z<p>Irina Dragoste: </p>
<hr />
<div></div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:2020-kr-tutorial-proposal.pdf&diff=30177Datei:2020-kr-tutorial-proposal.pdf2020-03-22T13:35:22Z<p>Irina Dragoste: </p>
<hr />
<div></div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Tracking_False_Information_Online&diff=30135Tracking False Information Online2020-02-20T16:12:57Z<p>Irina Dragoste: </p>
<hr />
<div>{{Veranstaltung<br />
|Titel EN=Tracking False Information Online<br />
|Beschreibung EN=Digital media enables fast sharing of information and discussions among users. While this comes with many benefits to today’s society, such as broadening information access, the manner in which information is disseminated also has obvious downsides. Since fast access to information is expected by many users and news outlets are often under financial pressure, speedy access often comes at the expense of accuracy, which leads to misinformation. Moreover, digital media can be misused by campaigns to intentionally spread false information, i.e. disinformation, about events, individuals or governments. In this talk, I will present on different ways false information is spread online, including misinformation and disinformation. I will then report findings from our recent and ongoing work on automatic fact checking, stance detection and framing attitudes.<br />
|Veranstaltungsart=Vortrag<br />
|Start=2020/02/27 16:15:00<br />
|Ende=2020/02/27 17:45:00<br />
|Raum=APB 1004<br />
|Vortragender=Isabelle Augenstein<br />
|Eingeladen durch=Markus Krötzsch<br />
|Forschungsgruppe=Computational Logic, Wissensbasierte Systeme<br />
|Event series=KBS Seminar<br />
|In News anzeigen=1<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Tracking_False_Information_Online&diff=30134Tracking False Information Online2020-02-20T16:06:48Z<p>Irina Dragoste: </p>
<hr />
<div>{{Veranstaltung<br />
|Titel EN=Tracking False Information Online<br />
|Beschreibung EN=Digital media enables fast sharing of information and discussions among users. While this comes with many benefits to today’s society, such as broadening information access, the manner in which information is disseminated also has obvious downsides. Since fast access to information is expected by many users and news outlets are often under financial pressure, speedy access often comes at the expense of accuracy, which leads to misinformation. Moreover, digital media can be misused by campaigns to intentionally spread false information, i.e. disinformation, about events, individuals or governments. In this talk, I will present on different ways false information is spread online, including misinformation and disinformation. I will then report findings from our recent and ongoing work on automatic fact checking, stance detection and framing attitudes.<br />
|Veranstaltungsart=Vortrag<br />
|Start=2020/02/27 16:15:00<br />
|Ende=2020/01/27 17:45:00<br />
|Raum=APB 1004<br />
|Vortragender=Isabelle Augenstein<br />
|Eingeladen durch=Markus Krötzsch<br />
|Forschungsgruppe=Computational Logic, Wissensbasierte Systeme<br />
|Event series=KBS Seminar<br />
|In News anzeigen=1<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=A_Distributed_Blockchain_Model_of_Selfish_Mining/en&diff=30130A Distributed Blockchain Model of Selfish Mining/en2020-02-17T09:17:34Z<p>Irina Dragoste: Page created automatically by parser function on page A Distributed Blockchain Model of Selfish Mining</p>
<hr />
<div>{{Veranstaltung/en}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=A_Distributed_Blockchain_Model_of_Selfish_Mining&diff=30129A Distributed Blockchain Model of Selfish Mining2020-02-17T09:17:34Z<p>Irina Dragoste: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=A Distributed Blockchain Model of Selfish Mining |Beschreibung EN=Abstract: Bitcoin is currently still the most widely used cryptoc…“</p>
<hr />
<div>{{Veranstaltung<br />
|Titel EN=A Distributed Blockchain Model of Selfish Mining<br />
|Beschreibung EN=Abstract:<br />
Bitcoin is currently still the most widely used cryptocurrency, judging from its market cap and trade volume. A big part of Bitcoin's appeal is the mining process, which makes sure that new transactions are being validated and processed in a distributed fashion, maintaining a distributed ledger known as the blockchain. Miners receive a fee for every block of transactions that they mine, as an incentive for their computational effort. In the long run, they can expect a reward proportional to the computational power they provide to the network.<br />
However, Eyal and Sirer introduced a strategy for a miner to time the publishing of blocks that will give them a significant edge in profits. <br />
This talk will present a model for the behaviour of honest and selfish mining pools in UPPAAL, that can be used for analysing properties of the mining process in the presence of network delay, and taking into account the distributed nature of the process. The analysis shows what effects selfish mining would have on the share of profits, but also on the number of orphaned blocks in the blockchain. This analysis also allows us to compares those results to real-world data, to establish if there is evidence for the presence of selfish miners.<br />
<br />
Bio:<br />
Ansgar Fehnker is Associate Professor for Programming Education at the Faculty of Electrical Engineeering, Mathematics, and Computer Science, at the University of Twente. He is part of the Formal Methods and Tools group and has been previously professor at the University of the South Pacific and researcher at Australia's ICT research centre NICTA, working on static analysis for C/C++ and on analysis of wireless network protocols with model checking. Prior to joining NICTA he was a PostDoc in the model-checking teams at Carnegie Mellon University, US. He received his PhD from the Radboud University Nijmegen on verification of real-time and hybrid systems.<br />
|Veranstaltungsart=Vortrag<br />
|Start=2020/02/26 12:30:00<br />
|Ende=2020/02/26 14:00:00<br />
|Raum=APB 3027<br />
|Vortragender=Ansgar Fehnker<br />
|Eingeladen durch=Clemens Dubslaff<br />
|In News anzeigen=1<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Modeling_Computational_Properties_of_Description_Logics_in_ASP&diff=30083Modeling Computational Properties of Description Logics in ASP2020-01-29T09:41:56Z<p>Irina Dragoste: </p>
<hr />
<div>{{Veranstaltung<br />
|Titel EN=Modeling Computational Properties of Description Logics in ASP<br />
|Beschreibung EN=Tracking the increasing volume of research about Description logics is getting harder. Besides, those results interact together and can deduce new results. That is why we need a knowledge base to encode those results in a smart way and infer more results based on what we currently know. This talk presents an approach of how we can encode such information with the help of Answer Set Programming (ASP). In addition, we show how such a system can be integrated into a website that visualizes the current research results and the inferences made based on them. We end by analyzing this approach and suggesting some future work.<br />
|Veranstaltungsart=Vortrag<br />
|Start=2020/01/29 09:00:00<br />
|Ende=2020/01/29 10:30:00<br />
|Raum=APB 3027<br />
|Vortragender=Mohamed Ibrahim<br />
|Eingeladen durch=Markus Krötzsch<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
|Event series=KBS Seminar<br />
|In News anzeigen=1<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Modeling_Computational_Properties_of_Description_Logics_in_ASP/en&diff=30079Modeling Computational Properties of Description Logics in ASP/en2020-01-28T16:52:50Z<p>Irina Dragoste: Page created automatically by parser function on page Modeling Computational Properties of Description Logics in ASP</p>
<hr />
<div>{{Veranstaltung/en}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Modeling_Computational_Properties_of_Description_Logics_in_ASP&diff=30078Modeling Computational Properties of Description Logics in ASP2020-01-28T16:52:50Z<p>Irina Dragoste: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Modeling Computational Properties of Description Logics in ASP |Beschreibung EN=Tracking the increasing volume of research about Desc…“</p>
<hr />
<div>{{Veranstaltung<br />
|Titel EN=Modeling Computational Properties of Description Logics in ASP<br />
|Beschreibung EN=Tracking the increasing volume of research about Description logics is getting harder. Besides, those results interact together and can deduce new results. That is why we need a knowledge base to encode those results in a smart way and infer more results based on what we currently know. This talk presents an approach of how we can encode such information with the help of Answer Set Programming (ASP). In addition, we show how such a system can be integrated into a website that visualizes the current research results and the inferences made based on them. We end by analyzing this approach and suggesting some future work.<br />
|Veranstaltungsart=Vortrag<br />
|Start=2020/01/29 09:00:00<br />
|Ende=2020/01/29 10:30:00<br />
|Raum=APB 3027<br />
|Vortragender=Mohamed Ibrahim<br />
|Eingeladen durch=Markus Krötzsch<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
|In News anzeigen=1<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Tracking_False_Information_Online/en&diff=30044Tracking False Information Online/en2020-01-23T18:03:31Z<p>Irina Dragoste: Page created automatically by parser function on page Tracking False Information Online</p>
<hr />
<div>{{Veranstaltung/en}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Tracking_False_Information_Online&diff=30043Tracking False Information Online2020-01-23T18:03:31Z<p>Irina Dragoste: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Tracking False Information Online |Beschreibung EN=Digital media enables fast sharing of information and discussions among users. Whi…“</p>
<hr />
<div>{{Veranstaltung<br />
|Titel EN=Tracking False Information Online<br />
|Beschreibung EN=Digital media enables fast sharing of information and discussions among users. While this comes with many benefits to today’s society, such as broadening information access, the manner in which information is disseminated also has obvious downsides. Since fast access to information is expected by many users and news outlets are often under financial pressure, speedy access often comes at the expense of accuracy, which leads to misinformation. Moreover, digital media can be misused by campaigns to intentionally spread false information, i.e. disinformation, about events, individuals or governments. In this talk, I will present on different ways false information is spread online, including misinformation and disinformation. I will then report findings from our recent and ongoing work on automatic fact checking, stance detection and framing attitudes.<br />
|Veranstaltungsart=Vortrag<br />
|Start=2020/02/27 13:00:00<br />
|Ende=2020/01/27 14:30:00<br />
|Raum=APB 3027<br />
|Vortragender=Isabelle Augenstein<br />
|Eingeladen durch=Markus Krötzsch<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
|Event series=KBS Seminar<br />
|In News anzeigen=1<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Graph_Curation_and_Reasoning_using_the_Example_of_the_Scholarly_Domain/en&diff=30035Knowledge Graph Curation and Reasoning using the Example of the Scholarly Domain/en2020-01-23T13:41:25Z<p>Irina Dragoste: Page created automatically by parser function on page Knowledge Graph Curation and Reasoning using the Example of the Scholarly Domain</p>
<hr />
<div>{{Veranstaltung/en}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Graph_Curation_and_Reasoning_using_the_Example_of_the_Scholarly_Domain&diff=30034Knowledge Graph Curation and Reasoning using the Example of the Scholarly Domain2020-01-23T13:41:25Z<p>Irina Dragoste: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Knowledge Graph Curation and Reasoning using the Example of the Scholarly Domain |Beschreibung EN=Knowledge graphs allow organisation…“</p>
<hr />
<div>{{Veranstaltung<br />
|Titel EN=Knowledge Graph Curation and Reasoning using the Example of the Scholarly Domain<br />
|Beschreibung EN=Knowledge graphs allow organisations and enterprises to integrate their internal and external heterogeneous sources of information into a unified form and enable analytics and discovery of unknown knowledge. To exploit the information encoded in knowledge graphs, analysis of the graph structure as well as the semantics of the represented relations, is required. I will show this using the scholarly domain as an example. The heterogeneity of scholarly artifacts and their metadata spread over different Web data sources serve as a great use case platform for data analytics and reasoning methods. In this talk, I will first have a look into major challenges of this domain using KG creation and curation leveraging semantic Web technologies. I will further showcase the application of Knowledge Graph Embedding models for link prediction scenarios of this domain.<br />
|Veranstaltungsart=Vortrag<br />
|Start=2020/01/30 13:00:00<br />
|Ende=2020/01/30 14:30:00<br />
|Raum=APB 3027<br />
|Vortragender=Sahar Vahdati<br />
|Eingeladen durch=Markus Krötzsch<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
|Event series=KBS Seminar<br />
|In News anzeigen=1<br />
}}</div>Irina Dragostehttps://iccl.inf.tu-dresden.de/w/index.php?title=Musings_on_the_Semantics_of_SPARQL/en&diff=29974Musings on the Semantics of SPARQL/en2020-01-08T11:36:25Z<p>Irina Dragoste: Page created automatically by parser function on page Musings on the Semantics of SPARQL</p>
<hr />
<div>{{Veranstaltung/en}}</div>Irina Dragoste