245 search results - page 30 / 49 » Class Algebra as a Description Logic |
116
click to vote
CORR
2006
Springer
15 years 15 days ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
88
Voted
LICS
2010
IEEE
14 years 11 months ago
2010
IEEE
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
78
Voted
APAL
2010
15 years 18 days ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
98
Voted
SEMWEB
2004
Springer
15 years 5 months ago
2004
Springer
We argue that in a distributed context, such as the Semantic Web, ontology engineers and data creators often cannot control (or even imagine) the possible uses their data or ontolo...
TC
1998
15 years 4 days ago
1998
—Many modern Field Programmable Logic Arrays (FPGAs) use lookup table (LUT) logic blocks which can be programmed to realize any function of a fixed number of inputs. It is possib...