International Center for Computational Logic - Benutzerbeiträge [de]

Ana Ozaki

2018-03-05T08:41:44Z

Ana Ozaki:

{{Mitarbeiter
|Vorname=Ana
|Nachname=Ozaki
|Akademischer Titel=Dr.
|Forschungsgruppe=Wissensbasierte Systeme
|Stellung=Wissenschaftliche Mitarbeiterin
|Ehemaliger=0
|Telefon=+49 351 463 38053
|Email=Ana.Ozaki@tu-dresden.de
|Raum=APB 3031
|Bild=Servletrecuperafoto.jpeg
|Info=My new webpage is https://sites.google.com/site/anaozaki. 

Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award at ALT 2015

Distinguished Paper at ISWC 2017

Reviewing

PC membership

- 27th International Joint Conference on Artificial Intelligence (IJCAI 2018)

Journals

- Journal of Computer and System Sciences

- Journal of Machine Learning Research
|Info EN=My new webpage is https://sites.google.com/site/anaozaki. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award at ALT 2015

Distinguished Paper at ISWC 2017

Reviewing

PC membership

- 27th International Joint Conference on Artificial Intelligence (IJCAI 2018)

Journals

- Journal of Computer and System Sciences

- Journal of Machine Learning Research
|DBLP=http://dblp.uni-trier.de/pers/hd/o/Ozaki:Ana
|Google Scholar=https://scholar.google.com/citations?user=OLUiO4kAAAAJ&hl=en&oi=ao
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}

Ana Ozaki

2018-03-05T08:39:53Z

Ana Ozaki:

{{Mitarbeiter
|Vorname=Ana
|Nachname=Ozaki
|Akademischer Titel=Dr.
|Forschungsgruppe=Wissensbasierte Systeme
|Stellung=Wissenschaftliche Mitarbeiterin
|Ehemaliger=0
|Telefon=+49 351 463 38053
|Email=Ana.Ozaki@tu-dresden.de
|Raum=APB 3031
|Bild=Servletrecuperafoto.jpeg
|Info=My new webpage is https://sites.google.com/site/anaozaki.
I am a postdoctoral researcher at TU Dresden. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award at ALT 2015

Distinguished Paper at ISWC 2017

Reviewing

PC membership

- 27th International Joint Conference on Artificial Intelligence (IJCAI 2018)

Journals

- Journal of Computer and System Sciences

- Journal of Machine Learning Research
|Info EN=My new webpage is https://sites.google.com/site/anaozaki.
I am a postdoctoral researcher at TU Dresden. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award at ALT 2015

Distinguished Paper at ISWC 2017

Reviewing

PC membership

- 27th International Joint Conference on Artificial Intelligence (IJCAI 2018)

Journals

- Journal of Computer and System Sciences

- Journal of Machine Learning Research
|DBLP=http://dblp.uni-trier.de/pers/hd/o/Ozaki:Ana
|Google Scholar=https://scholar.google.com/citations?user=OLUiO4kAAAAJ&hl=en&oi=ao
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}

Datei:Seminar.pdf

2018-03-05T08:29:44Z

Ana Ozaki:

Article3034

2018-03-05T08:04:50Z

Ana Ozaki:

{{Publikation Erster Autor
|ErsterAutorVorname=Montserrat
|ErsterAutorNachname=Hermo
|FurtherAuthors=Ana Ozaki
}}
{{Article
|Referiert=1
|Title=Exact Learning of Multivalued Dependency Formulas
|To appear=0
|Year=2017
|Month=Dezember
|Journal=Theoretical Computer Science
}}
{{Publikation Details
|Abstract=The transformation of a relational database schema into fourth normal form, which minimizes data redundancy, relies on the correct identification of multivalued dependencies. In this work, we study the learnability of multivalued
dependency formulas (MVDF), which correspond to the logical theory behind multivalued dependencies. As we explain, MVDF lies between propositional Horn and 2-Quasi-Horn. We prove that MVDF is polynomially learnable in Angluin et al.’s exact learning model with membership and equivalence queries, provided that counterexamples and membership queries are formulated as 2-Quasi-Horn clauses. As a consequence, we obtain that the subclass of 2-Quasi-Horn theories which are equivalent to MVDF is polynomially learnable.
|Link=https://www.sciencedirect.com/science/article/pii/S0304397517308484?via%3Dihub
|DOI Name=https://doi.org/10.1016/j.tcs.2017.11.018
|Projekt=Cfaed
|Forschungsgruppe=Wissensbasierte Systeme
}}

Aktivitaet2055/en

2018-02-27T08:51:59Z

Ana Ozaki: Page created automatically by parser function on page Aktivitaet2055

#REDIRECT [[Aktivitaet2055]]

Aktivitaet2055

2018-02-27T08:51:58Z

Ana Ozaki: Die Seite wurde neu angelegt: „{{Aktivität |Beschreibung DE= Mitglied des Programmkomitees der 27. International Joint Conference on Artificial Intelligence (IJCAI-ECAI 2018) |Beschreibung…“

{{Aktivität
|Beschreibung DE=
Mitglied des Programmkomitees der 27. International Joint Conference on Artificial Intelligence (IJCAI-ECAI 2018)
|Beschreibung EN=PC Member: 27th International Joint Conference on Artificial Intelligence (IJCAI 2018)
|Person=Ana Ozaki
|Start(Jahr)=2018
|Ende(Jahr)=andauernd
|Rank=★
}}

Aktivitaet2054/en

2018-02-27T08:51:38Z

Ana Ozaki: Page created automatically by parser function on page Aktivitaet2054

#REDIRECT [[Aktivitaet2054]]

Aktivitaet2054

2018-02-27T08:51:38Z

Ana Ozaki

2018-02-12T20:39:09Z

Ana Ozaki:

{{Mitarbeiter
|Vorname=Ana
|Nachname=Ozaki
|Akademischer Titel=Dr.
|Forschungsgruppe=Wissensbasierte Systeme
|Stellung=Wissenschaftliche Mitarbeiterin
|Ehemaliger=0
|Telefon=+49 351 463 38053
|Email=Ana.Ozaki@tu-dresden.de
|Raum=APB 3031
|Bild=Servletrecuperafoto.jpeg
|Info=I am a postdoctoral researcher at TU Dresden. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award at ALT 2015

Distinguished Paper at ISWC 2017

Reviewing

PC membership

- 27th International Joint Conference on Artificial Intelligence (IJCAI 2018)

Journals

- Journal of Computer and System Sciences

- Journal of Machine Learning Research
|Info EN=I am a postdoctoral researcher at TU Dresden. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award at ALT 2015

Distinguished Paper at ISWC 2017

Reviewing

PC membership

- 27th International Joint Conference on Artificial Intelligence (IJCAI 2018)

Journals

- Journal of Computer and System Sciences

- Journal of Machine Learning Research
|DBLP=http://dblp.uni-trier.de/pers/hd/o/Ozaki:Ana
|Google Scholar=https://scholar.google.com/citations?user=OLUiO4kAAAAJ&hl=en&oi=ao
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}

Ana Ozaki

2018-01-16T14:48:38Z

Ana Ozaki:

{{Mitarbeiter
|Vorname=Ana
|Nachname=Ozaki
|Akademischer Titel=Dr.
|Forschungsgruppe=Wissensbasierte Systeme
|Stellung=Wissenschaftliche Mitarbeiterin
|Ehemaliger=0
|Telefon=+49 351 463 38053
|Email=Ana.Ozaki@tu-dresden.de
|Raum=APB 3031
|Bild=Servletrecuperafoto.jpeg
|Info=I am a postdoctoral researcher at TU Dresden. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award at ALT 2015

Distinguished Paper at ISWC 2017

Reviewing

PC membership

- 27th International Joint Conference on Artificial Intelligence (IJCAI 2018)

Journals

- Journal of Computer and System Sciences
|Info EN=I am a postdoctoral researcher at TU Dresden. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award at ALT 2015

Distinguished Paper at ISWC 2017

Reviewing

PC membership

- 27th International Joint Conference on Artificial Intelligence (IJCAI 2018)

Journals

- Journal of Computer and System Sciences
|DBLP=http://dblp.uni-trier.de/pers/hd/o/Ozaki:Ana
|Google Scholar=https://scholar.google.com/citations?user=OLUiO4kAAAAJ&hl=en&oi=ao
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}

Ana Ozaki

2018-01-14T16:33:25Z

Ana Ozaki:

{{Mitarbeiter
|Vorname=Ana
|Nachname=Ozaki
|Akademischer Titel=Dr.
|Forschungsgruppe=Wissensbasierte Systeme
|Stellung=Wissenschaftliche Mitarbeiterin
|Ehemaliger=0
|Telefon=+49 351 463 38314
|Email=Ana.Ozaki@tu-dresden.de
|Raum=APB 3031
|Bild=Servletrecuperafoto.jpeg
|Info=I am a postdoctoral researcher at TU Dresden. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award at ALT 2015

Distinguished Paper at ISWC 2017

Reviewing

PC membership

- 27th International Joint Conference on Artificial Intelligence (IJCAI 2018)

Journals

- Journal of Computer and System Sciences
|Info EN=I am a postdoctoral researcher at TU Dresden. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award at ALT 2015

Distinguished Paper at ISWC 2017

Reviewing

PC membership

- 27th International Joint Conference on Artificial Intelligence (IJCAI 2018)

Journals

- Journal of Computer and System Sciences
|DBLP=http://dblp.uni-trier.de/pers/hd/o/Ozaki:Ana
|Google Scholar=https://scholar.google.com/citations?user=OLUiO4kAAAAJ&hl=en&oi=ao
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}

Article3034

2018-01-14T16:25:21Z

Ana Ozaki:

{{Publikation Erster Autor
|ErsterAutorVorname=Montserrat
|ErsterAutorNachname=Hermo
|FurtherAuthors=Ana Ozaki
}}
{{Article
|Referiert=1
|Title=Exact Learning of Multivalued Dependency Formulas
|To appear=0
|Year=2017
|Month=Dezember
|Journal=Theoretical Computer Science
}}
{{Publikation Details
|Abstract=The transformation of a relational database schema into fourth normal form, which minimizes data redundancy, relies on the correct identification of multivalued dependencies. In this work, we study the learnability of multivalued
dependency formulas (MVDF), which correspond to the logical theory behind multivalued dependencies. As we explain, MVDF lies between propositional Horn and 2-Quasi-Horn. We prove that MVDF is polynomially learnable in Angluin et al.’s exact learning model with membership and equivalence queries, provided that counterexamples and membership queries are formulated as 2-Quasi-Horn clauses. As a consequence, we obtain that the subclass of 2-Quasi-Horn theories which are equivalent to MVDF is polynomially learnable.
|DOI Name=https://doi.org/10.1016/j.tcs.2017.11.018
|Projekt=Cfaed
|Forschungsgruppe=Wissensbasierte Systeme
}}

Article3045/en

2018-01-14T16:23:27Z

Ana Ozaki: Page created automatically by parser function on page Article3045

#REDIRECT [[Article3045]]

Article3045

2018-01-14T16:23:27Z

Ana Ozaki: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Boris |ErsterAutorNachname=Konev |FurtherAuthors=Carsten Lutz; Ana Ozaki; Frank Wolter; }} {{Article |Referier…“

{{Publikation Erster Autor
|ErsterAutorVorname=Boris
|ErsterAutorNachname=Konev
|FurtherAuthors=Carsten Lutz; Ana Ozaki; Frank Wolter;
}}
{{Article
|Referiert=1
|Title=Exact Learning of Lightweight Description Logic Ontologies
|To appear=1
|Year=2018
|Journal=Journal of Machine Learning Research
}}
{{Publikation Details
|Abstract=We study the problem of learning description logic (DL) ontologies in Angluin et al.’s framework of exact learning via queries. We admit membership queries (“is a given subsumption entailed by the target ontology?”) and equivalence queries (“is a given ontology equivalent to the target ontology?”). We present three main results: (1) ontologies formulated in (two relevant versions of) the description logic DL-Lite can be learned with polynomially
many queries of polynomial size; (2) this is not the case for ontologies formulated in the description logic EL, even when only acyclic ontologies are admitted; and (3) ontologies formulated in a fragment of EL related to the web ontology language OWL 2 RL can be learned in polynomial time. We also show that neither membership nor equivalence queries alone are sufficient in cases (1) and (3).
|Download=1709.07314.pdf
|Projekt=Cfaed
|Forschungsgruppe=Wissensbasierte Systeme
}}

Datei:1709.07314.pdf

2018-01-14T16:21:45Z

Ana Ozaki:

Article3034

2017-12-02T11:26:45Z

Ana Ozaki:

{{Publikation Erster Autor
|ErsterAutorVorname=Montserrat
|ErsterAutorNachname=Hermo
|FurtherAuthors=Ana Ozaki
}}
{{Article
|Referiert=0
|Title=Exact Learning of Multivalued Dependency Formulas
|To appear=0
|Year=2017
|Month=Dezember
|Journal=Theoretical Computer Science
}}
{{Publikation Details
|Abstract=The transformation of a relational database schema into fourth normal form, which minimizes data redundancy, relies on the correct identification of multivalued dependencies. In this work, we study the learnability of multivalued
dependency formulas (MVDF), which correspond to the logical theory behind multivalued dependencies. As we explain, MVDF lies between propositional Horn and 2-Quasi-Horn. We prove that MVDF is polynomially learnable in Angluin et al.’s exact learning model with membership and equivalence queries, provided that counterexamples and membership queries are formulated as 2-Quasi-Horn clauses. As a consequence, we obtain that the subclass of 2-Quasi-Horn theories which are equivalent to MVDF is polynomially learnable.
|DOI Name=https://doi.org/10.1016/j.tcs.2017.11.018
|Projekt=Cfaed
|Forschungsgruppe=Wissensbasierte Systeme
}}

Article3034

2017-11-28T16:00:25Z

Ana Ozaki:

{{Publikation Erster Autor
|ErsterAutorVorname=Montserrat
|ErsterAutorNachname=Hermo
|FurtherAuthors=Ana Ozaki
}}
{{Article
|Referiert=0
|Title=Exact Learning of Multivalued Dependency Formulas
|To appear=1
|Year=2017
|Journal=Theoretical Computer Science
}}
{{Publikation Details
|Abstract=The transformation of a relational database schema into fourth normal form, which minimizes data redundancy, relies on the correct identification of multivalued dependencies. In this work, we study the learnability of multivalued
dependency formulas (MVDF), which correspond to the logical theory behind multivalued dependencies. As we explain, MVDF lies between propositional Horn and 2-Quasi-Horn. We prove that MVDF is polynomially learnable in Angluin et al.’s exact learning model with membership and equivalence queries, provided that counterexamples and membership queries are formulated as 2-Quasi-Horn clauses. As a consequence, we obtain that the subclass of 2-Quasi-Horn theories which are equivalent to MVDF is polynomially learnable.
|Forschungsgruppe=Wissensbasierte Systeme
}}

Ana Ozaki

2017-11-28T15:56:44Z

Ana Ozaki:

{{Mitarbeiter
|Vorname=Ana
|Nachname=Ozaki
|Akademischer Titel=Dr.
|Forschungsgruppe=Wissensbasierte Systeme
|Stellung=Wissenschaftliche Mitarbeiterin
|Ehemaliger=0
|Telefon=+49 351 463 38314
|Email=Ana.Ozaki@tu-dresden.de
|Raum=APB 3031
|Bild=Servletrecuperafoto.jpeg
|Info=I am a postdoctoral researcher at TU Dresden. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award at ALT 2015

Distinguished Paper at ISWC 2017

Reviewing

PC-member IJCAI 2018
|Info EN=I am a postdoctoral researcher at TU Dresden. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award at ALT 2015

Distinguished Paper at ISWC 2017

Reviewing

PC-member IJCAI 2018
|DBLP=http://dblp.uni-trier.de/pers/hd/o/Ozaki:Ana
|Google Scholar=https://scholar.google.com/citations?user=OLUiO4kAAAAJ&hl=en&oi=ao
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}

Ana Ozaki

2017-11-28T15:50:06Z

Ana Ozaki:

Ana Ozaki

2017-10-18T17:44:40Z

Ana Ozaki:

{{Mitarbeiter
|Vorname=Ana
|Nachname=Ozaki
|Akademischer Titel=Dr.
|Forschungsgruppe=Wissensbasierte Systeme
|Stellung=Wissenschaftliche Mitarbeiterin
|Ehemaliger=0
|Telefon=+49 351 463 38314
|Email=Ana.Ozaki@tu-dresden.de
|Raum=APB 3031
|Bild=Servletrecuperafoto.jpeg
|Info=I am a postdoctoral researcher at TU Dresden. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award in Algorithmic Learning Theory 2015
|Info EN=Welcome to my web page. I did my PhD at the University of Liverpool, with the supervision of Prof Frank Wolter and Prof Boris Konev. We investigated the complexity of learning description logic ontologies within the exact learning model. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award in Algorithmic Learning Theory 2015
|DBLP=http://dblp.uni-trier.de/pers/hd/o/Ozaki:Ana
|Google Scholar=https://scholar.google.com/citations?user=OLUiO4kAAAAJ&hl=en&oi=ao
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}

Inproceedings3157

2017-07-16T14:11:57Z

Ana Ozaki:

{{Publikation Erster Autor
|ErsterAutorVorname=Franz
|ErsterAutorNachname=Baader
|FurtherAuthors=Stefan Borgwardt; Patrick Koopmann; Ana Ozaki; Veronika Thost
}}
{{Inproceedings
|Referiert=1
|Title=Metric Temporal Description Logics with Interval-Rigid Names
|To appear=1
|Year=2017
|Booktitle=Proceedings of the 11th International Symposium on Frontiers of Combining Systems (FroCoS'17)
}}
{{Publikation Details
|Download=BaBoKoOzTh-FroCoS17.pdf
|Projekt=Cfaed, HAEC, HAEC B02
|Forschungsgruppe=Automatentheorie, Wissensbasierte Systeme
}}

Inproceedings3157

2017-07-16T14:10:52Z

Ana Ozaki:

{{Publikation Erster Autor
|ErsterAutorVorname=Franz
|ErsterAutorNachname=Baader
|FurtherAuthors=Stefan Borgwardt; Patrick Koopmann; Ana Ozaki; Veronika Thost
}}
{{Inproceedings
|Referiert=1
|Title=Metric Temporal Description Logics with Interval-Rigid Names
|To appear=1
|Year=2017
|Booktitle=Proceedings of the 11th International Symposium on Frontiers of Combining Systems (FroCoS'17)
}}
{{Publikation Details
|Download=BaBoKoOzTh-FroCoS17.pdf
|Projekt=Cfaed
|Forschungsgruppe=Automatentheorie, Wissensbasierte Systeme
}}

Inproceedings3148/en

2017-06-02T10:51:53Z

Ana Ozaki: Page created automatically by parser function on page Inproceedings3148

#REDIRECT [[Inproceedings3148]]

Inproceedings3148

2017-06-02T10:51:52Z

Ana Ozaki: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Ullrich |ErsterAutorNachname=Hustadt |FurtherAuthors=Ana Ozaki; Clare Dixon }} {{Inproceedings |Referiert=1 |Ti…“

{{Publikation Erster Autor
|ErsterAutorVorname=Ullrich
|ErsterAutorNachname=Hustadt
|FurtherAuthors=Ana Ozaki; Clare Dixon
}}
{{Inproceedings
|Referiert=1
|Title=Theorem Proving for Metric Temporal Logic over the Naturals
|To appear=1
|Year=2017
|Month=August
|Booktitle=Conference on Automated Deduction
|Publisher=Springer
}}
{{Publikation Details
|Bild=Cade2017mtlcameraready.pdf
|Abstract=We study translations from Metric Temporal Logic (MTL) over the natural numbers to Linear Temporal Logic (LTL). In particular, we present two approaches for translating from MTL to LTL which preserve the ExpSpace complexity of the satisfiability problem for MTL. In each of these approaches we consider the case where the mapping between states and time points is given by (1) a strict monotonic function and by (2) a non-strict monotonic function (which allows multiple states to be mapped to the same time point). Our translations allow us to
utilise LTL solvers to solve satisfiability and we empirically compare the translations, showing in which cases one performs better than the other.
|Download=Cade2017mtlcameraready .pdf
|Projekt=Cfaed
|Forschungsgruppe=Wissensbasierte Systeme
}}
Web page with our implementation: http://cgi.csc.liv.ac.uk/~ullrich/MTL/

Datei:Cade2017mtlcameraready .pdf

2017-06-02T10:48:11Z

Ana Ozaki:

Datei:Cade2017mtlcameraready.pdf

2017-06-02T10:46:27Z

Ana Ozaki:

Article3035/en

2017-02-23T20:20:25Z

Ana Ozaki: Page created automatically by parser function on page Article3035

#REDIRECT [[Article3035]]

Datei:Ourmvdjournal.pdf

2017-02-23T20:14:58Z

Ana Ozaki: Ana Ozaki lud eine neue Version von „Datei:Ourmvdjournal.pdf“ hoch

Datei:Ourmvdjournal.pdf

2017-02-23T20:14:51Z

Ana Ozaki:

Article3034/en

2017-02-23T18:46:24Z

Ana Ozaki: Page created automatically by parser function on page Article3034

#REDIRECT [[Article3034]]

Article3034

2017-02-23T18:46:24Z

Ana Ozaki: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Montserrat |ErsterAutorNachname=Hermo |FurtherAuthors=Ana Ozaki }} {{Article |Referiert=0 |Title=Exact Learning…“

{{Publikation Erster Autor
|ErsterAutorVorname=Montserrat
|ErsterAutorNachname=Hermo
|FurtherAuthors=Ana Ozaki
}}
{{Article
|Referiert=0
|Title=Exact Learning of Multivalued Dependency Formulas
|To appear=1
|Year=2017
|Journal=Special Issue of ALT 2015 in the journal Theoretical Computer Science
}}
{{Publikation Details
|Abstract=The transformation of a relational database schema into fourth normal form, which minimizes data redundancy, relies on the correct identification of multivalued dependencies. In this work, we study the learnability of multivalued
dependency formulas (MVDF), which correspond to the logical theory behind multivalued dependencies. As we explain, MVDF lies between propositional Horn and 2-Quasi-Horn. We prove that MVDF is polynomially learnable in Angluin et al.’s exact learning model with membership and equivalence queries, provided that counterexamples and membership queries are formulated as 2-Quasi-Horn clauses. As a consequence, we obtain that the subclass of 2-Quasi-Horn theories which are equivalent to MVDF is polynomially learnable.
|Forschungsgruppe=Wissensbasierte Systeme
}}

Techreport3030/en

2017-02-23T18:38:40Z

Ana Ozaki: Page created automatically by parser function on page Techreport3030

#REDIRECT [[Techreport3030]]

Datei:Ourmvdfjournal.pdf

2017-02-23T18:34:43Z

Ana Ozaki:

Ana Ozaki

2017-01-04T15:22:22Z

Ana Ozaki:

{{Mitarbeiter
|Vorname=Ana
|Nachname=Ozaki
|Akademischer Titel=Dr.
|Forschungsgruppe=Wissensbasierte Systeme
|Stellung=Wissenschaftliche Mitarbeiterin
|Ehemaliger=0
|Telefon=+49 351 463 38314
|Email=Ana.Ozaki@tu-dresden.de
|Raum=APB 3031
|Bild=Servletrecuperafoto.jpeg
|Info=Welcome to my web page. I did my PhD at the University of Liverpool, with the supervision of Prof Frank Wolter and Prof Boris Konev. We investigated the complexity of learning description logic ontologies within the exact learning model. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award in Algorithmic Learning Theory 2015
|Info EN=Welcome to my web page. I did my PhD at the University of Liverpool, with the supervision of Prof Frank Wolter and Prof Boris Konev. We investigated the complexity of learning description logic ontologies within the exact learning model. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award in Algorithmic Learning Theory 2015
|DBLP=http://dblp.uni-trier.de/pers/hd/o/Ozaki:Ana
|Google Scholar=https://scholar.google.com/citations?user=OLUiO4kAAAAJ&hl=en&oi=ao
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}

Ana Ozaki

2017-01-04T15:21:38Z

Ana Ozaki:

{{Mitarbeiter
|Vorname=Ana
|Nachname=Ozaki
|Akademischer Titel=Dr.
|Forschungsgruppe=Wissensbasierte Systeme
|Stellung=Wissenschaftliche Mitarbeiterin
|Ehemaliger=0
|Telefon=38314
|Email=Ana.Ozaki@tu-dresden.de
|Raum=APB 3031
|Bild=Servletrecuperafoto.jpeg
|Info=Welcome to my web page. I did my PhD at the University of Liverpool, with the supervision of Prof Frank Wolter and Prof Boris Konev. We investigated the complexity of learning description logic ontologies within the exact learning model. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award in Algorithmic Learning Theory 2015
|Info EN=Welcome to my web page. I did my PhD at the University of Liverpool, with the supervision of Prof Frank Wolter and Prof Boris Konev. We investigated the complexity of learning description logic ontologies within the exact learning model. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award in Algorithmic Learning Theory 2015
|DBLP=http://dblp.uni-trier.de/pers/hd/o/Ozaki:Ana
|Google Scholar=https://scholar.google.com/citations?user=OLUiO4kAAAAJ&hl=en&oi=ao
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}

Ana Ozaki

2017-01-04T15:19:03Z

Ana Ozaki:

{{Mitarbeiter
|Vorname=Ana
|Nachname=Ozaki
|Akademischer Titel=Dr.
|Forschungsgruppe=Wissensbasierte Systeme
|Stellung=Wissenschaftliche Mitarbeiterin
|Ehemaliger=0
|Telefon=38314
|Email=Ana.Ozaki(at)tu-dresden.de
|Raum=APB 3031
|Bild=Servletrecuperafoto.jpeg
|Info=Welcome to my web page. I did my PhD at the University of Liverpool, with the supervision of Prof Frank Wolter and Prof Boris Konev. We investigated the complexity of learning description logic ontologies within the exact learning model. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award in Algorithmic Learning Theory 2015
|Info EN=Welcome to my web page. I did my PhD at the University of Liverpool, with the supervision of Prof Frank Wolter and Prof Boris Konev. We investigated the complexity of learning description logic ontologies within the exact learning model. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award in Algorithmic Learning Theory 2015
|DBLP=http://dblp.uni-trier.de/pers/hd/o/Ozaki:Ana
|Google Scholar=https://scholar.google.com/citations?user=OLUiO4kAAAAJ&hl=en&oi=ao
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}

Ana Ozaki

2017-01-04T15:18:28Z

Ana Ozaki:

{{Mitarbeiter
|Vorname=Ana
|Nachname=Ozaki
|Akademischer Titel=Dr
|Forschungsgruppe=Wissensbasierte Systeme
|Stellung=Wissenschaftliche Mitarbeiterin
|Ehemaliger=0
|Telefon=38314
|Email=Ana.Ozaki(at)tu-dresden.de
|Raum=APB 3031
|Bild=Servletrecuperafoto.jpeg
|Info=Welcome to my web page. I did my PhD at the University of Liverpool, with the supervision of Prof Frank Wolter and Prof Boris Konev. We investigated the complexity of learning description logic ontologies within the exact learning model. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award in Algorithmic Learning Theory 2015
|Info EN=Welcome to my web page. I did my PhD at the University of Liverpool, with the supervision of Prof Frank Wolter and Prof Boris Konev. We investigated the complexity of learning description logic ontologies within the exact learning model. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award in Algorithmic Learning Theory 2015
|DBLP=http://dblp.uni-trier.de/pers/hd/o/Ozaki:Ana
|Google Scholar=https://scholar.google.com/citations?user=OLUiO4kAAAAJ&hl=en&oi=ao
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}

Ana Ozaki

2017-01-04T15:17:10Z

Ana Ozaki:

{{Mitarbeiter
|Vorname=Ana
|Nachname=Ozaki
|Forschungsgruppe=Wissensbasierte Systeme
|Stellung=Wissenschaftliche Mitarbeiterin
|Ehemaliger=0
|Telefon=38314
|Email=Ana.Ozaki(at)tu-dresden.de
|Raum=APB 3031
|Bild=Servletrecuperafoto.jpeg
|Info=Welcome to my web page. I did my PhD at the University of Liverpool, with the supervision of Prof Frank Wolter and Prof Boris Konev. We investigated the complexity of learning description logic ontologies within the exact learning model. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award in Algorithmic Learning Theory 2015
|Info EN=Welcome to my web page. I did my PhD at the University of Liverpool, with the supervision of Prof Frank Wolter and Prof Boris Konev. We investigated the complexity of learning description logic ontologies within the exact learning model. 
Topics of interest

: Temporal and Description Logics 
: Computational Learning Theory

Awards

E.M. Gold Award in Algorithmic Learning Theory 2015
|DBLP=http://dblp.uni-trier.de/pers/hd/o/Ozaki:Ana
|Google Scholar=https://scholar.google.com/citations?user=OLUiO4kAAAAJ&hl=en&oi=ao
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}

Inproceedings3111

2016-11-14T12:17:49Z

Ana Ozaki:

{{Publikation Erster Autor
|ErsterAutorVorname=Boris
|ErsterAutorNachname=Konev
|FurtherAuthors=Carsten Lutz; Ana Ozaki; Frank Wolter
}}
{{Inproceedings
|Referiert=1
|Title=Exact Learning of Lightweight Description Logic Ontologies
|To appear=0
|Year=2014
|Month=Juli
|Booktitle=Principles of Knowledge Representation and Reasoning
|Publisher=AAAI Press
}}
{{Publikation Details
|Abstract=We study learning of description logic TBoxes in Angluin et al.’s framework of exact learning via queries. We admit entailment queries (“is a given subsumption entailed by the target TBox?”) and equivalence queries (“is a given TBox equivalent to the target TBox?”), assuming that the signature and logic of the target TBox are known. We present three main results: (1) TBoxes formulated in DL-Lite with role inclusions and ELI concepts on the right-hand side of concept inclusions can be learned in polynomial time; (2) EL TBoxes with only concept names on the right-hand side of concept inclusions can be learned in polynomial time; and (3) EL TBoxes cannot be learned in polynomial time. It follows that non-polynomial time learnability of EL TBoxes is caused by the interaction between existential restrictions on the right- and left-hand sides of concept inclusions. We also show that neither entailment nor equivalence queries alone are sufficient in cases (1) and (2) above.
|ISBN=978-1-57735-657-8
|Download=Kr14learning.pdf
|Forschungsgruppe=Wissensbasierte Systeme
}}

Inproceedings3109

2016-11-14T12:17:20Z

Ana Ozaki:

{{Publikation Erster Autor
|ErsterAutorVorname=Boris
|ErsterAutorNachname=Konev
|FurtherAuthors=Ana Ozaki; Frank Wolter;
}}
{{Inproceedings
|Referiert=1
|Title=Exact Learning Description Logic Ontologies from Data Retrieval Examples
|To appear=0
|Year=2015
|Month=Juni
|Booktitle=28th International Workshop on Description Logics
|Publisher=CEUR
}}
{{Publikation Details
|Abstract=We investigate the complexity of learning description logic ontologies in Angluin et al.’s framework of exact learning via queries posed to an oracle. We consider membership queries of the form “is individual a a certain answer to a data retrieval query q of ABox A and the target TBox?” and equivalence queries of the form “is a given TBox equivalent to the target TBox?”. We show that (i) DL-Lite TBoxes with role inclusions and ELI concept expressions on the right-hand side of inclusions and (ii) EL TBoxes without complex concept expressions on the right-hand side of inclusions can be learned in polynomial time. Both results are proved by a non-trivial reduction to learning from subsumption examples. We also show that arbitrary EL TBoxes cannot be learned in polynomial time.
|Download=LearningwithABoxesfull.pdf
|Forschungsgruppe=Wissensbasierte Systeme
}}

Inproceedings3108

2016-11-14T12:16:39Z

Ana Ozaki:

{{Publikation Erster Autor
|ErsterAutorVorname=Montserrat
|ErsterAutorNachname=Hermo
|FurtherAuthors=Ana Ozaki
}}
{{Inproceedings
|Referiert=1
|Title=Exact Learning of Multivalued Dependencies
|To appear=0
|Year=2015
|Month=Oktober
|Booktitle=Algorithmic Learning Theory - 26th International Conference
|Publisher=Springer
|Note=Our work received the E.M Gold Award in ALT 2015.
}}
{{Publikation Details
|Abstract=The transformation of a relational database schema into fourth normal form, which minimizes data redundancy, relies on the correct identification of multivalued dependencies. In this work, we study the learnability of multivalued dependency formulas (MVDF), which correspond to the logical theory behind multivalued dependencies. As
we explain, MVDF lies between propositional Horn and 2-Quasi-Horn. We prove that MVDF is polynomially learnable in Angluin et al.’s exact learning model with membership and equivalence queries, provided that counterexamples and membership queries are formulated as 2-Quasi-Horn clauses. As a consequence, we obtain that the subclass of 2-Quasi-Horn theories which are equivalent to MVDF is polynomially learnable.
|ISBN=978-3-319-24485-3
|Download=Ourmvpaperfullmvd.pdf
|DOI Name=10.1007/978-3-319-24486-0
|Forschungsgruppe=Wissensbasierte Systeme
}}

Inproceedings3108

2016-11-14T12:16:04Z

Ana Ozaki:

{{Publikation Erster Autor
|ErsterAutorVorname=Montserrat
|ErsterAutorNachname=Hermo
|FurtherAuthors=Ana Ozaki
}}
{{Inproceedings
|Referiert=1
|Title=Exact Learning of Multivalued Dependencies
|To appear=0
|Year=2015
|Month=Oktober
|Booktitle=Algorithmic Learning Theory - 26th International Conference
|Publisher=Springer
|Note=Our work the E.M Gold Award in ALT 2015.
}}
{{Publikation Details
|Abstract=The transformation of a relational database schema into fourth normal form, which minimizes data redundancy, relies on the correct identification of multivalued dependencies. In this work, we study the learnability of multivalued dependency formulas (MVDF), which correspond to the logical theory behind multivalued dependencies. As
we explain, MVDF lies between propositional Horn and 2-Quasi-Horn. We prove that MVDF is polynomially learnable in Angluin et al.’s exact learning model with membership and equivalence queries, provided that counterexamples and membership queries are formulated as 2-Quasi-Horn clauses. As a consequence, we obtain that the subclass of 2-Quasi-Horn theories which are equivalent to MVDF is polynomially learnable.
|ISBN=978-3-319-24485-3
|Download=Ourmvpaperfullmvd.pdf
|DOI Name=10.1007/978-3-319-24486-0
|Forschungsgruppe=Wissensbasierte Systeme
}}

Inproceedings3110

2016-11-14T12:14:59Z

Ana Ozaki:

{{Publikation Erster Autor
|ErsterAutorVorname=Boris
|ErsterAutorNachname=Konev
|FurtherAuthors=Ana Ozaki; Frank Wolter
}}
{{Inproceedings
|Referiert=1
|Title=A Model for Learning Description Logic Ontologies Based on Exact Learning
|To appear=0
|Year=2016
|Month=Februar
|Booktitle=Thirtieth AAAI Conference on Artificial Intelligence
|Publisher=AAAI Press
}}
{{Publikation Details
|Download=LearningABoxfullversion.pdf
|Forschungsgruppe=Wissensbasierte Systeme
}}

Inproceedings3114

2016-11-14T12:14:21Z

Ana Ozaki:

{{Publikation Erster Autor
|ErsterAutorVorname=Víctor
|ErsterAutorNachname=Gutiérrez-Basulto
|FurtherAuthors=Jean Christoph Jung; Ana Ozaki
}}
{{Inproceedings
|Referiert=1
|Title=On Metric Temporal Description Logics
|To appear=0
|Year=2016
|Month=September
|Booktitle=22nd European Conference on Artificial Intelligence
|Publisher=IOS Press
}}
{{Publikation Details
|Abstract=We introduce metric temporal description logics (mTDLs) as combinations of the classical description logic ALC with LTLbin, an extension of the temporal logic LTL with succinctly represented intervals, and metric temporal logic MTL, extending LTLbin with capabilities to quantitatively reason about time delays. Our main contributions are algorithms and tight complexity bounds for the satisfiability problem in these mTDLs: For mTDLs based on (fragments of) LTLbin, we establish complexity bounds ranging from ExpTime to 2ExpSpace. For mTDLs based on (fragments of) MTL interpreted over the naturals, we establish complexity bounds ranging from ExpSpace to 2ExpSpace.
|ISBN=978-1-61499-671-2
|Download=GJO16.pdf
|DOI Name=10.3233/978-1-61499-672-9-837
|Forschungsgruppe=Wissensbasierte Systeme
}}

Inproceedings3109

2016-11-03T16:23:36Z

Ana Ozaki: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Boris |ErsterAutorNachname=Konev |FurtherAuthors=Ana Ozaki; Frank Wolter; }} {{Inproceedings |Referiert=1 |Title…“

Datei:LearningwithABoxesfull.pdf

2016-11-03T16:22:23Z

Ana Ozaki:

Inproceedings3111

2016-11-03T16:09:07Z

Ana Ozaki:

Inproceedings3108

2016-11-03T16:06:45Z

Ana Ozaki: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Montserrat |ErsterAutorNachname=Hermo |FurtherAuthors=Ana Ozaki }} {{Inproceedings |Referiert=1 |Title=Exact Le…“

{{Publikation Erster Autor
|ErsterAutorVorname=Montserrat
|ErsterAutorNachname=Hermo
|FurtherAuthors=Ana Ozaki
}}
{{Inproceedings
|Referiert=1
|Title=Exact Learning of Multivalued Dependencies
|To appear=0
|Year=2015
|Month=Oktober
|Booktitle=Algorithmic Learning Theory - 26th International Conference
|Publisher=Springer
}}
{{Publikation Details
|Abstract=The transformation of a relational database schema into fourth normal form, which minimizes data redundancy, relies on the correct identification of multivalued dependencies. In this work, we study the learnability of multivalued dependency formulas (MVDF), which correspond to the logical theory behind multivalued dependencies. As
we explain, MVDF lies between propositional Horn and 2-Quasi-Horn. We prove that MVDF is polynomially learnable in Angluin et al.’s exact learning model with membership and equivalence queries, provided that counterexamples and membership queries are formulated as 2-Quasi-Horn clauses. As a consequence, we obtain that the subclass of 2-Quasi-Horn theories which are equivalent to MVDF is polynomially learnable.
|ISBN=978-3-319-24485-3
|Download=Ourmvpaperfullmvd.pdf
|DOI Name=10.1007/978-3-319-24486-0
|Forschungsgruppe=Computational Logic
}}
E.M Gold Award

Datei:Ourmvpaperfullmvd.pdf

2016-11-03T16:03:48Z

Ana Ozaki:

Inproceedings3111

2016-11-03T15:55:48Z

Ana Ozaki: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Boris |ErsterAutorNachname=Konev |FurtherAuthors=Carsten Lutz, Ana Ozaki, Frank Wolter; }} {{Inproceedings |Ref…“

{{Publikation Erster Autor
|ErsterAutorVorname=Boris
|ErsterAutorNachname=Konev
|FurtherAuthors=Carsten Lutz, Ana Ozaki, Frank Wolter;
}}
{{Inproceedings
|Referiert=1
|Title=Exact Learning of Lightweight Description Logic Ontologies
|To appear=0
|Year=2014
|Month=Juli
|Booktitle=Principles of Knowledge Representation and Reasoning
|Publisher=AAAI Press
}}
{{Publikation Details
|Abstract=We study learning of description logic TBoxes in Angluin et al.’s framework of exact learning via queries. We admit entailment queries (“is a given subsumption entailed by the target TBox?”) and equivalence queries (“is a given TBox equivalent to the target TBox?”), assuming that the signature and logic of the target TBox are known. We present three main results: (1) TBoxes formulated in DL-Lite with role inclusions and ELI concepts on the right-hand side of concept inclusions can be learned in polynomial time; (2) EL TBoxes with only concept names on the right-hand side of concept inclusions can be learned in polynomial time; and (3) EL TBoxes cannot be learned in polynomial time. It follows that non-polynomial time learnability of EL TBoxes is caused by the interaction between existential restrictions on the right- and left-hand sides of concept inclusions. We also show that neither entailment nor equivalence queries alone are sufficient in cases (1) and (2) above.
|ISBN=978-1-57735-657-8
|Download=Kr14learning.pdf
|Forschungsgruppe=Computational Logic
}}