Sciweavers

1283 search results - page 182 / 257
» Reasoning With Weighted Ontologies
Sort
View
COR
2008
142views more  COR 2008»
15 years 6 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 6 months ago
An Evidential Path Logic for Multi-Relational Networks
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
Marko A. Rodriguez, Joe Geldart
ICLP
2010
Springer
15 years 10 months ago
Using Generalized Annotated Programs to Solve Social Network Optimization Problems
Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...
Paulo Shakarian, V. S. Subrahmanian, Maria Luisa S...
DLOG
2010
15 years 4 months ago
Automata-Based Abduction for Tractable Diagnosis
Abstract. Abductive reasoning has been recognized as a valuable complement to deductive inference for tasks such as diagnosis and integration of incomplete information despite its ...
Thomas Hubauer, Steffen Lamparter, Michael Pirker
TABLEAUX
2005
Springer
15 years 11 months ago
A Tableau Algorithm for Description Logics with Concrete Domains and GCIs
In description logics (DLs), concrete domains are used for defining concepts based on concrete qualities of their instances such as the weight, age, duration, and spatial extensio...
Carsten Lutz, Maja Milicic