Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Memoing for logic programs

Memoing for logic programs Memoing for Logtc David S. Warren vc ~ i ~ o ~ ~ : ~ ~ C o ~ ! ~ ! ~c~ ~ - LOgi¢ Programming he power o f logic p r o g r a m ming (LP) comes from the synergism between the logic (declarativeness) and the p r o g r a m m i n g (procedurality [13, 37]. F r o m the logic point o f view, a p r o g r a m is a set o f sentences in a given logic. In this declarative view, answers are logical consequences o f the prog r a m as a set o f statements in the logic. A n d logical consequence is defined in terms o f a logical semantics, usually a theory o f models. So one can u n d e r s t a n d a logic prog r a m in terms o f a logical semantics and entailment in that semantics, that is, in terms o f properties o f models o f the p r o g r a m . Procedurality comes from the evaluation strategy (or p r http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

Memoing for logic programs

Communications of the ACM , Volume 35 (3) – Mar 1, 1992

Loading next page...
 
/lp/association-for-computing-machinery/memoing-for-logic-programs-ZBEraV0Yig

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1992 by ACM Inc.
ISSN
0001-0782
DOI
10.1145/131295.131299
Publisher site
See Article on Publisher Site

Abstract

Memoing for Logtc David S. Warren vc ~ i ~ o ~ ~ : ~ ~ C o ~ ! ~ ! ~c~ ~ - LOgi¢ Programming he power o f logic p r o g r a m ming (LP) comes from the synergism between the logic (declarativeness) and the p r o g r a m m i n g (procedurality [13, 37]. F r o m the logic point o f view, a p r o g r a m is a set o f sentences in a given logic. In this declarative view, answers are logical consequences o f the prog r a m as a set o f statements in the logic. A n d logical consequence is defined in terms o f a logical semantics, usually a theory o f models. So one can u n d e r s t a n d a logic prog r a m in terms o f a logical semantics and entailment in that semantics, that is, in terms o f properties o f models o f the p r o g r a m . Procedurality comes from the evaluation strategy (or p r

Journal

Communications of the ACMAssociation for Computing Machinery

Published: Mar 1, 1992

There are no references for this article.