Sciweavers

1776 search results - page 291 / 356
» Using a Logic Programming Language with Persistence and Cont...
Sort
View
AGP
1999
IEEE
14 years 1 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
OOPSLA
2005
Springer
14 years 2 months ago
Parametric polymorphism for software component architectures
Parametric polymorphism has become a common feature of mainstream programming languages, but software component architectures have lagged behind and do not support it. We examine ...
Cosmin E. Oancea, Stephen M. Watt
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
14 years 2 months ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
AAAI
1990
13 years 10 months ago
The Representation of Defaults in Cyc
This paper provides an account of the representation of defaults in Cyc and their semantics in terms of first order logic with reification. Default reasoning is a complex thing, a...
Ramanathan V. Guha
AMAI
2004
Springer
14 years 2 months ago
Production Inference, Nonmonotonicity and Abduction
We introduce a general formalism of production inference relations that posses both a standard monotonic semantics and a natural nonmonotonic semantics. The resulting nonmonotonic...
Alexander Bochman