3468 search results - page 330 / 694 » An open logical framework |
163
click to vote
KBSE
2008
IEEE
16 years 1 months ago
2008
IEEE
Finite state machine-based abstractions of software behaviour are popular because they can be used as the basis for a wide range of (semi-) automated verification and validation ...
148
click to vote
DATE
2007
IEEE
16 years 1 months ago
2007
IEEE
Device scaling in new and future technologies brings along severe increase in the soft error rate of circuits, for combinational and sequential logic. Although potential solutions...
166
click to vote
CP
2007
Springer
16 years 28 days ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
168
click to vote
ESWS
2007
Springer
16 years 28 days ago
2007
Springer
In an open, constantly changing and collaborative environment like the forthcoming Semantic Web, it is reasonable to expect that knowledge sources will contain noise and inaccuraci...
154
click to vote
ADC
2004
Springer
16 years 5 days ago
2004
Springer
Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of ...