#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2006

2017

- This year (1)
- Last 5 years (2)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Description logic (DL) ABoxes are a tool for describing the state of affairs in an application domain. In this paper, we consider the problem of updating ABoxes when the state changes. We assume that changes are described at an atomic level, i.e., in terms of possibly negated ABox assertions that involve only atomic concepts and roles. We analyze such basic… (More)

- Hongkai Liu, Carsten Lutz, Maja Milicic Brandt, Frank Wolter
- JELIA
- 2006

Action formalisms based on description logics (DLs) have recently been introduced as decidable fragments of well-established action theories such as the Situation Calculus and the Fluent Calculus. However, existing DL action formalisms fail to include general TBoxes, which are the standard tool for formalising ontologies in modern description logics. We… (More)

- Hongkai Liu, Carsten Lutz, Maja Milicic Brandt, Frank Wolter
- Artif. Intell.
- 2011

In description logic (DL), ABoxes are used for describing the state of affairs in an application domain. We consider the problem of updating ABoxes when the state changes, assuming that update information is described at an atomic level, i.e., in terms of possibly negated ABox assertions that involve only atomic concepts and roles. We analyze such basic… (More)

- Franz Baader, Hongkai Liu, Anees Mehdi
- ECAI
- 2010

The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem becomes decidable. On the one hand, we abstract from the actual execution sequences of a non-terminating program by considering infinite sequences of actions defined by a Büchi… (More)

- Franz Baader, Marcel Lippmann, Hongkai Liu
- LPAR
- 2010

In the reasoning about actions community, causal relationships have been proposed as a possible approach for solving the ramification problem, i.e., the problem of how to deal with indirect effects of actions. In this paper, we show that causal relationships can be added to action formalisms based on Description Logics (DLs) without destroying the… (More)

- Hongkai Liu, Carsten Lutz, Maja Miličić, Frank Wolter
- 2006

Action formalisms based on description logics (DLs) have recently been introduced as decidable fragments of well-established action theories such as the Situation Calculus and the Fluent Calculus. However, existing DL action formalisms fail to include general TBoxes, which are the standard tool for formalising ontologies in modern description logics. We… (More)

- Hongkai Liu
- 2010

Acknowledgements I am deeply indebted to Franz Baader and Carsten Lutz, my thesis advisors, for their valuable guidance of my researching work and constant support of all technical problems. Without either of them, this thesis would not exist. I am grateful to Maja Miliči´c and Frank Wolter who have also helped me a lot in the last four years. I would like… (More)

- Anees Mehdi, Hongkai Liu
- 2009

Description logics (DLs) provide expressiveness much beyond the expressiveness of propositional logic while still maintaining decidability of reasoning. This makes DLs a natural choice for formalizing actions. Besides DLs are also used in several application domains. However representing dynamic aspects of such application domains is not out of question. As… (More)

Although matching in Description Logics (DLs) is theoretically wellinvestigated, an implementation of a matching algorithm exists only for the DL ALE . The present paper presents an implementation of an existing polynomial time matching algorithm for the DL ALN . Benchmarks using randomly generated matching problems indicate a relatively good performance… (More)

- Conrad Drescher, Hongkai Liu, +4 authors Michael Thielscher
- FroCoS
- 2009

When trying to apply recently developed approaches for updating Description Logic ABoxes in the context of an action programming language, one encounters two problems. First, updates generate so-called Boolean ABoxes, which cannot be handled by traditional Description Logic reasoners. Second, iterated update operations result in very large Boolean ABoxes,… (More)