1795 search results - page 17 / 359 » On the Complexity of Circuit Satisfiability |
DLOG
2010
13 years 5 months ago
2010
Abstract. UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constr...
ER
2010
Springer
13 years 5 months ago
2010
Springer
UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constraints expr...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
AAAI
2000
13 years 8 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
LOGCOM
2006
13 years 7 months ago
2006
The Alternating-time Temporal Logic (ATL) of Alur, Henzinger, and Kupferman is being increasingly widely applied in the specification and verification of open distributed systems ...