Sciweavers

1162 search results - page 82 / 233
» An Information-Based Theory of Conditionals
Sort
View
GECCO
2009
Springer
15 years 6 months ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...
DALT
2005
Springer
15 years 5 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
SLP
1997
102views more  SLP 1997»
15 years 1 months ago
Compositionality of Normal Open Logic Programs
Compositionality of programsis an important concern in knowledge representation and software development. In the context of Logic Programming, up till now, the issue has mostly be...
Sofie Verbaeten, Marc Denecker, Danny De Schreye
JAR
2008
70views more  JAR 2008»
14 years 12 months ago
Assumption-Commitment Support for CSP Model Checking
We present a simple formulation of Assumption-Commitment reasoning using CSP. In our formulation, an assumption-commitment style property of a process SYS takes the form COM SYS A...
Nick Moffat, Michael Goldsmith
JAIR
2006
110views more  JAIR 2006»
14 years 12 months ago
Domain Adaptation for Statistical Classifiers
The most basic assumption used in statistical learning theory is that training data and test data are drawn from the same underlying distribution. Unfortunately, in many applicati...
Hal Daumé III, Daniel Marcu