default search action
Baris Sertkaya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c28]Sergei Obiedkov, Baris Sertkaya:
Probably Approximately Correct Ontology Completion with pacco (Extended Abstract). Description Logics 2024 - 2023
- [j4]Ricardo Guimarães, Ana Ozaki, Cosimo Persia, Baris Sertkaya
:
Mining ℰℒ⊥ Bases with Adaptable Role Depth. J. Artif. Intell. Res. 76: 883-924 (2023) - [c27]Fabiola Hodo, Sai Pranav, Baris Sertkaya:
Clustering Knowledge Graphs Using Concept Lattices (Extended Abstract). Description Logics 2023 - [c26]Sergei Obiedkov
Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis. JELIA 2023: 176-191 - 2021
- [c25]Ricardo Guimarães
Mining EL Bases with Adaptable Role Depth. AAAI 2021: 6367-6374 - [c24]Ricardo Guimarães, Ana Ozaki, Cosimo Persia, Baris Sertkaya:
Mining EL⊥ Bases with Adaptable Role Depth (Extended Abstract). Description Logics 2021 - [i2]Ricardo Guimarães, Ana Ozaki, Cosimo Persia, Baris Sertkaya:
Mining EL Bases with Adaptable Role Depth. CoRR abs/2102.10689 (2021)
2010 – 2019
- 2019
- [c23]Sergei Obiedkov, Baris Sertkaya, Denis Zolotukhin:
Probably Approximately Correct Completion of Description Logic Knowledge Bases. Description Logics 2019 - [e3]Diana Cristea, Florence Le Ber, Rokia Missaoui, Léonard Kwuida, Baris Sertkaya:
Supplementary Proceedings of ICFCA 2019 Conference and Workshops, Frankfurt, Germany, June 25-28, 2019. CEUR Workshop Proceedings 2378, CEUR-WS.org 2019 [contents] - [e2]Diana Cristea, Florence Le Ber
Formal Concept Analysis - 15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25-28, 2019, Proceedings. Lecture Notes in Computer Science 11511, Springer 2019, ISBN 978-3-030-21461-6 [contents] - 2017
- [j3]Rafael Peñaloza
Understanding the complexity of axiom pinpointing in lightweight description logics. Artif. Intell. 250: 80-104 (2017) - 2013
- [c22]Baris Sertkaya:
The ELepHant Reasoner System Description. ORE 2013: 87-93 - 2011
- [j2]Felix Distel, Baris Sertkaya
On the complexity of enumerating pseudo-intents. Discret. Appl. Math. 159(6): 450-466 (2011) - [c21]Frithjof Dau, Baris Sertkaya:
An Extension of ToscanaJ for FCA-based Data Analysis over Triple Stores. CUBIST Workshop 2011 - [c20]Baris Sertkaya:
In the Search of Improvements to the EL+ Classification Algorithm. Description Logics 2011 - [c19]Frithjof Dau, Baris Sertkaya
Formal Concept Analysis for Qualitative Data Analysis over Triple Stores. ER Workshops 2011: 45-54 - [i1]Baris Sertkaya:
A Survey on how Description Logic Ontologies Benefit from Formal Concept Analysis. CoRR abs/1107.2822 (2011) - 2010
- [c18]Baris Sertkaya:
A Survey on how Description Logic Ontologies Benefit from FCA. CLA 2010: 2-21 - [c17]Rafael Peñaloza, Baris Sertkaya:
Complexity of Axiom Pinpointing in the DL-Lite Family. Description Logics 2010 - [c16]Rafael Peñaloza, Baris Sertkaya:
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics. ECAI 2010: 29-34 - [c15]Rafael Peñaloza, Baris Sertkaya:
On the Complexity of Axiom Pinpointing in the EL Family of Description Logics. KR 2010 - [e1]Léonard Kwuida
Formal Concept Analysis, 8th International Conference, ICFCA 2010, Agadir, Morocco, March 15-18, 2010. Proceedings. Lecture Notes in Computer Science 5986, Springer 2010, ISBN 978-3-642-11927-9 [contents]
2000 – 2009
- 2009
- [c14]Rafael Peñaloza, Baris Sertkaya:
Axiom Pinpointing is Hard. Description Logics 2009 - [c13]Baris Sertkaya:
OntoComP System Description. Description Logics 2009 - [c12]Baris Sertkaya
OntoComP: A Protégé Plugin for Completing OWL Ontologies. ESWC 2009: 898-902 - [c11]Baris Sertkaya
Towards the Complexity of Recognizing Pseudo-intents. ICCS 2009: 284-292 - [c10]Franz Baader, Baris Sertkaya
Usability Issues in Description Logic Knowledge Base Completion. ICFCA 2009: 1-21 - [c9]Baris Sertkaya
Some Computational Problems Related to Pseudo-intents. ICFCA 2009: 130-145 - 2008
- [c8]Baris Sertkaya:
Explaining User Errors in Knowledge Base Completion. Description Logics 2008 - [c7]Miki Hermann, Baris Sertkaya
On the Complexity of Computing Generators of Closed Sets. ICFCA 2008: 158-168 - 2007
- [b1]Baris Sertkaya:
Formal concept analysis methods for description logics. Dresden University of Technology, Germany, 2007, pp. 1-150 - [j1]Franz Baader, Baris Sertkaya
Computing the least common subsumer w.r.t. a background terminology. J. Appl. Log. 5(3): 392-420 (2007) - [c6]Franz Baader, Bernhard Ganter, Baris Sertkaya, Ulrike Sattler:
Completing Description Logic Knowledge Bases Using Formal Concept Analysis. IJCAI 2007: 230-235 - [c5]Franz Baader, Bernhard Ganter, Ulrike Sattler, Baris Sertkaya:
Completing Description Logic Knowledge Bases using Formal Concept Analysis. OWLED 2007 - 2004
- [c4]Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan:
Computing the Least Common Subsumer w.r.t. a Background Terminology. Description Logics 2004 - [c3]Franz Baader, Baris Sertkaya
Applying Formal Concept Analysis to Description Logics. ICFCA 2004: 261-286 - [c2]Baris Sertkaya
Proof of the Basic Theorem on Concept Lattices in Isabelle/HOL. ISCIS 2004: 976-985 - [c1]Franz Baader
Computing the Least Common Subsumer w.r.t. a Background Terminology. JELIA 2004: 400-412
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 20:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: