Attribut:Beschreibung

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Unterhalb werden 20 Seiten angezeigt, auf denen für dieses Attribut ein Datenwert gespeichert wurde.
D
Databases are a key technology in computer science that brings together fascinating theoretical topics and highly relevant practical applications. The goal of this lecture is to give an extended introduction to this interesting field, with a special focus on database query languages, their expressive power, and computational complexity. The lecture will introduce the relational data model, and then discuss theoretical and practical aspects of a variety of query languages: * first-order logic as a query language and the relational algebra * conjunctive queries and their unions * navigational queries: path queries * Datalog and its relatives * query answering under database dependencies The lecture focuses on core principles that apply to many types of databases alike (relational, graph-based, semantic web). Some important query answering algorithms are presented, too, but otherwise, the details of database implementation and administration are not covered.  +
<b>Important Information:</b> The oral exam is going to take place on August 13th 2021. If you want to take the exam, please send an email to Sebastian Rudolph and Jonas Karge. <b>Announcement:</b> because of the COVID-19 pandemic, the schedule and location of this lecture have changed quite a bit. For more information have a look at the corresponding section below. ===Course Description=== Databases are a key technology in computer science that brings together fascinating theoretical topics and highly relevant practical applications. The goal of this lecture is to give an extended introduction to this interesting field, with a special focus on database query languages, their expressive power, and computational complexity. The lecture will introduce the relational data model, and then discuss theoretical and practical aspects of a variety of query languages: * first-order logic as a query language and the relational algebra * conjunctive queries and their unions * navigational queries: path queries * Datalog and its relatives * query answering under database dependencies The lecture focuses on core principles that apply to many types of databases alike (relational, graph-based, semantic web). Some important query answering algorithms are presented, too, but otherwise, the details of database implementation and administration are not covered. ===Prerequisites=== Undergraduate-level knowledge of predicate logic, regular languages, and algorithmic and computational complexity is required. The lecture will connect with other topics in the Computer Science and Computational Logic curriculum, such as relational databases, logic programming, and Semantic Web technologies – familiarity with these topics is not required to follow the lecture. ===Schedule and Location=== Because of the ongoing COVID-19 pandemic, we have decided to transform this lecture into an online course. The lecture and tutorials will be held as virtual live sessions via Zoom (lecture) and BigBlueButton (tutorials). Please use the link below: Zoom: https://tu-dresden.zoom.us/j/83224074259?pwd=QXJWR2wxZ3J1TktWYjIyV2F2T1lDUT09 Password: 5j%@cP4* The links for the exercise sessions are: With ZIH-Login: https://selfservice.zih.tu-dresden.de/l/link.php?m=139763&p=b55653ea Without ZIH-Login: https://selfservice.zih.tu-dresden.de/link.php?m=139763&p=922d5a38 ===Legacy=== This course has first been taught at TU Dresden by Prof. Dr. [[Markus Krötzsch]] in the form of the 2015 lecture [[Foundations_of_Databases_and_Query_Languages_(SS2015)/en|Foundations of Databases and Query Languages]], the 2018 lecture [[Database_Theory_(SS2018)/en|Database Theory]], and the 2019 lecture [[Database_Theory_(SS2019)/en|Database Theory]]. The plan for this year's course will be somewhat similar. The structure of some of the lectures of this course is inspired by the course ''Theory of Data and Knowledge Bases'' in the version given by [https://www.cs.ox.ac.uk/people/georg.gottlob/ Georg Gottlob] and [http://www.cs.ox.ac.uk/people/thomas.lukasiewicz/ Thomas Lukasiewicz] at the University of Oxford.  
Databases are a key technology in computer science that brings together fascinating theoretical topics and highly relevant practical applications. The goal of this lecture is to give an extended introduction to this interesting field, with a special focus on database query languages, their expressive power, and computational complexity. The lecture will introduce the relational data model, and then discuss theoretical and practical aspects of a variety of query languages: * first-order logic as a query language and the relational algebra * conjunctive queries and their unions * navigational queries: path queries * Datalog and its relatives * query answering under database dependencies The lecture focuses on core principles that apply to many types of databases alike (relational, graph-based, semantic web). Some important query answering algorithms are presented, too, but otherwise, the details of database implementation and administration are not covered. ===Prerequisites=== Undergraduate-level knowledge of predicate logic, regular languages, and algorithmic and computational complexity is required. The lecture will connect with other topics in the Computer Science and Computational Logic curriculum, such as relational databases, logic programming, and Semantic Web technologies – familiarity with these topics is not required to follow the lecture. ===Schedule and Location=== * The weekly lecture sessions will take place on Mondays from 09:20 to 10:50 in room [[APB E007]] and Tuesdays from 09:20 to 10:50 in room [[APB E005]]. * The weekly exercise session will take place on Tuesdays from 14:50 to 16:20 in room [[APB E005]]. * The first exercise session will be on Tuesday, 2022-04-12. ===Examinations=== For the oral exams, we have blocked two dates this term: * <s>Thursday, 2022-07-21</s> (fully booked) * Tuesday, 2022-08-02 As usual, you should book a date with our [mailto:secretary_wbs@mailbox.tu-dresden.de secretary] after you have officially enrolled in your respective examination office/system. ===Legacy=== This course has first been taught at TU Dresden by Prof. Dr. [[Markus Krötzsch]] in the form of the 2015 lecture [[Foundations_of_Databases_and_Query_Languages_(SS2015)/en|Foundations of Databases and Query Languages]], the 2018 lecture [[Database_Theory_(SS2018)/en|Database Theory]], and the 2019 lecture [[Database_Theory_(SS2019)/en|Database Theory]]. The plan for this year's course will be somewhat similar. The structure of some of the lectures of this course is inspired by the course ''Theory of Data and Knowledge Bases'' in the version given by [https://www.cs.ox.ac.uk/people/georg.gottlob/ Georg Gottlob] and [http://www.cs.ox.ac.uk/people/thomas.lukasiewicz/ Thomas Lukasiewicz] at the University of Oxford.  
Databases are a key technology in computer science that brings together fascinating theoretical topics and highly relevant practical applications. The goal of this lecture is to give an extended introduction to this interesting field, with a special focus on database query languages, their expressive power, and computational complexity. The lecture will introduce the relational data model, and then discuss theoretical and practical aspects of a variety of query languages: * first-order logic as a query language and the relational algebra * conjunctive queries and their unions * navigational queries: path queries * Datalog and its relatives * query answering under database dependencies The lecture focuses on core principles that apply to many types of databases alike (relational, graph-based, semantic web). Some important query answering algorithms are presented, too, but otherwise, the details of database implementation and administration are not covered. ===Prerequisites=== Undergraduate-level knowledge of predicate logic, regular languages, and algorithmic and computational complexity is required. The lecture will connect with other topics in the Computer Science and Computational Logic curriculum, such as relational databases, logic programming, and Semantic Web technologies – familiarity with these topics is not required to follow the lecture. ===Schedule and Location=== * The weekly lecture sessions will take place on Mondays from 09:20 to 10:50 in room [[APB E007]] and Tuesdays from 09:20 to 10:50 in room [[APB E005]]. * The weekly exercise session will take place on Tuesdays from 14:50 to 16:20 in room [[APB E005]]. * The first exercise session will be on Tuesday, 2023-04-11. * '''Room change:''' the '''first lecture on Monday, 2023-04-03, takes place in [[APB 3027]].''' * '''Room change:''' the '''second lecture on Tuesday, 2023-04-04, takes place in [[APB E009]].''' ===Examinations=== For the oral exams, we have blocked two dates this term: * Monday, 2023-07-17 * Friday, 2023-07-28 As usual, you should book a date with our [mailto:secretary_wbs@mailbox.tu-dresden.de secretary] after you have officially enrolled in your respective examination office/system. ===Legacy=== This course has first been taught at TU Dresden by Prof. Dr. [[Markus Krötzsch]] in the form of the 2015 lecture [[Foundations_of_Databases_and_Query_Languages_(SS2015)/en|Foundations of Databases and Query Languages]], the 2018 lecture [[Database_Theory_(SS2018)/en|Database Theory]], and the 2019 lecture [[Database_Theory_(SS2019)/en|Database Theory]]. The plan for this year's course will be somewhat similar. The structure of some of the lectures of this course is inspired by the course ''Theory of Data and Knowledge Bases'' in the version given by [https://www.cs.ox.ac.uk/people/georg.gottlob/ Georg Gottlob] and [http://www.cs.ox.ac.uk/people/thomas.lukasiewicz/ Thomas Lukasiewicz] at the University of Oxford.  
Databases are a key technology in computer science that brings together fascinating theoretical topics and highly relevant practical applications. The goal of this lecture is to give an extended introduction to this interesting field, with a special focus on database query languages, their expressive power, and computational complexity. The lecture will introduce the relational data model, and then discuss theoretical and practical aspects of a variety of query languages: * first-order logic as a query language and the relational algebra * conjunctive queries and their unions * navigational queries: path queries * Datalog and its relatives * query answering under database dependencies The lecture focuses on core principles that apply to many types of databases alike (relational, graph-based, semantic web). Some important query answering algorithms are presented, too, but otherwise, the details of database implementation and administration are not covered. ===Prerequisites=== Undergraduate-level knowledge of predicate logic, regular languages, and algorithmic and computational complexity is required. The lecture will connect with other topics in the Computer Science and Computational Logic curriculum, such as relational databases, logic programming, and Semantic Web technologies – familiarity with these topics is not required to follow the lecture. ===Schedule and Location=== * The weekly lecture sessions will take place on Mondays from 09:20 to 10:50 in room [[APB E007]] and Tuesdays from 09:20 to 10:50 in room [[APB E005]]. * The weekly exercise session will take place on Tuesdays from 14:50 to 16:20 in room [[APB E005]]. * The first exercise session will be on Tuesday, 2025-04-15. ===Examinations=== Dates for oral exams will be announced in due time. As usual, you should book a date with our [mailto:secretary_wbs@mailbox.tu-dresden.de secretary] after you have officially enrolled in your respective examination office/system. ===Legacy=== This course has first been taught at TU Dresden by Prof. Dr. [[Markus Krötzsch]] in the form of the 2015 lecture [[Foundations_of_Databases_and_Query_Languages_(SS2015)/en|Foundations of Databases and Query Languages]], and later in the [[Database_Theory/en|Database Theory]] lecture series. The plan for this year's course will be somewhat similar. The structure of some of the lectures of this course is inspired by the course ''Theory of Data and Knowledge Bases'' in the version given by [https://www.cs.ox.ac.uk/people/georg.gottlob/ Georg Gottlob] and [http://www.cs.ox.ac.uk/people/thomas.lukasiewicz/ Thomas Lukasiewicz] at the University of Oxford.  
Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.  +
Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.  +
Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.  +
Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.  +
Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.  +
== Update == * For the tutorials (and maybe other live-/interactive sessions we will use the Jitsi session: https://jitsi.tu-dresden.de/DeductionSystems * More exercises online! <span style="color:red;">Due to the current COVID19 situation, this course will be held virtually until further notice. The content of the lecture will be made available as videos (i.e. slideshows with audio comments). The first upload will be within the first semester week (i.e. before easter). The format of the tutorials will be announced here shortly. </span> <span style="color:red;"> Students interested in participating in the lecture please register via: <br> https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23143514207 </span> <p style="font-family: MarketWeb,Yellowtail,'Comic Sans MS',sans-serif; font-weight: 400; font-size: 3rem;" >This is another paragraph.</p> Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.  +
Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.  +
http://lat.inf.tu-dresden.de/teaching/ws2016-2017/DL/  +
http://lat.inf.tu-dresden.de/teaching/ws2015-2016/DL/  +
http://lat.inf.tu-dresden.de/teaching/ws2014-2015/DL/  +
https://lat.inf.tu-dresden.de/teaching/ws2017-2018/DL/  +
Intelligent behavior usually depends on the availability of appropriate domain knowledge and the ability to draw inferences from this knowledge and observed facts. For this reason, knowledge representation and reasoning is a key subarea of Artificial Intelligence. Description Logics (DLs) are a well-investigated family of logic-based knowledge representation languages, which are frequently used to formalize ontologies for application domains such as the Semantic Web, biology and medicine, and engineering domains. The course introduces syntax and semantics of DLs as well as the relevant inference problems. It then investigates model-theoretic properties (like finite-model-property, tree-model-property, and bisimulation invariance) and computational properties (like decidablility and complexity of reasoning) both for expressive and inexpressive members of the DL family of knowledge representation languages. It also shows up a connection between query answering in databases and reasoning in DLs. More information can be found [https://tu-dresden.de/ing/informatik/thi/lat/studium/lehrveranstaltungen/sommersemester-2021/description-logic here].  +
Intelligent behavior usually depends on the availability of appropriate domain knowledge and the ability to draw inferences from this knowledge and observed facts. For this reason, knowledge representation and reasoning is a key subarea of Artificial Intelligence. Description Logics (DLs) are a well-investigated family of logic-based knowledge representation languages, which are frequently used to formalize ontologies for application domains such as the Semantic Web, biology and medicine, and engineering domains. The course introduces syntax and semantics of DLs as well as the relevant inference problems. It then investigates model-theoretic properties (like finite-model-property, tree-model-property, and bisimulation invariance) and computational properties (like decidablility and complexity of reasoning) both for expressive and inexpressive members of the DL family of knowledge representation languages. It also shows up a connection between query answering in databases and reasoning in DLs. More information can be found [https://tu-dresden.de/ing/informatik/thi/lat/studium/lehrveranstaltungen/summer-semester-2022/description-logic here].  +
E
https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/29817831428  +