4978 search results - page 208 / 996 » Logical models of argument |
109
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
146
click to vote
TCC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
117
click to vote
SMA
2005
ACM
15 years 10 months ago
2005
ACM
In the parametric feature based design paradigm, most features possess arguments that are subsets of the boundary of the current model, subsets defined interactively by user sele...
126
click to vote
ACL
2010
15 years 2 months ago
2010
This paper improves the use of pseudowords as an evaluation framework for selectional preferences. While pseudowords originally evaluated word sense disambiguation, they are now c...
130
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...