2333 search results - page 132 / 467 » Recursive Computational Depth |
ICFP
2001
ACM
14 years 9 months ago
2001
ACM
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
AAAI
2008
13 years 12 months ago
2008
A recurring theme in AI and multiagent systems is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's...
ICDCS
1998
IEEE
14 years 1 months ago
1998
IEEE
Distributed execution of logic programs requires a match of granularity between a program and the distributed multi-processor it runs on to exploit its potential for performance f...
HOA
1993
14 years 1 months ago
1993
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...
COMMA
2010
13 years 4 months ago
2010
In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among argumen...