4513 search results - page 478 / 903 » Logic programming with satisfiability |
148
Voted
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
We consider an extension of the guarded fragment in which one can guard quanti ers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
115
Voted
ICALP
1990
Springer
15 years 9 months ago
1990
Springer
Termrewritingsystemsare importantfor computabilitytheoryof abstractdata types,for automatictheorem proving, and for the foundationsof functionalprogramming.In this shortsurveywe pr...
124
click to vote
AMI
2009
Springer
15 years 9 months ago
2009
Springer
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...
171
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
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...
142
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
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 ...