Sciweavers

12 search results - page 2 / 3
» Dialogues about the burden of proof
Sort
View
ICAIL
2007
ACM
13 years 9 months ago
An implementation of norm-based agent negotiation
In this paper, we develop our previous outline of a multi-agent architecture for regulated information exchange in crime investigations. Interactions about information exchange be...
Pieter Dijkstra, Henry Prakken, Kees de Vey Mestda...
SFP
2004
13 years 6 months ago
Generic proofs for combinator-based generic programs
Abstract: Generic programming can bring important benefits to software engineering. In particular, it reduces the burden of verification, since generic proofs can be instantiated a...
Fermín Reig
ICFP
2009
ACM
14 years 6 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
CHI
2000
ACM
13 years 9 months ago
Providing integrated toolkit-level support for ambiguity in recognition-based interfaces
Interfaces based on recognition technologies are used extensively in both the commercial and research worlds. But recognizers are still error-prone, and this results in human perf...
Jennifer Mankoff, Scott E. Hudson, Gregory D. Abow...
COMMA
2006
13 years 6 months ago
The Carneades Argumentation Framework - Using Presumptions and Exceptions to Model Critical Questions
Abstract. In 2005, Gordon and Walton presented initial ideas for a computational model of defeasible argument [12, 26], which builds on and elaborates Walton's theory of argum...
Thomas F. Gordon, Douglas Walton