Sciweavers

8768 search results - page 36 / 1754
» Generalizing the notion of support
Sort
View
COCO
1990
Springer
50views Algorithms» more  COCO 1990»
15 years 10 months ago
Width-Bounded Reducibility and Binary Search over Complexity Classes
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
Eric Allender, Christopher B. Wilson
JIIS
2008
104views more  JIIS 2008»
15 years 6 months ago
A framework for checking proofs naturally
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
Masahiko Sato
COSIT
2009
Springer
211views GIS» more  COSIT 2009»
15 years 4 months ago
The Abduction of Geographic Information Science: Transporting Spatial Reasoning to the Realm of Purpose and Design
People intuitively understand that function and purpose are critical parts of what human-configured entities are about, but these notions have proved difficult to capture formally....
Helen Couclelis
CIE
2007
Springer
16 years 11 days ago
Locally Computable Structures
We introduce the notion of a locally computable structure, a natural way of generalizing the notions of computable model theory to uncountable structures S by presenting the finit...
Russell G. Miller
ENTCS
2002
118views more  ENTCS 2002»
15 years 6 months ago
Rank 2 Types for Term Graph Rewriting
We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assign...
Steffen van Bakel