Sciweavers

7988 search results - page 116 / 1598
» A Useful Undecidable Theory
Sort
View
ISMIS
2003
Springer
14 years 3 months ago
Granular Computing Based on Rough Sets, Quotient Space Theory, and Belief Functions
Abstract. A model of granular computing (GrC) is proposed by reformulating, re-interpreting, and combining results from rough sets, quotient space theory, and belief functions. Two...
Y. Y. Yao, Churn-Jung Liau, Ning Zhong
CSL
2006
Springer
14 years 1 months ago
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
Alexander Moshe Rabinovich, Wolfgang Thomas
IJCAI
2007
13 years 11 months ago
Progression of Situation Calculus Action Theories with Incomplete Information
In this paper, we propose a new progression mechanism for a restricted form of incomplete knowledge formulated as a basic action theory in the situation calculus. Specifically, w...
Stavros Vassos, Hector J. Levesque
ACE
2004
162views Education» more  ACE 2004»
13 years 11 months ago
Computing Theory With Relevance
In computer science education, the topic of computing theory is one that is commonly not well received by students. Career-oriented students often view the topic as irrelevant, an...
Wayne Brookes
ENDM
2000
131views more  ENDM 2000»
13 years 10 months ago
Some Topological Methods in Graph Coloring Theory
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...
Bojan Mohar