Sciweavers

7988 search results - page 1027 / 1598
» A Useful Undecidable Theory
Sort
View
LPNMR
2001
Springer
15 years 11 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits
SCALESPACE
2001
Springer
15 years 11 months ago
Scale-Time Kernels and Models
Receptive field sensitivity profiles of visual front-end cells in the LGN and V1 area in intact animals can be measured with increasing accuracy, both in the spatial and temporal...
Bart M. ter Haar Romeny, Luc Florack, Mads Nielsen
220
Voted
AGENTS
2000
Springer
15 years 11 months ago
MAS Infrastructure: Definitions, Needs and Prospects
This paper attempts to articulate the general role of infrastructure for multi-agent systems (MAS), and why infrastructure is a particularly critical issue if we are to increase th...
Les Gasser
208
Voted
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
15 years 11 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
207
Voted
POPL
1998
ACM
15 years 11 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...
« Prev « First page 1027 / 1598 Last » Next »