778 search results - page 79 / 156 » Expressiveness and complexity of graph logic |
129
Voted
KR
2010
Springer
15 years 5 months ago
2010
Springer
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
143
click to vote
DLT
2009
14 years 10 months ago
2009
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
104
click to vote
TIME
1994
IEEE
15 years 4 months ago
1994
IEEE
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
130
Voted
CADE
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Heterogeneous specification becomes more and more important because complex systems are often specified using multiple viewpoints, involving multiple formalisms. Moreover...
109
Voted
EKAW
2008
Springer
15 years 2 months ago
2008
Springer
Similarity measures play a key role in the Semantic Web perspective. Indeed, most of the ontology related operations such as ontology learning, ontology alignment, ontology ranking...