Sciweavers

245 search results - page 31 / 49
» Class Algebra as a Description Logic
Sort
View
104
Voted
CORR
1999
Springer
95views Education» more  CORR 1999»
15 years 4 days ago
Fixed-parameter tractability, definability, and model checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
Jörg Flum, Martin Grohe
94
Voted
DLOG
2007
15 years 2 months ago
Conjunctive Query Entailment for SHOQ
An important reasoning task, in addition to the standard DL reasoning services, is conjunctive query answering. In this paper, we present a decision procedure for conjunctive query...
Birte Glimm, Ian Horrocks, Ulrike Sattler
124
Voted
KR
2000
Springer
15 years 4 months ago
Reasoning with Axioms: Theory and Practice
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
Ian Horrocks, Stephan Tobies
DM
2007
125views more  DM 2007»
15 years 13 days ago
Generalized switch-setting problems
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
Torsten Muetze
FOIKS
2006
Springer
15 years 4 months ago
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
Ian Horrocks, Andrei Voronkov