Forward Reasoning via Sequential Queries in Logic Programming
Keehang Kwon
Abstract
Open-access reader
Keehang Kwon
Abstract
Open-access reader
Most Prolog implementations are based on backward chaining techniques. However, there are many applications in which forward chaining ones are desirable such as in dynamic programming. In this paper, we first introduce a variant of a Prolog interpreter that computes interpolations and then introduce the notion of sequential queries. These two notions allow a combination of both forms of reasoning in Prolog.DOI: http://dx.doi.org/10.5755/j01.itc.41.4.2364
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Most Prolog implementations are based on backward chaining techniques. However, there are many applications in which forward chaining ones are desirable such as in dynamic programming. In this paper, we first introduce a variant of a Prolog interpreter that computes interpolations and then introduce the notion of sequential queries. These two notions allow a combination of both forms of reasoning in Prolog.DOI: http://dx.doi.org/10.5755/j01.itc.41.4.2364
Key concepts: Prolog, Computer science, Forward chaining, Programming language, Logic programming, Chaining, Backward chaining, Implementation