Sciweavers

1818 search results - page 110 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
COMMA
2006
13 years 10 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
AI
2007
Springer
13 years 9 months ago
Conservation principles and action schemes in the synthesis of geometric concepts
In this paper a theory for the synthesis of geometric concepts is presented. The theory is focused on a constructive process that synthesizes a function in the geometric domain re...
Luis Alberto Pineda
JAR
2008
70views more  JAR 2008»
13 years 9 months ago
Assumption-Commitment Support for CSP Model Checking
We present a simple formulation of Assumption-Commitment reasoning using CSP. In our formulation, an assumption-commitment style property of a process SYS takes the form COM SYS A...
Nick Moffat, Michael Goldsmith
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
13 years 6 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
CORR
2011
Springer
138views Education» more  CORR 2011»
13 years 4 months ago
A new approach to nonrepetitive sequences
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek