Sciweavers

94 search results - page 3 / 19
» Independent Choices and the Interpretation of IF Logic
Sort
View
IJAR
2010
91views more  IJAR 2010»
13 years 6 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens
JUCS
2010
110views more  JUCS 2010»
13 years 2 months ago
On Choice Principles and Fan Theorems
: Veldman proved that the contrapositive of countable binary choice is a theorem of full-fledged intuitionism, to which end he used a principle of continuous choice and the fan the...
Hannes Diener, Peter Schuster
CORR
2000
Springer
120views Education» more  CORR 2000»
13 years 7 months ago
Scaling Up Inductive Logic Programming by Learning from Interpretations
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart ...
ATAL
2007
Springer
14 years 1 months ago
Reasoning about judgment and preference aggregation
Agents that must reach agreements with other agents need to reason about how their preferences, judgments, and beliefs might be aggregated with those of others by the social choic...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
CSL
1992
Springer
13 years 11 months ago
Communicating Evolving Algebras
We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...
Paola Glavan, Dean Rosenzweig