Sciweavers

121 search results - page 3 / 25
» Two-Variable Logic on Words with Data
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Bounded Depth Data Trees
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
Henrik Björklund, Mikolaj Bojanczyk
LICS
2007
IEEE
14 years 1 months ago
First-Order and Temporal Logics for Nested Words
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
Rajeev Alur, Marcelo Arenas, Pablo Barceló,...
DSS
2011
12 years 11 months ago
Estimating the effect of word of mouth on churn and cross-buying in the mobile phone market with Markov logic networks
Abstract: Much has been written about word of mouth and customer behavior. Telephone call detail records provide a novel way to understand the strength of the relationship between ...
Torsten Dierkes, Martin Bichler, Ramayya Krishnan
LREC
2010
144views Education» more  LREC 2010»
13 years 8 months ago
Inferring Syntactic Rules for Word Alignment through Inductive Logic Programming
This paper presents and evaluates an original approach to automatically align bitexts at the word level. It relies on a syntactic dependency analysis of the source and target text...
Sylwia Ozdowska, Vincent Claveau
LICS
2007
IEEE
14 years 1 months ago
Alternation-free modal mu-calculus for data trees
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 ...
Marcin Jurdzinski, Ranko Lazic