504 search results - page 24 / 101 » The Complexity of Symmetry-Breaking Formulas |
ICEBE
2007
IEEE
14 years 4 months ago
2007
IEEE
In both E-Commerce (EC) and Service-Oriented Computing (SOC) environments, sellers or service providers interact with customers or service clients for services or transactions. Fr...
CADE
2012
Springer
12 years 7 days ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
IPL
2007
13 years 9 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
ICALP
2000
Springer
14 years 1 months ago
2000
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
PADL
2012
Springer
12 years 5 months ago
2012
Springer
In the past, the creators of numerical programs had to choose between simple expression of mathematical formulas and static type checking. While the Lisp family and its dynamically...