Sciweavers

52 search results - page 1 / 11
» Open Questions in The Theory of Spaces of Orderings
Sort
View
JSYML
2002
66views more  JSYML 2002»
13 years 10 months ago
Open Questions in The Theory of Spaces of Orderings
f orderings provide an abstract framework in which to study spaces of orderings of formally real fields. Spaces of orderings of finite chain length are well understood [9] [12]. Th...
Murray A. Marshall
CADE
2005
Springer
14 years 11 months ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
Ting Zhang, Henny B. Sipma, Zohar Manna
MFCS
2005
Springer
14 years 4 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
CORR
2002
Springer
141views Education» more  CORR 2002»
13 years 10 months ago
Question answering: from partitions to Prolog
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
Balder ten Cate, Chung-chieh Shan
LICS
2007
IEEE
14 years 5 months ago
On Noetherian Spaces
A topological space is Noetherian iff every open is compact. Our starting point is that this notion generalizes that of well-quasi order, in the sense that an Alexandroff-discrete...
Jean Goubault-Larrecq