1032 search results - page 116 / 207 » Extended Computation Tree Logic |
104
click to vote
IDC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Based on the plethora of proposals and standards for logic- and rulebased reasoning for the Semantic Web (SW), a key factor for the success of SW agents is interoperabili...
SAS
1999
Springer
15 years 2 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
ICLP
2010
Springer
15 years 1 months ago
2010
Springer
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
BMCBI
2006
14 years 10 months ago
2006
Background: Phylogenetic methods which do not rely on multiple sequence alignments are important tools in inferring trees directly from completely sequenced genomes. Here, we exte...
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthemâ€...