Sciweavers

5608 search results - page 144 / 1122
» On the Theory of Matchgate Computations
Sort
View
FLAIRS
2008
15 years 4 months ago
On the Compilation of Possibilistic Default Theories
Handling exceptions represents one of the most important problems in Artificial Intelligence. Several approaches have been proposed for reasoning on default theories. This paper f...
Salem Benferhat, Safa Yahi, Habiba Drias
PKDD
2005
Springer
96views Data Mining» more  PKDD 2005»
15 years 7 months ago
Testing Theories in Particle Physics Using Maximum Likelihood and Adaptive Bin Allocation
We describe a methodology to assist scientists in quantifying the degree of evidence in favor of a new proposed theory compared to a standard baseline theory. The figure of merit ...
Bruce Knuteson, Ricardo Vilalta
MFPS
1993
15 years 5 months ago
Some Quasi-Varieties of Iteration Theories
All known structures involving a constructively obtainable fixed point (or iteration) operation satisfy the equational laws defining iteration theories. Hence, there seems to be...
Stephen L. Bloom, Zoltán Ésik
AAAI
2007
15 years 4 months ago
Computational Aspects of Covering in Dominance Graphs
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
Felix Brandt, Felix A. Fischer
ICALP
2005
Springer
15 years 7 months ago
Combining Intruder Theories
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
Yannick Chevalier, Michaël Rusinowitch