activity
20002004
collaborators

8 papers

cs.LO2004

The Inverse Method Implements the Automata Approach for Modal Satisfiability

Franz Baader, Stephan Tobies

Tableaux-based decision procedures for satisfiability of modal and description logics behave quite well in practice, but it is sometimes hard to obtain exact worst-case complexity…

cs.DS2004

Formal Test Purposes and The Validity of Test Cases

Peter H. Deussen, Stephan Tobies

We give a formalization of the notion of test purpose based on (suitably restricted) Message Sequence Charts. We define the validity of test cases with respect to such a formal tes…

cs.LO2001

Complexity Results and Practical Algorithms for Logics in Knowledge Representation

Stephan Tobies

Description Logics (DLs) are used in knowledge-based systems to represent and reason about terminological knowledge of the application domain in a semantically well-defined manner.…

cs.LO2000

Reasoning with Individuals for the Description Logic SHIQ

Ian Horrock, Ulrike Sattler, Stephan Tobies

While there has been a great deal of work on the development of reasoning algorithms for expressive description logics, in most cases only Tbox reasoning is considered. In this pap…

cs.LO2000

Practical Reasoning for Expressive Description Logics

Ian Horrocks, Ulrike Sattler, Stephan Tobies

Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive r…

cs.LO2000

Practical Reasoning for Very Expressive Description Logics

Ian Horrocks, Ulrike Sattler, Stephan Tobies

Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive r…