<--- Back to Details
First PageDocument Content
Logic in computer science / Automated theorem proving / Constraint programming / Boolean algebra / Propositional calculus / Unsatisfiable core / Boolean satisfiability problem / Resolution / Maximum satisfiability problem / Satisfiability / Package manager / Debian
Date: 2008-12-16 11:04:43
Logic in computer science
Automated theorem proving
Constraint programming
Boolean algebra
Propositional calculus
Unsatisfiable core
Boolean satisfiability problem
Resolution
Maximum satisfiability problem
Satisfiability
Package manager
Debian

sets-graph-msuc-opt.ipeps

Add to Reading List

Source URL: tmancini.di.uniroma1.it

Download Document from Source Website

File Size: 134,40 KB

Share Document on Facebook

Similar Documents

Protocol log analysis with constraint programming Mats Carlsson Olga Grinchtein Justin Pearson

Protocol log analysis with constraint programming Mats Carlsson Olga Grinchtein Justin Pearson

DocID: 1xUdh - View Document

PDF Document

DocID: 1xSrV - View Document

Answer Sets: From Constraint Programming Towards Qualitative Optimization Gerhard Brewka

Answer Sets: From Constraint Programming Towards Qualitative Optimization Gerhard Brewka

DocID: 1vleR - View Document

Constraint Programming Mark Wallace Contact address: Mark Wallace, IC-Parc, William Penney Laboratory, Imperial College, LONDON SW7 2AZ. email:  September 1995

Constraint Programming Mark Wallace Contact address: Mark Wallace, IC-Parc, William Penney Laboratory, Imperial College, LONDON SW7 2AZ. email: September 1995

DocID: 1v7SC - View Document

Solving Segment Routing Problems with Hybrid Constraint Programming Techniques Renaud Hartert, Pierre Schaus, Stefano Vissicchio, and Olivier Bonaventure UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, Be

Solving Segment Routing Problems with Hybrid Constraint Programming Techniques Renaud Hartert, Pierre Schaus, Stefano Vissicchio, and Olivier Bonaventure UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, Be

DocID: 1v72L - View Document