349 search results - page 11 / 70 » The Finite and the Infinite |
ENTCS
2006
13 years 7 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
ICMAS
2000
13 years 8 months ago
2000
In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one ...
LATA
2010
Springer
13 years 11 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
FLAIRS
2004
13 years 8 months ago
2004
We extend the basic axiomatization of interval convex relations by Allen and Hayes with unbounded intervals. Unbounded intervals include since intervals with a finite beginning po...
COMBINATORICS
2004
13 years 7 months ago
2004
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...