Sciweavers

2611 search results - page 302 / 523
» A Logic for Concepts and Similarity
Sort
View
IJCAI
2001
15 years 8 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...
SEBD
2003
98views Database» more  SEBD 2003»
15 years 8 months ago
PAtterns for Next-generation DAtabase systems: preliminary results of the PANDA project
Nowadays, the vast volume of collected digital data obliges us to employ processing methods like pattern recognition and data mining in order to reduce the complexity of data manag...
Ilaria Bartolini, Elisa Bertino, Barbara Catania, ...
AAAI
2000
15 years 8 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
15 years 8 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
AAAI
1990
15 years 7 months ago
Operationality Criteria for Recursive Predicates
Current explanation-based generalization (EBG) techniques can perform badly when the problem being solved involves recursion. Often an infinite series of learned concepts are gene...
Stanley Letovsky