Proof-producing Congruence Closure Robert Nieuwenhuis? and Albert Oliveras?? Technical University of Catalonia, Jordi Girona 1, 08034 Barcelona, Spain www.lsi.upc.es/~roberto www.lsi.upc.es/~oliveras Abstract. Many appl

Source URL: www.lsi.upc.edu

• Mathematics
• Algebra
• Theoretical computer science
• Modular arithmetic
• Logic in computer science
• Congruence relation
• Equivalence
• Closure
• Rewriting
• Congruence lattice problem
• Congruence subgroup

MiniMaxSat: a New Weighted Max-SAT Solver Federico Heras, Javier Larrosa, and Albert Oliveras Universitat Politecnica de Catalunya, Jordi Girona 1-3, 08034 Barcelona, Spain Abstract. In this paper we introduce M INI M A

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Logic in computer science
• Automated theorem proving
• Boolean algebra
• NP-complete problems
• Combinatorial optimization
• Maximum satisfiability problem
• Boolean satisfiability problem
• Resolution
• Unit propagation

A Write-Based Solver for SAT Modulo the Theory of Arrays Miquel Bofill Universitat de Girona Robert Nieuwenhuis

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Logic in computer science
• Electronic design automation
• Formal methods
• NP-complete problems
• Mathematics
• Constraint programming
• Satisfiability modulo theories
• Boolean satisfiability problem
• Array data type
• Literal
• Matrix

PDF Document

Source URL: www.girona.cat

PDF Document

Source URL: www.girona.cat

PDF Document

Source URL: www.girona.cat

PDF Document

Source URL: www.girona.cat

PDF Document

Source URL: www.girona.cat

PDF Document

Source URL: www.girona.cat

PDF Document

Source URL: www.girona.cat