Sciweavers

7167 search results - page 520 / 1434
» Answer Set Programming
Sort
View
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 4 months ago
Does intelligence imply contradiction?
Contradiction is often seen as a defect of intelligent systems and a dangerous limitation on efficiency. In this paper we raise the question of whether, on the contrary, it could ...
Patrizio Frosini
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
15 years 4 months ago
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
János Barát, Jirí Matousek, D...
COMBINATORICS
2006
118views more  COMBINATORICS 2006»
15 years 4 months ago
Noncrossing Trees and Noncrossing Graphs
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a...
William Y. C. Chen, Sherry H. F. Yan
CORR
2006
Springer
122views Education» more  CORR 2006»
15 years 4 months ago
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
Frank Neven, Thomas Schwentick
122
Voted
JCT
2006
79views more  JCT 2006»
15 years 4 months ago
Reciprocity for multirestricted Stirling numbers
Multirestricted Stirling numbers of the second kind count the number of partitions of a given set into a given number of parts, each part being restricted to at most a fixed number...
Ji Young Choi, Ling Long, Siu-Hung Ng, Jonathan Sm...