654 search results - page 14 / 131 » Ordered Sets and Complete Lattices |
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
SEMWEB
2010
Springer
13 years 5 months ago
2010
Springer
We present a scalable, SPARQL-based computational pipeline for testing the lattice-theoretic properties of partial orders represented as RDF triples. The use case for this work is ...
FOIKS
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. Ordered Choice Logic Programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This com...
LPNMR
2004
Springer
14 years 27 days ago
2004
Springer
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
EJC
2011
13 years 2 months ago
2011
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...