• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 11 - 20 of 3,837
Next 10 →

The 3-d inviscid limit result under slip boundary conditions. a negative answer

by H. Beirão Da Veiga, F. Crispo - J. Math. Fluid Mech
"... ar ..."
Abstract - Cited by 9 (1 self) - Add to MetaCart
Abstract not found

2 A NEGATIVE ANSWER TO THE QUESTION OF THE LINEARITY OF TATE’S TRACE FOR THE SUM OF TWO ENDOMORPHISMS

by Julia Ramos González, Fernando Pablos Romo
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

A NEGATIVE ANSWER TO TWO QUESTIONS ABOUT THE SMALLEST PRIME NUMBERS HAVING GIVEN DIGITAL SUMS

by unknown authors
"... Denote by ρ(k) the smallest prime number with digital sum k (not a multiple of 3). Richard K. Guy asked whether the congruences ρ(k) ≡ 99 (mod 100) and ρ(k) ≡ 999 (mod 1000) hold for all k> 38, respectively k> 59. Counterexamples to this are given, inter alia, for k = 86 and k = 104. Moreove ..."
Abstract - Add to MetaCart
Denote by ρ(k) the smallest prime number with digital sum k (not a multiple of 3). Richard K. Guy asked whether the congruences ρ(k) ≡ 99 (mod 100) and ρ(k) ≡ 999 (mod 1000) hold for all k> 38, respectively k> 59. Counterexamples to this are given, inter alia, for k = 86 and k = 104. Moreover, several open problems and conjectures about ρ(k) are discussed. 1.

Splitting a Logic Program

by Vladimir Lifschitz, Hudson Turner - Principles of Knowledge Representation , 1994
"... In many cases, a logic program can be divided into two parts, so that one of them, the \bottom " part, does not refer to the predicates de ned in the \top " part. The \bottom " rules can be used then for the evaluation of the predicates that they de ne, and the computed va ..."
Abstract - Cited by 294 (16 self) - Add to MetaCart
by the theorem may use both negation as failure and classical negation, and their rules may have disjunctive heads. The usefulness of the concept of splitting for the investigation of answer sets is illustrated by several applications. First, we show that a conservative extension theorem by Gelfond

ANSWER

by unknown authors
"... A 52-year-old man with heartburn and weight loss A previously fit and well 52-year-old man presented to the hospital with a 3-month history of refractory heartburn and pro-gressive weight loss (5 kg). After an initial response to empiric treatment with 20 mg omeprazole daily, heartburn relapsed and ..."
Abstract - Add to MetaCart
, were negative. Upper endoscopy and extensive tissue sampling were repeated.

ANSWERS

by unknown authors
"... Random conjunctival biopsy in multiorgan disease A previously fit and well 43-year-old woman fromWest Africa pre-sented with a 9 month history of productive cough, weight loss and unsteadiness on her feet. She denied night sweats. On examin-ation she was apyrexial. Blood cultures were negative. Full ..."
Abstract - Add to MetaCart
Random conjunctival biopsy in multiorgan disease A previously fit and well 43-year-old woman fromWest Africa pre-sented with a 9 month history of productive cough, weight loss and unsteadiness on her feet. She denied night sweats. On examin-ation she was apyrexial. Blood cultures were negative

Towards answering opinion questions: Separating facts from opinions and identifying the polarity of opinion sentences

by Hong Yu - In Proceedings of EMNLP-03 , 2003
"... Opinion question answering is a challenging task for natural language processing. In this paper, we discuss a necessary component for an opinion question answering system: separating opinions from fact, at both the document and sentence level. We present a Bayesian classifier for discriminating betw ..."
Abstract - Cited by 215 (4 self) - Add to MetaCart
Opinion question answering is a challenging task for natural language processing. In this paper, we discuss a necessary component for an opinion question answering system: separating opinions from fact, at both the document and sentence level. We present a Bayesian classifier for discriminating

NP IS AS EASY AS DETECTING UNIQUE SOLUTIONS

by L. G. Valiant, et al. , 1986
"... For every known NP-complete problem, the number of solutions of its instances varies over a large range, from zero to exponentially many. It is therefore natural to ask if the inherent intractability of NP-complete problems is caused by this wide variation. We give a negative answer to this questi ..."
Abstract - Cited by 233 (1 self) - Add to MetaCart
For every known NP-complete problem, the number of solutions of its instances varies over a large range, from zero to exponentially many. It is therefore natural to ask if the inherent intractability of NP-complete problems is caused by this wide variation. We give a negative answer

Succinct indexable dictionaries with applications to encoding k-ary trees and multisets

by Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao - In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA
"... We consider the indexable dictionary problem, which consists of storing a set S ⊆ {0,...,m − 1} for some integer m, while supporting the operations of rank(x), which returns the number of elements in S that are less than x if x ∈ S, and −1 otherwise; and select(i) which returns the i-th smallest ele ..."
Abstract - Cited by 259 (16 self) - Add to MetaCart
dictionaries taking this space only supported (yes/no) membership queries in O(1) time. In the cell probe model we can remove the O(lg lg m) additive term in the space bound, answering a question raised by Fich and Miltersen, and Pagh. We present extensions and applications of our indexable dictionary data

Strongly Equivalent Logic Programs

by Vladimir Lifschitz, David Pearce, Agustín Valverde - ACM Transactions on Computational Logic , 2000
"... A logic program 1 is said to be equivalent to a logic program 2 in the sense of the answer set semantics if 1 and 2 have the same answer sets. We are interested in the following stronger condition: for every logic program , 1 [ has the same answer sets as 2 [ . The study of strong equival ..."
Abstract - Cited by 231 (36 self) - Add to MetaCart
-and-there, which is intermediate between classical logic and intuitionistic logic. 1 Introduction This paper is about logic programs with negation as failure under the answer set (\stable model") semantics [ Gelfond and Lifschitz, 1988 ] . A program 1 is said to be equivalent to a program 2 if 1 and 2
Next 10 →
Results 11 - 20 of 3,837
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University