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

Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions⋆ Daniel Larraz, Albert Oliveras, Enric Rodr´ıguez-Carbonell, and Albert Rubio Universitat Polit`ecnica de Catalunya, Barcelona, Spain

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Computational complexity theory
• Mathematical logic
• Constraint programming
• Logic in computer science
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean satisfiability problem
• Satisfiability modulo theories
• Maximum satisfiability problem
• Local consistency

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@ls

Source URL: www.lsi.upc.edu

• Mathematics
• 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

Proving Non-termination Using Max-SMT? Daniel Larraz1 , Kaustubh Nimkar2 , Albert Oliveras1 , Enric Rodr´ıguez-Carbonell1 , and Albert Rubio1 1 Universitat Polit`ecnica de Catalunya, Barcelona

Source URL: www.lsi.upc.edu

• Mathematical analysis
• Ergodic theory
• Differential topology
• Mathematics
• Computability theory
• Lie algebras
• Non-associative algebras
• Hopf decomposition
• Orbifold

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

Proving Termination of Imperative Programs Using Max-SMT Daniel Larraz, Albert Oliveras, Enric Rodr´ıguez-Carbonell, Albert Rubio Universitat Polit`ecnica de Catalunya, Barcelona, Spain Abstract—We show how Max-SMT

Source URL: www.lsi.upc.edu

PDF Document

Source URL: mesto-barcelona.cz

PDF Document

Source URL: asianfilmfestival.barcelona

PDF Document

Source URL: barcelona.makerfaire.com

PDF Document

Source URL: mesto-barcelona.cz