Sciweavers

972 search results - page 76 / 195
» Reasoning with Conditional Time-Intervals
Sort
View
KR
2010
Springer
14 years 16 days ago
A Decidable Class of Groundable Formulas in the General Theory of Stable Models
We present a decidable class of first-order formulas in the general theory of stable models that can be instantiated even in the presence of function constants. The notion of an ...
Michael Bartholomew, Joohyung Lee
EWCBR
1998
Springer
13 years 12 months ago
Representation of Failure Context for Diagnosis of Technical Applications
Development and maintenance of a case-base is known to be one of the most difficult problems in real-world application of case-based diagnosis systems. The complexity of large tech...
B. D. Netten
ICLP
1998
Springer
13 years 12 months ago
Efficient Implementation of a Linear Logic Programming Language
A number of logic programming languages based on Linear Logic [3] have been proposed. However, the implementation techniques proposed for these languages have relied heavily on th...
Joshua S. Hodas, K. M. Watkins, Naoyuki Tamura, Ky...
ICLP
1994
Springer
13 years 12 months ago
Entailment of Finite Domain Constraints
Using a glass-box theory of finite domain constraints, FD, we show how the entailment of user-defined constraints can be expressed by antimonotone FD constraints. We also provide a...
Björn Carlson, Mats Carlsson, Daniel Diaz
LOPSTR
1994
Springer
13 years 12 months ago
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
Annalisa Bossi, Sandro Etalle