Sciweavers

504 search results - page 74 / 101
» Observational Logic
Sort
View
ICLP
2003
Springer
14 years 1 months ago
Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
Frank D. Valencia
ATVA
2006
Springer
112views Hardware» more  ATVA 2006»
14 years 11 days ago
Synthesis for Probabilistic Environments
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
Sven Schewe
SIGKDD
2000
112views more  SIGKDD 2000»
13 years 8 months ago
Artificial Neural Networks - A Science in Trouble
This article points out some very serious misconceptions about the brain in connectionism and artificial neural networks. Some of the connectionist ideas have been shown to have l...
Asim Roy
ACL
2007
13 years 10 months ago
Opinion Mining using Econometrics: A Case Study on Reputation Systems
Deriving the polarity and strength of opinions is an important research topic, attracting significant attention over the last few years. In this work, to measure the strength and...
Anindya Ghose, Panagiotis G. Ipeirotis, Arun Sunda...
IANDC
2008
114views more  IANDC 2008»
13 years 8 months ago
Generalizing the Paige-Tarjan algorithm by abstract interpretation
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
Francesco Ranzato, Francesco Tapparo