Sciweavers

661 search results - page 5 / 133
» Argument Reduction by Factoring
Sort
View
ENTCS
2008
97views more  ENTCS 2008»
13 years 7 months ago
Termination of Lazy Rewriting Revisited
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...
Felix Schernhammer, Bernhard Gramlich
SIAMCOMP
2000
76views more  SIAMCOMP 2000»
13 years 7 months ago
On Interpolation and Automatization for Frege Systems
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
Maria Luisa Bonet, Toniann Pitassi, Ran Raz
ARGMAS
2005
Springer
14 years 29 days ago
Argumentation-Based Multi-agent Dialogues for Deliberation
This paper presents an argumentation-based approach to deliberation, the process by which two or more agents reach a consensus on a course of action. The kind of deliberation that ...
Yuqing Tang, Simon Parsons
LREC
2010
219views Education» more  LREC 2010»
13 years 8 months ago
Approaches to Text Mining Arguments from Legal Cases
Abstract. This paper describes recent approaches using text-mining to automatically profile and extract arguments from legal cases. We outline some of the background context and mo...
Adam Wyner, Raquel Mochales Palau, Marie-Francine ...
ECML
2005
Springer
14 years 28 days ago
Fast Non-negative Dimensionality Reduction for Protein Fold Recognition
Abstract. In this paper, dimensionality reduction via matrix factorization with nonnegativity constraints is studied. Because of these constraints, it stands apart from other linea...
Oleg Okun, Helen Priisalu, Alexessander Alves