First Page | Document Content | |
---|---|---|
Date: 2010-05-19 04:29:26Theoretical computer science Automated planning and scheduling Logic in computer science Mathematics Computational complexity theory Boolean algebra Electronic design automation Formal methods Boolean satisfiability problem Maximum satisfiability problem Planning Domain Definition Language Satz | An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. AbstractAdd to Reading ListSource URL: ceur-ws.orgDownload Document from Source WebsiteFile Size: 87,56 KBShare Document on Facebook |
Algebra Universalis, + 0.20/0 (~ 1995 BirkhS.user Verlag, Basel Adjoining units to residuated Boolean algebrasDocID: 1v8wA - View Document | |
American Computer Science League Flyer Solutions 1. Boolean Algebra ( A B) ( AB BC ) = A B ( AB BC ) = AA B A BB C 0 0 0DocID: 1uZJ8 - View Document | |
Visualising the Boolean Algebra IB4 in 3D Hans Smessaert & Lorenz Demey KU Leuven, Belgium Rhombic Dodecahedron (RDH) LOGICAL GEOMETRYDocID: 1up5i - View Document | |
BOO axioms BOO001-0.ax Ternary Boolean algebra (equality) axioms m(m(v, w, x), y, m(v, w, z)) = m(v, w, m(x, y, z)) cnf(associativity, axiom) m(y, x, x) = x cnf(ternary multiply1 , axiom)DocID: 1u9q0 - View Document | |
On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID LisbonDocID: 1rsZm - View Document |