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

Learn More →

Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete

Backchain iteration: Towards a practical inference method that is simple enough to be proved... We focus on methods for interpreting stratified datalog programs with negation, and we describe progress towards a practical, yet simple method that treats such programs as executable specifications of deductive database applications. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Automated Reasoning Springer Journals

Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete

Journal of Automated Reasoning , Volume 11 (1) – Dec 10, 2004

Loading next page...
 
/lp/springer-journals/backchain-iteration-towards-a-practical-inference-method-that-is-ckSkqUiRtJ

References (45)

Publisher
Springer Journals
Copyright
Copyright
Subject
Computer Science; Mathematical Logic and Formal Languages; Artificial Intelligence; Mathematical Logic and Foundations; Symbolic and Algebraic Manipulation
ISSN
0168-7433
eISSN
1573-0670
DOI
10.1007/BF00881898
Publisher site
See Article on Publisher Site

Abstract

We focus on methods for interpreting stratified datalog programs with negation, and we describe progress towards a practical, yet simple method that treats such programs as executable specifications of deductive database applications.

Journal

Journal of Automated ReasoningSpringer Journals

Published: Dec 10, 2004

There are no references for this article.