Sciweavers

225 search results - page 31 / 45
» OntoDLP: a Logic Formalism for Knowledge Representation
Sort
View
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
13 years 12 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
KES
2008
Springer
13 years 7 months ago
Ontology-Based Design Pattern Recognition
This paper presents ontology-based architecture for pattern recognition in the context of static source code analysis. The proposed system has three subsystems: parser, OWL ontolog...
Damir Kirasic, Danko Basch
APWEB
2006
Springer
13 years 11 months ago
Providing an Uncertainty Reasoning Service for Semantic Web Application
In the semantic web context,the formal representation of knowledge is not resourceful while the informal one with uncertainty prevails. In order to provide an uncertainty reasoning...
Lei Li, Qiaoling Liu, Yunfeng Tao, Lei Zhang, Jian...
DAGSTUHL
2008
13 years 9 months ago
The Grand Challenges and Myths of Neural-Symbolic Computation
The construction of computational cognitive models integrating the connectionist and symbolic paradigms of artificial intelligence is a standing research issue in the field. The co...
Luís C. Lamb
TABLEAUX
2007
Springer
14 years 1 months ago
Bounded Model Checking with Description Logic Reasoning
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...