SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri? , Robert Nieuwenhuis?? , and Albert Oliveras?? Abstract. Predicate abstraction is a technique for automatically extracting finite-state abstractions for s

Source URL: www.lsi.upc.edu

• Mathematical logic
• Mathematics
• Theoretical computer science
• Formal methods
• Electronic design automation
• Logic in computer science
• NP-complete problems
• Boolean algebra
• Satisfiability modulo theories
• Boolean satisfiability problem
• 120-cell
• Predicate

ArmaTweet: Detecting Events by Semantic Tweet Analysis Alberto Tonon1 , Philippe Cudré-Mauroux1 , Albert Blarer2 , Vincent Lenders2 , and Boris Motik3 1

Source URL: www.lenders.ch

• Computing
• Information science
• Semantic Web
• Data management
• Knowledge representation
• Open data
• Resource Description Framework
• Twitter
• DBpedia
• SPARQL
• WordNet
• Semantics

Abstract DPLL and Abstract DPLL Modulo Theories Robert Nieuwenhuis? , Albert Oliveras? , and Cesare Tinelli ??

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematical logic
• Mathematics
• Automated theorem proving
• Boolean algebra
• Constraint programming
• Logic in computer science
• Formal methods
• DPLL algorithm
• Conflict-driven clause learning
• Boolean satisfiability problem
• Satisfiability modulo theories

DPLL(T) with Exhaustive Theory Propagation and its Application to Difference Logic Robert Nieuwenhuis and Albert Oliveras? Abstract. At CAV’04 we presented the DPLL(T ) approach for satisfiability modulo theories T . I

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematics
• Mathematical logic
• Boolean algebra
• Formal methods
• Logic in computer science
• Electronic design automation
• NP-complete problems
• Boolean satisfiability problem
• Satisfiability modulo theories
• Unit propagation
• Literal

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

Reliability as an Interdomain Service Hao Wang⋆ Yang Richard Yang⋆ Paul H. Liu⋆ Jia Wang† Alexandre Gerber† Albert Greenberg§ AT&T Labs – Research† Microsoft Research§

Source URL: thev.net

Splitting on Demand in SAT Modulo Theories Clark Barrett? , Robert Nieuwenhuis?? , Albert Oliveras??, and Cesare Tinelli? ? ? Abstract. Lazy algorithms for Satisfiability Modulo Theories (SMT) combine a generic DPLL-base

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematical logic
• Mathematics
• Constraint programming
• Automated theorem proving
• Logic in computer science
• Formal methods
• Propositional calculus
• Satisfiability modulo theories
• DPLL algorithm
• Unit propagation
• Solver

Splitting on Demand in SAT Modulo Theories Clark Barrett, Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli New York Univ. Techn. Univ. Catalonia

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematical logic
• Mathematics
• Boolean algebra
• Logic in computer science
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean satisfiability problem
• Phnom Penh
• Solver
• Propositional calculus

SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers Germain Faure, Robert Nieuwenhuis, Albert Oliveras and Enric Rodr´ıguez-Carbonell? Abstract. Many highly sophisticated tools exist for

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Electronic design automation
• Formal methods
• Logic in computer science
• NP-complete problems
• Boolean algebra
• Satisfiability modulo theories
• Boolean satisfiability problem
• Linear programming
• AMPL

Abstract DPLL and Abstract DPLL Modulo Theories Robert Nieuwenhuis1 , Albert Oliveras1 , and Cesare Tinelli2 1 Technical University of Catalonia

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Formal methods
• Electronic design automation
• Logic in computer science
• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• DPLL
• Phase-locked loop
• Satisfiability