Sciweavers

1162 search results - page 52 / 233
» An Information-Based Theory of Conditionals
Sort
View
LORI
2009
Springer
14 years 3 months ago
First-Order Logic Formalisation of Arrow's Theorem
Arrow’s Theorem is a central result in social choice theory. It states that, under certain natural conditions, it is impossible to aggregate the preferences of a finite set of i...
Umberto Grandi, Ulle Endriss
LICS
2005
IEEE
14 years 2 months ago
Name Generation and Linearity
A path-based domain theory for higher-order processes is extended to allow name generation. The original domain theory is built around the monoidal-closed category Lin consisting ...
Glynn Winskel
AUTOMATICA
2010
72views more  AUTOMATICA 2010»
13 years 9 months ago
Span-reachability and observability of bilinear hybrid systems
The paper presents an algebraic characterization of observability and span-reachability of bilinear hybrid systems without guards, i.e. hybrid systems whose continuous dynamics is...
Mihály Petreczky, Jan H. van Schuppen
ENTCS
2007
121views more  ENTCS 2007»
13 years 9 months ago
Rewrite-Based Decision Procedures
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
Maria Paola Bonacina, Mnacho Echenim
RSKT
2010
Springer
13 years 7 months ago
Naive Bayesian Rough Sets
A naive Bayesian classifier is a probabilistic classifier based on Bayesian decision theory with naive independence assumptions, which is often used for ranking or constructing a...
Yiyu Yao, Bing Zhou