725 search results - page 109 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
224
Voted
POPL
2005
ACM
16 years 2 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
102
click to vote
DLOG
2007
15 years 4 months ago
2007
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
138
click to vote
CONCUR
2007
Springer
15 years 8 months ago
2007
Springer
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
112
click to vote
HIPC
2004
Springer
15 years 8 months ago
2004
Springer
This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines (FSMs). High performance CAD tools are necessary to...
118
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
The critical functionality of many software applications relies on code that performs mathematically complex computations. However, such code is often difficult to test owing to t...