4047 search results - page 68 / 810 » Some Properties and Some Problems on Set Functors |
199
click to vote
ICLP
2009
Springer
16 years 14 days ago
2009
Springer
We study finding similar or diverse solutions of a given computational problem, in answer set programming, and introduce offline methods and online methods to compute them using an...
136
click to vote
POPL
2000
ACM
15 years 4 months ago
2000
ACM
We propose an automatic method to enforce trace properties on programs. The programmer specifies the property separately from the program; a program transformer takes the program...
SIAMDM
2011
14 years 6 months ago
2011
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
118
click to vote
SAGT
2010
Springer
14 years 10 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
SYNTHESE
2008
14 years 11 months ago
2008
Abstract. Consciousness supervenes on activity; computation supervenes on structure. Because of this, some argue, conscious states cannot supervene on computational ones. If true, ...