149 search results - page 28 / 30 » Argumentation Semantics for Defeasible Logics |
POPL
2010
ACM
14 years 3 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...
BIRTHDAY
2005
Springer
13 years 11 months 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...
ICLP
1990
Springer
13 years 9 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...
FOIS
2006
13 years 7 months ago
2006
Abstract. Some events recur, and some happen only once. Galton refers to the latter as "once-only" events [1]. In a first-order logic of events that makes a type-token di...
IWMM
2009
Springer
14 years 9 days ago
2009
Springer
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...