Sciweavers

1948 search results - page 348 / 390
» Formalizing Mirror Theory
Sort
View
GEOS
2009
Springer
14 years 2 months ago
Towards Reasoning Pragmatics
Abstract. The realization of Semantic Web reasoning is central to substantiating the Semantic Web vision. However, current mainstream research on this topic faces serious challenge...
Pascal Hitzler
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
14 years 2 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
POPL
1998
ACM
14 years 2 months ago
From System F to Typed Assembly Language
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
J. Gregory Morrisett, David Walker, Karl Crary, Ne...
ICALP
1989
Springer
14 years 1 months ago
Causal Trees
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
Philippe Darondeau, Pierpaolo Degano
LPNMR
1990
Springer
14 years 1 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote