109 search results - page 8 / 22 » Characterization of Logics over Ranked Tree Languages |
107
click to vote
JMLR
2012
13 years 8 days ago
2012
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
PODC
2003
ACM
15 years 3 months ago
2003
ACM
The distinction between safety and liveness properties is due to Lamport who gave the following informal characterization. Safety properties assert that nothing bad ever happens w...
ENTCS
2000
14 years 9 months ago
2000
The coincidence between the model-theoretic and the procedural semantics of SLDresolution does not carry over to a Prolog system that also implements non-logical features like cut...
PODS
2007
ACM
15 years 10 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...