Sciweavers

551 search results - page 103 / 111
» {log}: A Logic Programming Language with Finite Sets
Sort
View
FOSSACS
2009
Springer
15 years 4 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
IFIP
2004
Springer
15 years 3 months ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack
92
Voted
AAAI
1996
14 years 11 months ago
Formalizing Narratives Using Nested Circumscription
The representation of narratives of actions and observations is a current issue in Knowledge Representation, where traditional plan-oriented treatments of action seem to fall shor...
Chitta Baral, Alfredo Gabaldon, Alessandro Provett...
CORR
2006
Springer
143views Education» more  CORR 2006»
14 years 9 months ago
A Knowledge-Based Approach for Selecting Information Sources
Through the Internet and the World-Wide Web, a vast number of information sources has become available, which offer information on various subjects by different providers, often i...
Thomas Eiter, Michael Fink, Hans Tompits
JMLR
2012
13 years 3 days ago
Metric and Kernel Learning Using a Linear Transformation
Metric and kernel learning arise in several machine learning applications. However, most existing metric learning algorithms are limited to learning metrics over low-dimensional d...
Prateek Jain, Brian Kulis, Jason V. Davis, Inderji...