Sciweavers

2 search results - page 1 / 1
» A Note on Bilattices and Open Constraint Programming
Sort
View
CSCLP
2004
Springer
13 years 10 months ago
A Note on Bilattices and Open Constraint Programming
Abstract. We propose to use bilattice as a constraint valuation structure in order to represent truth and belief at the same time. A bilattice is a set which owns two lattices orde...
Arnaud Lallouet
FOCS
2009
IEEE
13 years 11 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...