3228 search results - page 375 / 646 » Computationally Sound Proofs |
153
click to vote
COMMA
2006
15 years 5 months ago
2006
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...
118
Voted
DBSEC
2003
15 years 5 months ago
2003
Abstract Data integrity can be problematic when integrating and organizing information from many sources. In this paper we describe efficient mechanisms that enable a group of data...
119
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sealgorithm, there is an abstract state ma...
118
Voted
DCG
2008
15 years 4 months ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
150
click to vote
EJC
2008
15 years 4 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...