16666 search results - page 24 / 3334 » Descriptive and Computational Complexity |
147
click to vote
ISSAC
1997
Springer
15 years 3 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
108
click to vote
LPAR
2007
Springer
15 years 5 months ago
2007
Springer
We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability...
VL
1996
IEEE
15 years 3 months ago
1996
IEEE
An often-mentioned advantage of rule-based programming languages is that a program can be extended simply by adding a few more rules. In practice however, the rules tend to be dep...
100
click to vote
CADE
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. Conjunctive query answering plays a prominent role in applications of description logics (DLs) that involve instance data, but its exact complexity was a long-standing op...
CSL
2000
Springer
15 years 3 months ago
2000
Springer
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...