Extraction of threshold functions from formulas in propositional logic

Milesi Vidal, Eric

View/Open

memoria.pdf (571,3Kb) (Restricted access)

View Usage Statistics

Cita com:

Show full item record

Milesi Vidal, Eric

Tutor / directorNieuwenhuis, Robert Lukas Mario

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.

SubjectsComputer science--Mathematics, Informàtica--Matemàtica

DegreeGRAU EN MATEMÀTIQUES (Pla 2009)

URIhttp://hdl.handle.net/2117/100538

Collections

Facultat de Matemàtiques i Estadística - Grau en Matemàtiques (Pla 2009) [282]

View Usage Statistics

Show full item record

Files	Description	Size	Format	View
memoria.pdf		571,3Kb	PDF	Restricted access

UPCommons. Global access to UPC knowledge

Extraction of threshold functions from formulas in propositional logic

View/Open

Browse