Sciweavers

2911 search results - page 59 / 583
» A Logic of Graph Constraints
Sort
View
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
14 years 2 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
ASP
2003
Springer
14 years 3 months ago
Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
Robert E. Mercer, Vincent Risch
ENTCS
2007
104views more  ENTCS 2007»
13 years 10 months ago
Lazy Context Cloning for Non-Deterministic Graph Rewriting
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
Sergio Antoy, Daniel W. Brown, Su-Hui Chiang
ICPR
2010
IEEE
13 years 8 months ago
Semi-supervised Graph Learning: Near Strangers or Distant Relatives
In this paper, an easily implemented semi-supervised graph learning method is presented for dimensionality reduction and clustering, using the most of prior knowledge from limited...
Weifu Chen, Guocan Feng
WILF
2007
Springer
129views Fuzzy Logic» more  WILF 2007»
14 years 4 months ago
A Graph Theoretic Approach to Protein Structure Selection
Marco Vassura, Luciano Margara, Piero Fariselli, R...