3053 search results - page 173 / 611 » A Logic of Abstract Argumentation |
162
click to vote
POPL
2010
ACM
16 years 4 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...
170
click to vote
BIRTHDAY
2005
Springer
16 years 4 days ago
2005
Springer
I present a formalism that combines two methodologies: objective Bayesianism and Bayesian nets. According to objective Bayesianism, an agent’s degrees of belief (i) ought to sat...
142
click to vote
ICLP
1990
Springer
15 years 10 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
128
click to vote
SYNTHESE
2008
15 years 6 months ago
2008
While considerable ink has been spilt over the rejection of idealism by Bertrand Russell and G.E. Moore at the end of the 19th Century, relatively little attention has been directe...
175
click to vote
JLP
2007
15 years 6 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...