Sciweavers

3691 search results - page 398 / 739
» Bayesian Logic Programs
Sort
View
ICALP
2009
Springer
15 years 11 months ago
Decidability of the Guarded Fragment with the Transitive Closure
We consider an extension of the guarded fragment in which one can guard quantiers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
Jakub Michaliszyn
ICALP
1990
Springer
15 years 10 months ago
Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond
Termrewritingsystemsare importantfor computabilitytheoryof abstractdata types,for automatictheorem proving, and for the foundationsof functionalprogramming.In this shortsurveywe pr...
Jan Willem Klop
AMI
2009
Springer
15 years 10 months ago
Bug-Free Sensors: The Automatic Verification of Context-Aware TinyOS Applications
Abstract. We provide the first tool for verifying the logic of contextaware applications written for the mainstream sensor network operating system TinyOS; we focus on detecting pr...
Doina Bucur, Marta Z. Kwiatkowska
CORR
2004
Springer
97views Education» more  CORR 2004»
15 years 6 months ago
Quantum typing
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda-calculus for the QRAM model, following the work of P. Seling...
Benoît Valiron
166
Voted
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 4 months ago
A Simple Correctness Proof for Magic Transformation
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
Wlodzimierz Drabent