Results 1  10
of
192
Graphs and Colorings for Answer Set Programming: Abridged Report
 Answer Set Programming: Advances in Theory and Implementation (ASP03
, 2003
"... We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. We start from a characterization of answer sets in terms of totally colored dependency graphs. To a turn, we develop a series of operational characterizations of answer sets ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. We start from a characterization of answer sets in terms of totally colored dependency graphs. To a turn, we develop a series of operational characterizations of answer
Graphs and Colorings for Answer Set Programming with Preferences: Preliminary Report
 In preparation
, 2003
"... The integration of preferences into answer set programming constitutes an important practical device for distinguishing certain preferred answer sets from nonpreferred ones. To this end, we elaborate upon rule dependency graphs and their colorings for characterizing different preference handling st ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The integration of preferences into answer set programming constitutes an important practical device for distinguishing certain preferred answer sets from nonpreferred ones. To this end, we elaborate upon rule dependency graphs and their colorings for characterizing different preference handling
Tabu Search  Part I
, 1989
"... This paper presents the fundamental principles underlying tabu search as a strategy for combinatorial optimization problems. Tabu search has achieved impressive practical successes in applications ranging from scheduling and computer channel balancing to cluster analysis and space planning, and more ..."
Abstract

Cited by 680 (11 self)
 Add to MetaCart
, and more recently has demonstrated its value in treating classical problems such as the traveling salesman and graph coloring problems. Nevertheless, the approach is still in its infancy, and a good deal remains to be discovered about its most effective forms of implementation and about the range
ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers
 Artificial Intelligence
, 2002
"... We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program’s completion, we obtain a onetoone corresp ..."
Abstract

Cited by 260 (7 self)
 Add to MetaCart
on these results, we implement a system called ASSAT(X), depending on the SAT solver X used, for computing one answer set of a normal logic program with constraints. We test the system on a variety of benchmarks including the graph coloring, the blocks world planning, and Hamiltonian Circuit domains. Our
Improvements to Graph Coloring Register Allocation
 ACM Transactions on Programming Languages and Systems
, 1994
"... This paper describes both the techniques themselves and our experience building and using register allocators that incorporate them. It provides a detailed description of optimistic coloring and rematerialization. It presents experimental data to show the performance of several versions of the regis ..."
Abstract

Cited by 201 (9 self)
 Add to MetaCart
Words and Phrases: Register allocation, code generation, graph coloring 1. INTRODUCTION The relationship between runtime performance and e#ective use of a machine's register set is well understood. In a compiler, the process of deciding which values to keep in registers at each point
Answer set programming with functions
 In Proc. KR’08
, 2008
"... To compute a function such as a mapping from vertices to colors in the graph coloring problem, current practice in Answer Set Programming is to represent the function as a relation. Among other things, this often makes the resulting program unnecessarily large when instantiated on a large domain. Th ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
To compute a function such as a mapping from vertices to colors in the graph coloring problem, current practice in Answer Set Programming is to represent the function as a relation. Among other things, this often makes the resulting program unnecessarily large when instantiated on a large domain
Graph Theoretical Characterization and Computation of Answer Sets
 Proceedings of the International Joint Conference on Artificial Intelligence
, 2001
"... We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a onetoone correspondence between answer sets and a special, nonstandard graph coloring of socalled block graphs of logic programs. This leads us to an alternative implementation paradigm ..."
Abstract

Cited by 15 (8 self)
 Add to MetaCart
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a onetoone correspondence between answer sets and a special, nonstandard graph coloring of socalled block graphs of logic programs. This leads us to an alternative implementation paradigm
On semidefinite programming relaxations for graph coloring and vertex cover
 In Proceedings of 13th ACMSIAM Symposium on Discrete Algorithms
, 2002
"... Abstract We investigate the power of a strengthened SDP relaxation for graph coloring whose value is equal to a variant of the Lov'asz #function. We show families of graphs where the value of the relaxation is 2 + ffl for any fixed ffl? 0, yet the chromatic number is n ffi for some fixed ffi? ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
by Schrijver). They asked whether this is within a ratio of 2 \Gamma ffl of the optimal vertex cover for any ffl? 0. Our construction answers this question negatively. 1 Introduction Consider the following question in combinatorial geometry: Given a set U of points on the unit sphere, consider the graph GU
Register allocation via hierarchical graph coloring
 In Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation
, 1991
"... We present a graph coloring register allocator de signed to minimize the number of dynamic memory references. We cover the program with sets of blocks called tiles and group these tiles into a tree reflecting the program's hierarchical control structure. Registers are allocated for each tile u ..."
Abstract

Cited by 103 (0 self)
 Add to MetaCart
We present a graph coloring register allocator de signed to minimize the number of dynamic memory references. We cover the program with sets of blocks called tiles and group these tiles into a tree reflecting the program's hierarchical control structure. Registers are allocated for each tile
A Column Generation Approach For Graph Coloring
 INFORMS Journal on Computing
, 1995
"... We present a method for solving the independent set formulation of the graph coloring problem (where there is one variable for each independent set in the graph). We use a column generation method for implicit optimization of the linear program at each node of the branchandbound tree. This approac ..."
Abstract

Cited by 93 (2 self)
 Add to MetaCart
We present a method for solving the independent set formulation of the graph coloring problem (where there is one variable for each independent set in the graph). We use a column generation method for implicit optimization of the linear program at each node of the branchandbound tree
Results 1  10
of
192