Robinson's resolution principle proved to be strong enough to build a whole language, and quite a programming school upon it. University of Dunaujvaros Dunaujvaros, Hungary email: Pro-Contra-Log: a two way street for inference
Key words and phrases: logic programming, mechanical theorem proving, forward chaining, dynamic programming, natural language parsing Mathematics Subject Classification 2010: 68T27
Finally the article also discusses some practical questions of Contralog program development.Ĭomputing Classification System 1998: Computing methodologies-Logic programming and answer set programming After this, the inferential target model of Prolog/Contralog programs is introduced, and the possibility for implementing the ReALIS natural language parsing technology is described relying heavily on Contralog's forward chaining inference engine. Two examples, the well-known matrix chain multiplication problem and the Warshall algorithm are shown here. Then the next section shows how a recursive definition of some problems is executed by their Contralog definition automatically in a dynamic programming way. We introduce first a simple application example for Contralog. The article goes into details regarding the target model. The Contralog compiler is implemented using Prolog's de facto standardized macro expansion capability. The target model is Prolog, which ensures mutual switching from Contralog to Prolog and back. The article proposes Contralog: a Prolog-conform, forward-chaining language and an inference engine that is implemented as a preprocessor-compiler to Prolog.
The backward-chaining inference strategy of Prolog is inefficient for a number of problems. Sapientiae, Infqrmatica 8, 1 (2016) 41-62Ĭontralog: a Prolog conform forward-chaining environment and its application for dynamic programming and natural language parsingĪbstract.
0 kommentar(er)
