Sciweavers

1460 search results - page 141 / 292
» Preferential Description Logics
Sort
View
LOGCOM
2010
143views more  LOGCOM 2010»
15 years 4 months ago
Vietoris Bisimulations
Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces, we introduce and study the concept of a Vietoris bisimulation...
Nick Bezhanishvili, Gaëlle Fontaine, Yde Vene...
KES
2007
Springer
16 years 19 days ago
Inductive Concept Retrieval and Query Answering with Semantic Knowledge Bases Through Kernel Methods
This work deals with the application of kernel methods to structured relational settings such as semantic knowledge bases expressed in Description Logics. Our method integrates a n...
Nicola Fanizzi, Claudia d'Amato
DIMACS
1996
15 years 7 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
IJCNN
2008
IEEE
16 years 27 days ago
Dynamic logic of phenomena and cognition
—Modeling of complex phenomena such as the mind presents tremendous computational complexity challenges. The neural modeling fields theory (NMF) addresses these challenges in a n...
Boris Kovalerchuk, Leonid I. Perlovsky
CCL
1994
Springer
15 years 10 months ago
Application of Constraint Logic Programming for VLSI CAD Tools
Abstract: This paper describes the application of CLP (constraint logic programming) to several digital circuit design problems. It is shown that logic programming together with ef...
Renate Beckmann, Ulrich Bieker, Ingolf Markhof