Sciweavers

60 search results - page 3 / 12
» Loop Formulas for Circumscription
Sort
View
ICLP
2009
Springer
14 years 7 months ago
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
Xiaoping Chen, Jianmin Ji, Fangzhen Lin
WSCG
2003
170views more  WSCG 2003»
13 years 7 months ago
Shading by Spherical Linear Interpolation using De Moivre's Formula
In the classical shading algorithm according to Phong, the normal is interpolated across the scanline, requiring a computationally expensive normalization in the inner loop. In th...
Anders Hast, Tony Barrera, Ewert Bengtsson
DM
2002
88views more  DM 2002»
13 years 6 months ago
Tutte polynomial expansions for 2-separable graphs
Let ^G be a graph obtained from a graph G with no loops or coloops by replacing each edge e = uw of G by a connected graph He that has only the vertices u and w in common with the...
Douglas R. Woodall
JCT
2010
112views more  JCT 2010»
13 years 4 months ago
Annular embeddings of permutations for arbitrary genus
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
I. P. Goulden, William Slofstra
LPNMR
2005
Springer
13 years 12 months ago
Loops: Relevant or Redundant?
Loops and the corresponding loop formulas play an important role in answer set programming. On the one hand, they are used for guaranteeing correctness and completeness in SAT-base...
Martin Gebser, Torsten Schaub