725 search results - page 113 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
99
Voted
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
In real-world Digital Libraries, Artificial Intelligence techniques are essential for tackling the automatic document processing task with sufficient flexibility. The great variab...
83
Voted
ENTCS
2002
15 years 2 months ago
2002
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
140
Voted
VSTTE
2012
Springer
13 years 10 months ago
2012
Springer
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
111
click to vote
ISMIS
2003
Springer
15 years 7 months ago
2003
Springer
As broadband access to the Internet becomes pervasive, the need for a 24 hours a day, seven days a week (24x7) interface within the client devices, requires a level of sophisticati...
228
Voted
ICDT
2009
ACM
16 years 3 months ago
2009
ACM
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...