7988 search results - page 14 / 1598 » A Useful Undecidable Theory |
UAI
2001
13 years 9 months ago
2001
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
LITP
1990
13 years 11 months ago
1990
In this paper we provide several new results concerning word and matrix semigroup problems using counter automaton models. As a main result, we prove a new version of Post's c...
PODS
2003
ACM
14 years 7 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
LATA
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
IANDC
2007
13 years 7 months ago
2007
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...