Sciweavers

329 search results - page 52 / 66
» Resolution-based argumentation semantics
Sort
View
FOSSACS
2004
Springer
14 years 3 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
ICFP
1999
ACM
14 years 2 months ago
Principals in Programming Languages: A Syntactic Proof Technique
Programs are often structured around the idea that different pieces of code comprise distinct principals, each with a view of its environment. Typical examples include the module...
Steve Zdancewic, Dan Grossman, J. Gregory Morriset...
SMA
1997
ACM
123views Solid Modeling» more  SMA 1997»
14 years 2 months ago
On Multiple Interpretations
This paper is concerned with frequency adverbs in Japanese. Many linguists have pointed out that frequency statements and generic sentences have multiple readings when they co-occ...
JungHyun Han
ATAL
2003
Springer
14 years 1 months ago
Posit spaces: a performative model of e-commerce
What distinguishes e-commerce from ordinary commerce? What distinguishes it from distributed computation? In this paper we propose a performative theory of e-commerce, drawing on ...
Peter McBurney, Simon Parsons
DOCENG
2008
ACM
13 years 11 months ago
Constructing a know-how repository of advices and warnings from procedural texts
In this paper, we show how a domain dependent know-how textual database of advices and warnings can be constructed from procedural texts. We show how arguments of type warnings an...
Lionel Fontan, Patrick Saint-Dizier