4117 search results - page 176 / 824 » On the Satisfiability of Complex Constraints |
158
click to vote
COMPLEX
2009
Springer
16 years 1 months ago
2009
Springer
By introducing and analyzing a renormalization procedure, Song et al. [1] draw the conclusion that many complex networks exhibit self-repeating patterns on all length scales. First...
167
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
We consider the problem of how an agent's knowledge can be updated. We propose a formal method of knowledge update on the basis of the semantics of modal logic S5. In our met...
168
click to vote
VMCAI
2005
Springer
16 years 16 hour ago
2005
Springer
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
192
click to vote
KBSE
1998
IEEE
15 years 10 months ago
1998
IEEE
We report on GADGET, a new software test generation system that uses combinatorial optimization to obtain condition/decision coverage of C/C++ programs. The GADGET system is fully...
191
click to vote
BIRTHDAY
2004
Springer
15 years 10 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...