Extraction of threshold functions from formulas in propositional logic
View/Open
memoria.pdf (571,3Kb) (Restricted access)
Document typeBachelor thesis
Date2017-01
Rights accessRestricted access - author's decision
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
Given a formula in propositional logic F in some presentation (BDD, ROBDD, truth table), our aim is to find a threshold function T that is a logical consequence of F and that is as strong as possible according to certain criteria. In general this problem is essentially open, but here our objective is to identify particular cases where efficient exact or approximation algorithms exist and carry out a careful experimental assessment.
DegreeGRAU EN MATEMÀTIQUES (Pla 2009)
Collections
Files | Description | Size | Format | View |
---|---|---|---|---|
memoria.pdf![]() | 571,3Kb | Restricted access |