Sciweavers

3845 search results - page 435 / 769
» Belief Logic Programming
Sort
View
159
Voted
ICALP
1990
Springer
15 years 11 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
185
Voted
AMI
2009
Springer
15 years 11 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
221
Voted
CORR
2004
Springer
97views Education» more  CORR 2004»
15 years 7 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
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
222
Voted
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
15 years 8 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty