Abstract | ||
---|---|---|
Logic programming is understood as the use of constructive proofs for building correct programs. We illustrate the application of this approach in the framework of propositional calculus and outline the PRIZ programming system, which has intuitionistic propositional calculus as its logical basis. The relation of the deductive program synthesis to constraint propagation and the introduction of parallelism are considered. |
Year | DOI | Venue |
---|---|---|
1990 | 10.1016/0743-1066(90)90039-8 | The Journal of Logic Programming |
Keywords | Field | DocType |
PRIZ system,propositional logic programming | Intuitionistic logic,Discrete mathematics,Autoepistemic logic,Algorithm,Propositional calculus,Zeroth-order logic,Logic programming,Well-formed formula,Propositional variable,Mathematics,Propositional formula | Journal |
Volume | Issue | ISSN |
9 | 2 | 0743-1066 |
Citations | PageRank | References |
2 | 0.43 | 0 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Grigori Mints | 1 | 235 | 72.76 |
Enn Tyugu | 2 | 278 | 63.65 |