Sciweavers

793 search results - page 31 / 159
» Argumentation and standards of proof
Sort
View
161
Voted
JOLLI
2011
84views more  JOLLI 2011»
14 years 9 months ago
Semantically Restricted Argument Dependencies
This paper presents a new take on how argument dependencies in natural language are established and constrained. The paper starts with a rather standard view that (quantificationa...
Alastair Butler
ICDE
2001
IEEE
120views Database» more  ICDE 2001»
16 years 7 months ago
A Split Operator for Now-Relative Bitemporal Databases
The timestamps of now-relative bitemporal databases are modeled as growing, shrinking, or rectangular regions. The shape of these regions makes it a challenge to design bitemporal...
Mikkel Agesen, Michael H. Böhlen, Lasse Pouls...
TPHOL
2003
IEEE
15 years 11 months ago
First Order Logic with Domain Conditions
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
Freek Wiedijk, Jan Zwanenburg
APAL
2008
81views more  APAL 2008»
15 years 6 months ago
A remark on equivalent Rosser sentences
An oversight in Guaspari and Solovay's "Rosser sentences" (1979, Ann. Math. Log., 16, 81) is pointed out and emended. It concerns the premisses of their proof that ...
Christopher von Bülow
FOCS
1999
IEEE
15 years 10 months ago
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
Amit Sahai