#### Filter Results:

- Full text PDF available (53)

#### Publication Year

2000

2017

- This year (15)
- Last 5 years (48)
- Last 10 years (65)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Method

#### Organism

Learn More

- Franz Baader, Sebastian Brandt, Carsten Lutz
- IJCAI
- 2005

Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL0, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL0 becomes already intractable in the presence of acyclic TBoxes, it remains… (More)

- Sebastian Brandt
- ECAI
- 2004

In the area of Description Logic (DL) based knowledge representation, research on reasoning w.r.t. general terminologies has mainly focused on very expressive DLs. Recently, though, it was shown for the DL EL, providing only the constructors conjunction and existential restriction, that the subsumption problem w.r.t. cyclic terminologies can be decided in… (More)

- Franz Baader, Carsten Lutz, Sebastian Brandt
- OWLED
- 2008

We extend the description logic EL with reflexive roles and range restrictions, and show that subsumption remains tractable if a certain syntactic restriction is adopted. We also show that subsumption becomes PSpace-hard (resp. undecidable) if this restriction is weakened (resp. dropped). Additionally, we prove that tractability is lost when symmetric roles… (More)

- Sebastian Brandt, Klaus-Tycho Förster, Roger Wattenhofer
- IEEE INFOCOM 2016 - The 35th Annual IEEE…
- 2016

We study consistent migration of flows, with special focus on software defined networks. Given a current and a desired network flow configuration, we give the first polynomial-time algorithm to decide if a congestion-free migration is possible. However, if all flows must be integer or are unsplittable, this is NP-hard to decide. A similar problem is… (More)

- Sebastian Brandt, Ralf Küsters, Anni-Yasmin Turhan
- Description Logics
- 2002

- Alan L. Rector, Sebastian Brandt, Jay Kola
- KR-MED
- 2008

There has been major progress both in description logics and ontology design since SNOMED was originally developed. The emergence of the standard Web Ontology language in its latest revision, OWL 1.1 is leading to a rapid proliferation of tools. Combined with the increase in computing power in the past two decades, these developments mean that many of the… (More)

- Sebastian Brandt, Orr Fischer, +5 authors Jara Uitto
- STOC
- 2016

We show that any randomised Monte Carlo distributed algorithm for the Lovász local lemma requires Omega(log log n) communication rounds, assuming that it finds a correct assignment with high probability. Our result holds even in the special case of d = O(1), where d is the maximum degree of the dependency graph. By prior work, there are distributed… (More)

- Sebastian Brandt
- 2004

In the area of Description Logic (DL) based knowledge representation, research on reasoning w.r.t. general terminologies has mainly focused on very expressive DLs. Recently, though, it was shown for the DL EL, providing only the constructors conjunction and existential restriction, that the subsumption problem w.r.t. cyclic terminologies can be decided in… (More)

- Sebastian Brandt
- Description Logics
- 2004

Recently, it was shown for the DL EL that subsumption and instance problem w.r.t. cyclic terminologies can be decided in polynomial time. In this paper, we show that both problems remain tractable even when admitting general concept inclusion axioms and simple role inclusion axioms.