The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

## Filters

##
###
ILP Modulo Theories
[article]

2013
*
arXiv
*
pre-print

Thus, a general

arXiv:1210.3761v2
fatcat:qdxlpz6povgsvop2ydyecyxehq
*ILP**Modulo**Theories*framework has the potential to be widely applicable. ... We present Integer Linear Programming (*ILP*)*Modulo**Theories*(IMT). An IMT instance is an Integer Linear Programming instance, where some symbols have interpretations in background*theories*. ... To this end, we propose the Integer Linear Programming (*ILP*)*Modulo**Theories*(IMT) framework for combining*ILP*with background*theory*solvers. ...##
###
ILP Modulo Theories
[chapter]

2013
*
Lecture Notes in Computer Science
*

Thus, a general

doi:10.1007/978-3-642-39799-8_44
fatcat:ttl6ji6l6jbq3az646sahu2w2m
*ILP**Modulo**Theories*framework has the potential to be widely applicable. ... We present Integer Linear Programming (*ILP*)*Modulo**Theories*(IMT). An IMT instance is an Integer Linear Programming instance, where some symbols have interpretations in background*theories*. ... Conclusions and Future Work We introduced the*ILP**Modulo**Theories*(IMT) framework for describing problems that consist of linear constraints along with background*theory*constraints. ...##
###
SMT + ILP
[article]

2020
*
arXiv
*
pre-print

Inductive logic programming (

arXiv:2001.05208v1
fatcat:n2qupp4phfcb7jvtqbx6cwjc2m
*ILP*) has been a deeply influential paradigm in AI, enjoying decades of research on its*theory*and implementations. ... In this position paper, we motivate a reconsideration of inductive declarative programming by leveraging satisfiability*modulo**theory*technology. ... In recent years, satisfiability*modulo**theories*(SMT) has emerged as a pragmatic logical framework for reasoning about complex terms, inequalities and other arithmetic operations (Barrett et al. 2009 ...##
###
ILP Modulo Data
[article]

2014
*
arXiv
*
pre-print

We provide a scalable decision procedure that is based on the BC(T) architecture for

arXiv:1404.5665v3
fatcat:zhlludkdbze4noo7mb2vdt5q4y
*ILP**Modulo**Theories*. Our decision procedure makes use of database techniques. ... We provide a scalable procedure based on the BC(T ) architecture for*ILP**Modulo**Theories*(IMT) [10] . ... The compositional nature of*ILP**Modulo*Data is well-suited for potential applications. ...##
###
Synthesizing Cyber-Physical Architectural Models with Real-Time Constraints
[chapter]

2011
*
Lecture Notes in Computer Science
*

Our key technical contribution is the development of an Integer linear programming

doi:10.1007/978-3-642-22110-1_35
fatcat:kb4q4o5pgnd65ev5nrvwzxnwme
*Modulo**Theories*(IMT) solver along with a scheduling*theory*solver. ... We did this by developing an*ILP**Modulo**Theories*(IMT) solver with a resource-limit capability and a*theory*solver for static cyclic scheduling. ... To solve this problem, we develop an*ILP**Modulo**Theories*(IMT) solver that combines a background decision procedure with an*ILP*solver in much the same way that SMT allows for the integration of*theory*...##
###
A SAT Encoding to Compute Aperiodic Tiling Rhythmic Canons
[article]

2021
*
arXiv
*
pre-print

In Mathematical Music

arXiv:2112.05249v1
fatcat:e72fmobmnbgn3chsdrdbtkyrga
*theory*, the Aperiodic Tiling Complements Problem consists in finding all the possible aperiodic complements of a given rhythm A. ... In this paper we propose an*ILP*formulation and a SAT Encoding to solve this mathemusical problem, and we use the Maplesat solver to enumerate all the aperiodic complements. ... Introduction Mathematical Music*Theory*is the study of Music from a mathematical point of view. ...##
###
A Unified Framework for Instruction Scheduling and Mapping for Function Units with Structural Hazards

1998
*
Journal of Parallel and Distributed Computing
*

coloring in an

doi:10.1006/jpdc.1998.1442
fatcat:dx4jsejpsrc7vbn3w4taqtuzsm
*ILP*framework, and one uses forbidden latencies in an elegant extension of classical hardware pipeline control*theory*. ... This compares favorably with a leading heuristic, Huff's Slack Scheduling-the*ILP*approaches found a schedule with smaller initiation interval for over 50% of the loops, with a mean improvement of almost ... are equal*modulo*II. ...##
###
The Inez Mathematical Programming Modulo Theories Framework
[chapter]

2015
*
Lecture Notes in Computer Science
*

*theories*. ... Our Mathematical Programming

*Modulo*

*Theories*(MPMT) constraint solving framework extends Mathematical Programming technology with techniques from the field of Automated Reasoning, e.g., solvers for first-order ... Introduction The

*ILP*(or, more generally, Mathematical Programming)

*Modulo*

*Theories*(IMT or MPMT) framework accommodates Mathematical Programming (MP) instances, where some variable symbols have meaning ...

##
###
Inflated Lattice Precoding, Bias Compensation, and the Uplink/Downlink Duality: The Connection

2007
*
IEEE Communications Letters
*

It is shown that bias compensation in DFE and the scaling in

doi:10.1109/lcomm.2007.061591
fatcat:kysk2nlil5cy5bvvgrswpmsppu
*ILP*are dual operations and cancel each other. ... Thereby the effect of bias compensation in DFE is addressed, and its connection to the concept of "inflated lattice precoding" (*ILP*)-a tool which has been proven to be the key to achieve the capacity of ... INTRODUCTION Over the last years, the*theory*of uplink/downlink duality has been developed, e.g., [13] , [11] . ...##
###
Instruction-level parallel processing: History, overview, and perspective

1993
*
Journal of Supercomputing
*

Several systems were built, and sold commercially, which pushed

doi:10.1007/bf01205181
fatcat:v7uhz4km5ndxzhr7baybks2bn4
*ILP*far beyond where it had been before, both in terms of the amount of*ILP*offered and in the central role*ILP*played in the design of the ... By the end of the decade, advanced microprocessor design at all major CPU manufacturers had incorporated*ILP*, and new techniques for*ILP*have become a popular topic at academic conferences. ... The intent is to document both the*theory*and the practice of*ILP*computing. ...##
###
Instruction-Level Parallel Processing: History, Overview, and Perspective
[chapter]

1993
*
Instruction-Level Parallelism
*

Several systems were built, and sold commercially, which pushed

doi:10.1007/978-1-4615-3200-2_3
fatcat:eg7nutqurffxfj2y62g5lfc57m
*ILP*far beyond where it had been before, both in terms of the amount of*ILP*offered and in the central role*ILP*played in the design of the ... By the end of the decade, advanced microprocessor design at all major CPU manufacturers had incorporated*ILP*, and new techniques for*ILP*have become a popular topic at academic conferences. ... The intent is to document both the*theory*and the practice of*ILP*computing. ...##
###
Software pipelining showdown

1996
*
Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation - PLDI '96
*

Both are variants of

doi:10.1145/231379.231385
dblp:conf/pldi/RuttenbergGLS96
fatcat:q2qbblk3unfkbowpkppni6rxti
*modulo*scheduling, a framework for generation of soflware pipelines pioneered by Rau and Glaser [RaG181 ], but are otherwise quite dissimilar. ... In*theory*, this should reveal only deficiencies in the production compiler, never in the*ILP*pipeliner. The solid bars in Figure 5 show comparative results for the SPEC floating point benchmarks. ... By the spring of 1995, this work was implemented at McGill in MOST, the*Modulo*Scheduling Toolset, which makes use of any one of several external*ILP*solvers. ...##
###
Software pipelining showdown

1996
*
SIGPLAN notices
*

Both are variants of

doi:10.1145/249069.231385
fatcat:l6hw7exw6ffypatodizu223vie
*modulo*scheduling, a framework for generation of soflware pipelines pioneered by Rau and Glaser [RaG181 ], but are otherwise quite dissimilar. ... In*theory*, this should reveal only deficiencies in the production compiler, never in the*ILP*pipeliner. The solid bars in Figure 5 show comparative results for the SPEC floating point benchmarks. ... By the spring of 1995, this work was implemented at McGill in MOST, the*Modulo*Scheduling Toolset, which makes use of any one of several external*ILP*solvers. ...##
###
How to Compute Worst-Case Execution Time by Optimization Modulo Theory and a Clever Encoding of Program Semantics
[article]

2014
*
arXiv
*
pre-print

Optimization

arXiv:1405.7962v1
fatcat:stbzfw7rera7ncbdy6mncxtgra
*modulo**theory*extends satisfiability*modulo**theory*(SMT) to maximization problems. ... We compute the WCET (or at least a close upper bound thereof) as the solution of an optimization*modulo**theory*problem that takes into account the semantics of the program, in contrast to other methods ... Optimization*modulo**theory*is an extension of satisfability*modulo**theory*(SMT) where the returned solution is not just any solution, but one maximizing some objective; in our case, solutions define execution ...##
###
How to compute worst-case execution time by optimization modulo theory and a clever encoding of program semantics

2014
*
Proceedings of the 2014 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems - LCTES '14
*

Optimization

doi:10.1145/2597809.2597817
dblp:conf/lctrts/HenryAMM14
fatcat:ai265vopxzfxhcx5mt3jxdtldq
*modulo**theory*extends satisfiability*modulo**theory*(SMT) to maximization problems. ... Optimization*modulo**theory*is an extension of satisfability*modulo**theory*(SMT) where the returned solution is not just any solution, but one maximizing some objective; in our case, solutions define execution ...
« Previous

*Showing results 1 — 15 out of 1,155 results*