Sciweavers

989 search results - page 103 / 198
» Pebbling and Proofs of Work
Sort
View
JOLLI
2006
76views more  JOLLI 2006»
13 years 8 months ago
A Modal Interpretation of the Logic of Interrogation
We propose a novel interpretation of natural-language questions using a modal predicate logic of knowledge. Our approach brings standard model-theoretic and proof-theoretic techniq...
Rani Nelken, Chung-chieh Shan
JUCS
2006
94views more  JUCS 2006»
13 years 8 months ago
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
Tobias Riege, Jörg Rothe
ISF
2007
121views more  ISF 2007»
13 years 8 months ago
Virtual organization security policies: An ontology-based integration approach
Abstract This paper addresses the specification of a security policy ontology framework to mediate security policies between virtual organizations (VO) and real organizations (RO)....
Saravanan Muthaiyah, Larry Kerschberg
JCT
2007
94views more  JCT 2007»
13 years 8 months ago
A zero-free interval for flow polynomials of cubic graphs
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. D.R. Woodall has shown that, if G is a plane triangulation, then the only zeros of P(G,t) in (−∞...
Bill Jackson
COLING
2002
13 years 8 months ago
A Complete Integrated NLG System Using AI and NLU Tools
A standard architecture for an NLG system has been defined in (Reiter and Dale, 2000). Their work describes the modularization of an NLG system and the tasks of each module. Howev...
Laurence Danlos, Adil El Ghali