Sciweavers

345 search results - page 60 / 69
» Kripke models for classical logic
Sort
View
FORMATS
2003
Springer
14 years 26 days ago
Performance Analysis of Probabilistic Timed Automata Using Digital Clocks
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
WETICE
1998
IEEE
13 years 12 months ago
A Deontic Formalism for Co-ordinating Software Development in Virtual Software Corporations
The concept of the Virtual Software Corporation (VSC) has recently become a practical reality as a result of advances in communication and distributed technologies. However, there...
Zsolt Haag, Richard Foley, Julian Newman
EDBT
1998
ACM
114views Database» more  EDBT 1998»
13 years 12 months ago
HySpirit - A Probabilistic Inference Engine for Hypermedia Retrieval in Large Databases
Abstract. HySpirit is a retrieval engine for hypermedia retrieval integrating concepts from information retrieval (IR) and deductive databases. The logical view on IR models retrie...
Norbert Fuhr, Thomas Rölleke
LOGCOM
2008
106views more  LOGCOM 2008»
13 years 7 months ago
Reinforcement Belief Revision
The capability of revising its beliefs upon new information in a rational and efficient way is crucial for an intelligent agent. The classical work in belief revision focuses on i...
Yi Jin, Michael Thielscher
PODS
1994
ACM
138views Database» more  PODS 1994»
13 years 11 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman