First Page | Document Content | |
---|---|---|
Date: 2010-07-28 04:32:18Mathematics Theoretical computer science Automated theorem proving Algebra Logic in computer science Algebraic structures Semiring Boolean satisfiability problem DPLL algorithm Unit propagation Maximum satisfiability problem Resolution | Semiring-Induced Propositional Logic: Definition and Basic Algorithms ∗ † Javier Larrosa, Albert Oliveras and Enric Rodr´ıguez-Carbonell Technical University of Catalonia Barcelona, Spain larrosa,oliveras,erodri@lsAdd to Reading ListSource URL: www.lsi.upc.eduDownload Document from Source WebsiteFile Size: 256,51 KBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |