Sciweavers

16666 search results - page 62 / 3334
» Descriptive and Computational Complexity
Sort
View
148
Voted
AAAI
2012
13 years 6 months ago
Equality-Friendly Well-Founded Semantics and Applications to Description Logics
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...
Georg Gottlob, André Hernich, Clemens Kupke...
119
Voted
FUIN
2008
71views more  FUIN 2008»
15 years 3 months ago
Nonterminal Complexity of Some Operations on Context-Free Languages
: We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals which is necessary to generate t...
Jürgen Dassow, Ralf Stiebe
254
Voted
DLOG
2011
14 years 7 months ago
A Technique for Handling the Right Hand Side of Complex RIAs
This paper examines a new technique based on tableau, that allows one to introduce composition of roles from the right hand side of complex role inclusion axioms (RIAs). Our motiva...
Milenko Mosurovic, Nenad Krdzavac
147
Voted
MEMICS
2010
14 years 10 months ago
Instructor Selector Generation from Architecture Description
We describe an automated way to generate data for a practical LLVM instruction selector based on machine-generated description of the target architecture at register transfer leve...
Miloslav Trmac, Adam Husar, Jan Hranac, Tomas Hrus...
169
Voted
DLOG
2011
14 years 7 months ago
Nominal Schemas for Integrating Rules and Description Logics
We propose an extension of SROIQ with nominal schemas which can be used like “variable nominal concepts” within axioms. This feature allows us to express arbitrary DL-safe rule...
Markus Krötzsch, Frederick Maier, Adila Alfa ...