504 search results - page 49 / 101 » The Complexity of Symmetry-Breaking Formulas |
WIA
2000
Springer
14 years 1 months ago
2000
Springer
The Mona tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in prac...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
ICALT
2007
IEEE
14 years 4 months ago
2007
IEEE
Access to the disciplines of science, Technology, Engineering and Mathematics (STEM) for blind and vision impaired people continues to be a problem. The inherently visual nature o...
RR
2007
Springer
14 years 4 months ago
2007
Springer
This paper presents an extension to the Semantic Web Rule Language and a methodology to enable advanced mathematical support in SWRL rules. This solution separates mathematical and...
ISCAS
2006
IEEE
14 years 4 months ago
2006
IEEE
— We present analytical formulas for the calculation of the memory requirements for a system using the Complex Logarithmic Number System (CLNS). Certain properties of the CLNS ad...