Sciweavers

590 search results - page 95 / 118
» From Relational Specifications to Logic Programs
Sort
View
AIMSA
2010
Springer
13 years 9 months ago
Towards Ontological Blending
We propose ontological blending as a new method for `creatively' combining ontologies. In contrast to other combination techniques that aim at integrating or assimilating cate...
Joana Hois, Oliver Kutz, Till Mossakowski, John A....
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
13 years 12 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
LACL
2001
Springer
14 years 23 hour ago
Structural Equations in Language Learning
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...
Michael Moortgat
BIRTHDAY
2010
Springer
14 years 12 days ago
The Arrow of Time through the Lens of Computing
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
Krishna V. Palem
IPPS
1999
IEEE
13 years 12 months ago
Marshaling/Demarshaling as a Compilation/Interpretation Process
Marshaling is the process through which structured values are serialized into a stream of bytes; demarshaling converts this stream of bytes back to structured values. Most often, ...
Christian Queinnec