Sciweavers

368 search results - page 6 / 74
» Arithmetic as a Theory Modulo
Sort
View
93
Voted
CORR
2010
Springer
67views Education» more  CORR 2010»
14 years 10 months ago
Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic
Alberto Griggio, Thi Thieu Hoa Le, Roberto Sebasti...
LPAR
2005
Springer
15 years 8 months ago
Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
An overview is given of a number of recent developments in SAT and SAT Modulo Theories (SMT). In particular, based on our k of Abstract DPLL and Abstract DPLL modulo Theories, we e...
Robert Nieuwenhuis, Albert Oliveras
141
Voted
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
15 years 7 months ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...
FFA
2010
70views more  FFA 2010»
15 years 21 days ago
Fast arithmetic in unramified p-adic fields
Let p be prime and Zpn a degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast deterministic algorithms for common o...
Hendrik Hubrechts