Modulo operation

Known as: Mod operator, Modulo function, Mod 
In computing, the modulo operation finds the remainder after division of one number by another (sometimes called modulus). Given two positive numbers… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Checking the satisfiability of logical formulas, SMT solvers scale orders of magnitude beyond custom ad hoc solvers. 
  • figure 1
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We present a semi-decision procedure for checking satisfiability of expressive correctness properties of recursive first-order… (More)
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
DPLL Modulo Multiple Theories Propagate, Conflict, Explain, Backjump, Fail (unchanged) Decide l ∈ Lit(F) ∪ I(M) l, l / ∈ M M := M… (More)
  • figure 12.1
  • figure 12.2
  • table 12.1
  • table 12.2
  • figure 12.3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We first introduce Abstract DPLL, a rule-based formulation of the Davis--Putnam--Logemann--Loveland (DPLL) procedure for… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Deduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congruence on propositions. Such a… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
New VLSI circuit architectures for addition and multiplication modulo(2 1) and(2 + 1) are proposed that allow the implementation… (More)
  • figure 4
  • figure 2
  • figure 5
  • figure 6
  • table 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Clustering is one solution to the demand for wideissue machines and fast clock cycles because it allows for smaller, less ported… (More)
  • figure 5
  • figure 1
  • figure 4
  • figure 7
  • figure 6
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Modulo scheduling is a framework within which algorithms for software pipelining innermost loops may be defined. The framework… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Modulo scheduling is a framework within which a wide variety of algorithms and heuristics may be defined for software pipelining… (More)
Is this relevant?