Sciweavers

2308 search results - page 230 / 462
» Representing Symbolic Reasoning
Sort
View
ECSQARU
2009
Springer
15 years 10 months ago
Using Transfinite Ordinal Conditional Functions
Abstract. Ordinal Conditional Functions (OCFs) are one of the predominant frameworks to define belief change operators. In his original paper Spohn defines OCFs as functions from t...
Sébastien Konieczny
CSL
2006
Springer
15 years 10 months ago
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BT04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms...
Vincent Atassi, Patrick Baillot, Kazushige Terui
EWCBR
2006
Springer
15 years 10 months ago
Decision Diagrams: Fast and Flexible Support for Case Retrieval and Recommendation
Abstract. We show how case bases can be compiled into Decision Diagrams, which represent the cases with reduced redundancy. Numerous computations can be performed efficiently on th...
Ross Nicholson, Derek G. Bridge, Nic Wilson
ECSQARU
1997
Springer
15 years 10 months ago
Creating Prototypes for Fast Classification in Dempster-Shafer Clustering
We develop a classification method for incoming pieces of evidence in Dempster-Shafer theory. This methodology is based on previous work with clustering and specification of origin...
Johan Schubert
FLAIRS
2007
15 years 9 months ago
Dynamic DDN Construction for Lightweight Planning Architectures
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...
William H. Turkett