Sciweavers

8141 search results - page 1203 / 1629
» Higher Order Generalization
Sort
View
200
Voted
LPNMR
1993
Springer
15 years 11 months ago
Negation as Partial Failure
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
Bamshad Mobasher, Jacek Leszczylowski, Don Pigozzi
WG
1993
Springer
15 years 11 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
KR
1992
Springer
15 years 11 months ago
Reasoning About Indefinite Actions
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
L. Thorne McCarty, Ron van der Meyden
SI3D
1992
ACM
15 years 11 months ago
Lights from Highlights and Shadows
Designing the illumination of a scene is a di cult task because one needs to render the whole scene in order to look at the result. Obtaining the correct lighting e ects may requi...
Pierre Poulin, Alain Fournier
ESE
1990
128views Database» more  ESE 1990»
15 years 11 months ago
Characterizing Diagnoses
Most approaches to model-based diagnosis describe a diagnosis for a system as a set of failing components that explains the symptoms. In order to characterize the typically very l...
Johan de Kleer, Alan K. Mackworth, Raymond Reiter
« Prev « First page 1203 / 1629 Last » Next »