Sciweavers

977 search results - page 83 / 196
» Logic programming with infinite sets
Sort
View
208
Voted
POPL
2006
ACM
16 years 26 days ago
Fast and loose reasoning is morally correct
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
Nils Anders Danielsson, John Hughes, Patrik Jansso...
125
Voted
FLOPS
2008
Springer
15 years 2 months ago
Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
Rafael Caballero, Mario Rodríguez-Artalejo,...
INTERSENSE
2006
ACM
15 years 6 months ago
Programming wireless sensor networks with logical neighborhoods
— Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified ...
Luca Mottola, Gian Pietro Picco
JLP
2000
134views more  JLP 2000»
15 years 9 days ago
Abducing through negation as failure: stable models within the independent choice logic
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
David Poole
104
Voted
SEFM
2005
IEEE
15 years 6 months ago
Description Logics for Shape Analysis
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
Lilia Georgieva, Patrick Maier