Sciweavers

2490 search results - page 246 / 498
» Complexity of Contextual Reasoning
Sort
View
ILP
1998
Springer
15 years 10 months ago
Learning Structurally Indeterminate Clauses
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
Jean-Daniel Zucker, Jean-Gabriel Ganascia
ICLP
1997
Springer
15 years 10 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
LPNMR
1997
Springer
15 years 10 months ago
Computing Non-Ground Representations of Stable Models
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
Thomas Eiter, James J. Lu, V. S. Subrahmanian
PVM
1997
Springer
15 years 10 months ago
Message Handling in Parallel Radiance
Photo-realistic computergraphics is an area of research which tries to develop algorithms and methods to render images of arti cial models or worlds as realistically as possible, b...
Erik Reinhard, Alan Chalmers
TIME
1994
IEEE
15 years 10 months ago
Belief Revision in a Discrete Temporal Probability-Logic
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
Scott D. Goodwin, Howard J. Hamilton, Eric Neufeld...