4513 search results - page 387 / 903 » Logic programming with satisfiability |
259
click to vote
POPL
2004
ACM
16 years 5 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
144
click to vote
ICLP
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
164
Voted
ERLANG
2003
ACM
15 years 10 months ago
2003
ACM
In this paper, some experiences of using the concurrent functional language Erlang to implement a classical vertical application, a risk management information system, are present...
121
Voted
AGP
1998
IEEE
15 years 9 months ago
1998
IEEE
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both logic and functional programming claim the ability of writing parsers in a natura...
140
Voted
APLAS
2004
ACM
15 years 8 months ago
2004
ACM
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher-order programs. The ...