1615 search results - page 101 / 323 » Computer science and decision theory |
113
Voted
STACS
2009
Springer
15 years 7 months ago
2009
Springer
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
72
Voted
Publication
People travel between places of residence and work destinations via transportation net-
works. The relation between selection of home and work locations has been heavily
debated ...
101
click to vote
RTA
2009
Springer
15 years 7 months ago
2009
Springer
Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily t...
MFCS
1999
Springer
15 years 4 months ago
1999
Springer
We propose so called clausal tableau systems for the common modal logics K4, KD4 and S4. Basing on these systems, we give more efficient decision procedures than those hitherto kno...
102
click to vote
DRUMS
1998
Springer
15 years 4 months ago
1998
Springer
In this paper logical techniques developed to formalise the analysis of multi-interpretable information, in particular belief set operators and selection operators, are applied to...