16 search results - page 3 / 4 » Defeasibility in Answer Set Programs via Argumentation Theor... |
SAGT
2010
Springer
13 years 3 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
PSSE
2004
Springer
13 years 10 months ago
2004
Springer
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
NMR
2004
Springer
13 years 10 months ago
2004
Springer
This paper presents a computational model for reasoning with causal explanations of observations within the framework of Abductive Event Calculus (AEC). The model is based on abdu...
LOPSTR
2007
Springer
13 years 11 months ago
2007
Springer
CooML is an object-oriented modeling language where specifications are theories in a constructive logic designed to handle incomplete information. In this logic we view snapshots ...