3470 search results - page 170 / 694 » Head-Elementary-Set-Free Logic Programs |
150
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
144
click to vote
LICS
1989
IEEE
15 years 10 months ago
1989
IEEE
A refutation mechanism is introduced into logic programming, dual to the usual proof mechanism; then negation is treated via refutation. A four-valued logic is appropriate for the...
184
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tab...
182
click to vote
CL
2000
Springer
15 years 10 months ago
2000
Springer
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
183
click to vote
ICTAC
2010
Springer
15 years 4 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...