725 search results - page 42 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
138
Voted
CAEPIA
2009
Springer
15 years 3 months ago
2009
Springer
The syntax, semantics and an axiom system for an extension of Propositional Dynamic Logic (PDL) for order of magnitude qualitative reasoning which formalizes the concepts of close...
149
Voted
TPLP
2002
15 years 2 months ago
2002
At present, the search for specific information on the World Wide Web is faced with several problems, which arise on the one hand from the vast number of information sources avail...
105
Voted
CIE
2007
Springer
15 years 8 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
134
click to vote
AAAI
2008
15 years 4 months ago
2008
Markov logic networks (MLNs) combine first-order logic and Markov networks, allowing us to handle the complexity and uncertainty of real-world problems in a single consistent fram...
126
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
A compositional method for estimating software reliability of many threaded programs is developed. The method uses estimates of the reliability of individual modules and the proba...