Sciweavers

369 search results - page 62 / 74
» Arithmetic of Generalized Jacobians
Sort
View
JAIR
2011
166views more  JAIR 2011»
13 years 2 months ago
Decidability and Undecidability Results for Propositional Schemata
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
TSP
2010
13 years 2 months ago
Zero-forcing DFE transceiver design over slowly time-varying MIMO channels using ST-GTD
This paper considers the optimization of transceivers with decision feedback equalizers (DFE) for slowly time-varying memoryless multi-input multi-output (MIMO) channels. The data ...
Chih-Hao Liu, Palghat P. Vaidyanathan
FOCS
2009
IEEE
14 years 2 months ago
Linear Systems over Composite Moduli
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
Arkadev Chattopadhyay, Avi Wigderson
ICLP
1997
Springer
14 years 1 days ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 12 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi