Sciweavers

3179 search results - page 346 / 636
» Applications of PCF Theory
Sort
View
AAAI
2000
13 years 11 months ago
The Complexity of Restricted Consequence Finding and Abduction
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
Alvaro del Val
WM
2003
13 years 11 months ago
Worlds, Models, and KM
Techniques for computation on generalized diagrams are defined and the KM implications are explored. Descriptive Computing is presented and plan computation based on world models t...
Cyrus F. Nourani
ESANN
2000
13 years 11 months ago
A neural network approach to adaptive pattern analysis - the deformable feature map
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...
Axel Wismüller, Frank Vietze, Dominik R. Ders...
IJCAI
1997
13 years 11 months ago
Compiling Prioritized Circumscription into Extended Logic Programs
We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized c...
Toshiko Wakaki, Ken Satoh
ROOM
2000
13 years 11 months ago
An Overview of The Mensurae Language: Specifying Business Processes
We describe a language which can be used to model business processes (both technical and nontechnical). It has a formal semantics, so as to enable formal analysis and prediction o...
T. S. E. Maibaum