744 search results - page 61 / 149 » Observations on the Decidability of Transitions |
UAI
1996
13 years 10 months ago
1996
The study of belief change has been an active area in philosophy and AI. In recent years, two special cases of belief change, belief revision and belief update, have been studied ...
CONCUR
2009
Springer
14 years 3 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
FCT
2009
Springer
14 years 3 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
ICSEA
2007
IEEE
14 years 3 months ago
2007
IEEE
Automatic test data generation helps testers to validate software against user requirements more easily. Test data can be generated from many sources; for example, experience of t...
TABLEAUX
2000
Springer
14 years 21 days ago
2000
Springer
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...