1204 search results - page 85 / 241 » Termination of Polynomial Programs |
197
Voted
POPL
2008
ACM
16 years 29 days ago
2008
ACM
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
103
click to vote
EPIA
2005
Springer
15 years 6 months ago
2005
Springer
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
104
click to vote
SAGT
2010
Springer
14 years 11 months ago
2010
Springer
Recent results showing PPAD-completeness of the problem of computing an equilibrium for Fisher’s market model under additively separable, piecewise-linear, concave utilities (pl...
98
Voted
AAAI
2004
15 years 2 months ago
2004
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...
112
click to vote
LPNMR
2001
Springer
15 years 5 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...