Sciweavers

620 search results - page 45 / 124
» About the logical relations between cases and rules
Sort
View
DLOG
2010
14 years 9 months ago
Towards Soundness Preserving Approximation for ABox Reasoning of OWL2
ABox Reasoning in large scale description logic (DL) knowledge bases, e.g. ontologies, is important for the success of many semantic-enriched systems. Performance of existing appro...
Yuan Ren, Jeff Z. Pan, Yuting Zhao
AI
2000
Springer
14 years 11 months ago
Alternative foundations for Reiter's default logic
We introduce an alternative conceptual basis for default reasoning in Reiter's default logic. In fact, most formal or computational treatments of default logic suffer from th...
Thomas Linke, Torsten Schaub
ENTCS
2002
148views more  ENTCS 2002»
14 years 11 months ago
A Declarative Debugging System for Lazy Functional Logic Programs
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
Rafael Caballero, Mario Rodríguez-Artalejo
IJCAI
2001
15 years 1 months ago
Probabilistic Classification and Clustering in Relational Data
Supervised and unsupervised learning methods have traditionally focused on data consisting of independent instances of a single type. However, many real-world domains are best des...
Benjamin Taskar, Eran Segal, Daphne Koller
JSYML
2011
108views more  JSYML 2011»
14 years 6 months ago
Analytic equivalence relations and bi-embeddability
Abstract. Louveau and Rosendal [5] have shown that the relation of biembeddability for countable graphs as well as for many other natural classes of countable structures is complet...
Sy-David Friedman, Luca Motto Ros