1331 search results - page 102 / 267 » Description logic reasoning using the PTTP approach |
156
click to vote
GLVLSI
2006
IEEE
16 years 13 days ago
2006
IEEE
Most of the logic synthesis algorithms are not scalable for large networks and, for this reason, partitioning is often applied. However traditional mincut-based partitioning techn...
168
click to vote
AAAI
2007
15 years 8 months ago
2007
Action description language C+ is more expressive than ADL in many ways; for instance, it addresses the ramification problem. On the other hand, ADL is based on first-order logi...
190
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
155
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
188
click to vote
OWLED
2007
15 years 7 months ago
2007
This analysis is to identify requirements for a Description Logic (DL) to reason about product descriptions and other information related to product development. The DL is intended...