3319 search results - page 347 / 664 » Subshifts, Languages and Logic |
178
click to vote
FUIN
2010
15 years 4 months ago
2010
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
295
click to vote
POPL
2008
ACM
16 years 7 months ago
2008
ACM
Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of its semantics. This approach can be used in a verifie...
167
Voted
DLOG
1996
15 years 8 months ago
1996
To ensure the re-use of domain ontologies the usual approach relies on a pivot language, e.g., Kif, intoandfromwhich the domainontologyis translated. This requires several distinc...
237
Voted
TPHOL
1999
IEEE
15 years 11 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
197
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
This article tries to give an answer to a fundamental question in temporal data mining: "Under what conditions a temporal rule extracted from up-to-date temporal data keeps i...